/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 --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 12:38:34,771 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 12:38:34,855 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 12:38:34,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 12:38:34,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 12:38:34,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 12:38:34,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 12:38:34,899 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 12:38:34,900 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 12:38:34,903 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 12:38:34,904 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 12:38:34,904 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 12:38:34,905 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 12:38:34,906 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 12:38:34,906 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 12:38:34,906 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 12:38:34,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 12:38:34,906 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 12:38:34,907 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 12:38:34,907 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 12:38:34,907 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 12:38:34,908 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 12:38:34,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 12:38:34,908 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 12:38:34,908 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 12:38:34,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 12:38:34,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 12:38:34,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 12:38:34,910 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 12:38:34,910 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 12:38:34,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 12:38:34,911 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 12:38:34,912 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 12:38:35,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 12:38:35,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 12:38:35,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 12:38:35,155 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 12:38:35,155 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 12:38:35,156 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c [2023-11-17 12:38:36,426 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 12:38:36,643 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 12:38:36,644 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c [2023-11-17 12:38:36,651 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/907a42e21/c4572ec952e74ee2a817ce59d50f3801/FLAGbdb31028d [2023-11-17 12:38:36,672 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/907a42e21/c4572ec952e74ee2a817ce59d50f3801 [2023-11-17 12:38:36,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 12:38:36,677 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 12:38:36,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 12:38:36,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 12:38:36,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 12:38:36,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:38:36" (1/1) ... [2023-11-17 12:38:36,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b35db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:36, skipping insertion in model container [2023-11-17 12:38:36,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:38:36" (1/1) ... [2023-11-17 12:38:36,715 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 12:38:36,907 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2526,2539] [2023-11-17 12:38:36,923 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 12:38:36,934 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 12:38:36,972 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2526,2539] [2023-11-17 12:38:36,975 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 12:38:36,989 INFO L206 MainTranslator]: Completed translation [2023-11-17 12:38:36,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:36 WrapperNode [2023-11-17 12:38:36,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 12:38:36,991 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 12:38:36,991 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 12:38:36,991 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 12:38:36,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:36" (1/1) ... [2023-11-17 12:38:37,014 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:36" (1/1) ... [2023-11-17 12:38:37,040 INFO L138 Inliner]: procedures = 24, calls = 34, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 149 [2023-11-17 12:38:37,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 12:38:37,041 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 12:38:37,041 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 12:38:37,042 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 12:38:37,050 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:36" (1/1) ... [2023-11-17 12:38:37,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:36" (1/1) ... [2023-11-17 12:38:37,065 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:36" (1/1) ... [2023-11-17 12:38:37,065 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:36" (1/1) ... [2023-11-17 12:38:37,071 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:36" (1/1) ... [2023-11-17 12:38:37,074 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:36" (1/1) ... [2023-11-17 12:38:37,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:36" (1/1) ... [2023-11-17 12:38:37,076 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:36" (1/1) ... [2023-11-17 12:38:37,079 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 12:38:37,080 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 12:38:37,080 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 12:38:37,080 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 12:38:37,082 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:36" (1/1) ... [2023-11-17 12:38:37,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 12:38:37,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:38:37,120 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 12:38:37,149 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 12:38:37,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 12:38:37,158 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 12:38:37,158 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 12:38:37,158 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 12:38:37,158 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 12:38:37,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 12:38:37,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 12:38:37,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 12:38:37,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 12:38:37,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 12:38:37,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 12:38:37,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 12:38:37,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 12:38:37,162 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 12:38:37,258 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 12:38:37,260 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 12:38:37,530 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 12:38:37,827 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 12:38:37,828 INFO L307 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-17 12:38:37,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:38:37 BoogieIcfgContainer [2023-11-17 12:38:37,829 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 12:38:37,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 12:38:37,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 12:38:37,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 12:38:37,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:38:36" (1/3) ... [2023-11-17 12:38:37,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d558055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:38:37, skipping insertion in model container [2023-11-17 12:38:37,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:38:36" (2/3) ... [2023-11-17 12:38:37,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d558055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:38:37, skipping insertion in model container [2023-11-17 12:38:37,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:38:37" (3/3) ... [2023-11-17 12:38:37,838 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-3.wvr.c [2023-11-17 12:38:37,854 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 12:38:37,854 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 12:38:37,854 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 12:38:37,909 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-17 12:38:37,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 56 flow [2023-11-17 12:38:37,969 INFO L124 PetriNetUnfolderBase]: 3/19 cut-off events. [2023-11-17 12:38:37,969 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 12:38:37,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 19 events. 3/19 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2023-11-17 12:38:37,975 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 21 transitions, 56 flow [2023-11-17 12:38:37,979 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 18 transitions, 48 flow [2023-11-17 12:38:37,986 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 12:38:38,004 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 22 places, 18 transitions, 48 flow [2023-11-17 12:38:38,008 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 22 places, 18 transitions, 48 flow [2023-11-17 12:38:38,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 18 transitions, 48 flow [2023-11-17 12:38:38,019 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2023-11-17 12:38:38,019 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 12:38:38,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 3/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 0/15 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2023-11-17 12:38:38,020 INFO L119 LiptonReduction]: Number of co-enabled transitions 54 [2023-11-17 12:38:38,065 INFO L134 LiptonReduction]: Checked pairs total: 54 [2023-11-17 12:38:38,066 INFO L136 LiptonReduction]: Total number of compositions: 1 [2023-11-17 12:38:38,090 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 12:38:38,097 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;@6ddc748e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 12:38:38,097 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-17 12:38:38,107 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 12:38:38,107 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2023-11-17 12:38:38,107 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 12:38:38,107 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:38:38,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:38:38,108 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 12:38:38,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:38:38,113 INFO L85 PathProgramCache]: Analyzing trace with hash -56927032, now seen corresponding path program 1 times [2023-11-17 12:38:38,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:38:38,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903158798] [2023-11-17 12:38:38,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:38:38,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:38:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:38:38,529 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 12:38:38,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:38:38,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903158798] [2023-11-17 12:38:38,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903158798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:38:38,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:38:38,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 12:38:38,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61856173] [2023-11-17 12:38:38,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:38:38,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 12:38:38,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:38:38,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 12:38:38,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 12:38:38,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2023-11-17 12:38:38,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 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 12:38:38,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:38:38,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2023-11-17 12:38:38,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:38:38,683 INFO L124 PetriNetUnfolderBase]: 75/136 cut-off events. [2023-11-17 12:38:38,683 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-17 12:38:38,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 136 events. 75/136 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 352 event pairs, 24 based on Foata normal form. 1/104 useless extension candidates. Maximal degree in co-relation 220. Up to 79 conditions per place. [2023-11-17 12:38:38,688 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 25 selfloop transitions, 3 changer transitions 1/29 dead transitions. [2023-11-17 12:38:38,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 29 transitions, 137 flow [2023-11-17 12:38:38,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 12:38:38,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 12:38:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2023-11-17 12:38:38,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2023-11-17 12:38:38,700 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 39 transitions. [2023-11-17 12:38:38,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 39 transitions. [2023-11-17 12:38:38,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:38:38,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 39 transitions. [2023-11-17 12:38:38,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 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 12:38:38,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 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 12:38:38,707 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 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 12:38:38,709 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 39 transitions. [2023-11-17 12:38:38,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 29 transitions, 137 flow [2023-11-17 12:38:38,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 29 transitions, 123 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 12:38:38,715 INFO L231 Difference]: Finished difference. Result has 20 places, 19 transitions, 57 flow [2023-11-17 12:38:38,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=20, PETRI_TRANSITIONS=19} [2023-11-17 12:38:38,720 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2023-11-17 12:38:38,720 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 19 transitions, 57 flow [2023-11-17 12:38:38,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 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 12:38:38,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:38:38,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:38:38,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 12:38:38,721 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 12:38:38,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:38:38,722 INFO L85 PathProgramCache]: Analyzing trace with hash -228847733, now seen corresponding path program 1 times [2023-11-17 12:38:38,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:38:38,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528189143] [2023-11-17 12:38:38,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:38:38,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:38:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:38:38,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:38:38,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:38:38,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528189143] [2023-11-17 12:38:38,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528189143] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:38:38,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:38:38,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 12:38:38,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449463129] [2023-11-17 12:38:38,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:38:38,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 12:38:38,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:38:38,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 12:38:38,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 12:38:38,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2023-11-17 12:38:38,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 19 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 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 12:38:38,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:38:38,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2023-11-17 12:38:38,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:38:39,023 INFO L124 PetriNetUnfolderBase]: 75/137 cut-off events. [2023-11-17 12:38:39,024 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-11-17 12:38:39,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 137 events. 75/137 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 338 event pairs, 48 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 120. Up to 137 conditions per place. [2023-11-17 12:38:39,026 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 18 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2023-11-17 12:38:39,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 20 transitions, 99 flow [2023-11-17 12:38:39,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 12:38:39,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 12:38:39,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2023-11-17 12:38:39,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2023-11-17 12:38:39,029 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 28 transitions. [2023-11-17 12:38:39,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 28 transitions. [2023-11-17 12:38:39,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:38:39,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 28 transitions. [2023-11-17 12:38:39,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 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 12:38:39,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 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 12:38:39,033 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 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 12:38:39,033 INFO L175 Difference]: Start difference. First operand has 20 places, 19 transitions, 57 flow. Second operand 3 states and 28 transitions. [2023-11-17 12:38:39,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 20 transitions, 99 flow [2023-11-17 12:38:39,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 20 transitions, 96 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 12:38:39,037 INFO L231 Difference]: Finished difference. Result has 22 places, 20 transitions, 66 flow [2023-11-17 12:38:39,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=22, PETRI_TRANSITIONS=20} [2023-11-17 12:38:39,038 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 1 predicate places. [2023-11-17 12:38:39,039 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 20 transitions, 66 flow [2023-11-17 12:38:39,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 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 12:38:39,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:38:39,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:38:39,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 12:38:39,040 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 12:38:39,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:38:39,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1363227100, now seen corresponding path program 1 times [2023-11-17 12:38:39,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:38:39,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596127799] [2023-11-17 12:38:39,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:38:39,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:38:39,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:38:39,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:38:39,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:38:39,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596127799] [2023-11-17 12:38:39,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596127799] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:38:39,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218627845] [2023-11-17 12:38:39,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:38:39,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:38:39,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:38:39,261 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 12:38:39,281 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 12:38:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:38:39,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 12:38:39,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:38:39,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:38:39,450 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:38:39,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:38:39,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218627845] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-17 12:38:39,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-17 12:38:39,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 5] total 6 [2023-11-17 12:38:39,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157934681] [2023-11-17 12:38:39,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:38:39,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 12:38:39,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:38:39,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 12:38:39,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 12:38:39,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2023-11-17 12:38:39,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 20 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 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 12:38:39,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:38:39,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2023-11-17 12:38:39,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:38:39,633 INFO L124 PetriNetUnfolderBase]: 83/151 cut-off events. [2023-11-17 12:38:39,633 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-17 12:38:39,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 151 events. 83/151 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 415 event pairs, 24 based on Foata normal form. 6/156 useless extension candidates. Maximal degree in co-relation 347. Up to 78 conditions per place. [2023-11-17 12:38:39,634 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 31 selfloop transitions, 4 changer transitions 1/36 dead transitions. [2023-11-17 12:38:39,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 36 transitions, 178 flow [2023-11-17 12:38:39,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 12:38:39,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 12:38:39,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2023-11-17 12:38:39,637 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2023-11-17 12:38:39,637 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 48 transitions. [2023-11-17 12:38:39,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 48 transitions. [2023-11-17 12:38:39,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:38:39,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 48 transitions. [2023-11-17 12:38:39,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 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 12:38:39,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 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 12:38:39,640 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 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 12:38:39,640 INFO L175 Difference]: Start difference. First operand has 22 places, 20 transitions, 66 flow. Second operand 4 states and 48 transitions. [2023-11-17 12:38:39,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 36 transitions, 178 flow [2023-11-17 12:38:39,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 36 transitions, 174 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-17 12:38:39,644 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 88 flow [2023-11-17 12:38:39,644 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2023-11-17 12:38:39,645 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2023-11-17 12:38:39,645 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 88 flow [2023-11-17 12:38:39,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 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 12:38:39,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:38:39,645 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:38:39,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-17 12:38:39,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:38:39,851 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 12:38:39,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:38:39,852 INFO L85 PathProgramCache]: Analyzing trace with hash -2106877949, now seen corresponding path program 1 times [2023-11-17 12:38:39,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:38:39,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262948910] [2023-11-17 12:38:39,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:38:39,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:38:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:38:40,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:38:40,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:38:40,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262948910] [2023-11-17 12:38:40,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262948910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:38:40,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:38:40,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 12:38:40,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222355446] [2023-11-17 12:38:40,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:38:40,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 12:38:40,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:38:40,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 12:38:40,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 12:38:40,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2023-11-17 12:38:40,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 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 12:38:40,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:38:40,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2023-11-17 12:38:40,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:38:40,126 INFO L124 PetriNetUnfolderBase]: 93/184 cut-off events. [2023-11-17 12:38:40,126 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2023-11-17 12:38:40,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 184 events. 93/184 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 626 event pairs, 26 based on Foata normal form. 12/195 useless extension candidates. Maximal degree in co-relation 490. Up to 101 conditions per place. [2023-11-17 12:38:40,128 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 33 selfloop transitions, 4 changer transitions 8/45 dead transitions. [2023-11-17 12:38:40,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 45 transitions, 253 flow [2023-11-17 12:38:40,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 12:38:40,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 12:38:40,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2023-11-17 12:38:40,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509090909090909 [2023-11-17 12:38:40,130 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 56 transitions. [2023-11-17 12:38:40,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 56 transitions. [2023-11-17 12:38:40,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:38:40,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 56 transitions. [2023-11-17 12:38:40,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 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 12:38:40,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 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 12:38:40,131 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 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 12:38:40,131 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 88 flow. Second operand 5 states and 56 transitions. [2023-11-17 12:38:40,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 45 transitions, 253 flow [2023-11-17 12:38:40,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 45 transitions, 248 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-17 12:38:40,133 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 115 flow [2023-11-17 12:38:40,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-11-17 12:38:40,134 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 11 predicate places. [2023-11-17 12:38:40,134 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 115 flow [2023-11-17 12:38:40,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 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 12:38:40,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:38:40,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:38:40,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 12:38:40,135 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 12:38:40,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:38:40,135 INFO L85 PathProgramCache]: Analyzing trace with hash -183755434, now seen corresponding path program 2 times [2023-11-17 12:38:40,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:38:40,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859357461] [2023-11-17 12:38:40,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:38:40,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:38:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:38:40,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:38:40,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:38:40,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859357461] [2023-11-17 12:38:40,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859357461] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:38:40,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933032684] [2023-11-17 12:38:40,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 12:38:40,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:38:40,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:38:40,232 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 12:38:40,234 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 12:38:40,321 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 12:38:40,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:38:40,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 12:38:40,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:38:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:38:40,367 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:38:40,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:38:40,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933032684] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:38:40,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:38:40,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-11-17 12:38:40,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069492272] [2023-11-17 12:38:40,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:38:40,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 12:38:40,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:38:40,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 12:38:40,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-17 12:38:40,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2023-11-17 12:38:40,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 115 flow. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 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 12:38:40,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:38:40,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2023-11-17 12:38:40,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:38:40,623 INFO L124 PetriNetUnfolderBase]: 117/232 cut-off events. [2023-11-17 12:38:40,623 INFO L125 PetriNetUnfolderBase]: For 276/276 co-relation queries the response was YES. [2023-11-17 12:38:40,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 783 conditions, 232 events. 117/232 cut-off events. For 276/276 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 810 event pairs, 42 based on Foata normal form. 6/237 useless extension candidates. Maximal degree in co-relation 761. Up to 135 conditions per place. [2023-11-17 12:38:40,626 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 34 selfloop transitions, 11 changer transitions 6/51 dead transitions. [2023-11-17 12:38:40,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 51 transitions, 338 flow [2023-11-17 12:38:40,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 12:38:40,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 12:38:40,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2023-11-17 12:38:40,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5272727272727272 [2023-11-17 12:38:40,627 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 58 transitions. [2023-11-17 12:38:40,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 58 transitions. [2023-11-17 12:38:40,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:38:40,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 58 transitions. [2023-11-17 12:38:40,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 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 12:38:40,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 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 12:38:40,629 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 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 12:38:40,629 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 115 flow. Second operand 5 states and 58 transitions. [2023-11-17 12:38:40,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 51 transitions, 338 flow [2023-11-17 12:38:40,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 51 transitions, 320 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-11-17 12:38:40,631 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 194 flow [2023-11-17 12:38:40,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2023-11-17 12:38:40,632 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 14 predicate places. [2023-11-17 12:38:40,632 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 194 flow [2023-11-17 12:38:40,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 0 states have call successors, (0), 0 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 12:38:40,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:38:40,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:38:40,638 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 12:38:40,838 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 12:38:40,838 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 12:38:40,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:38:40,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1914948259, now seen corresponding path program 2 times [2023-11-17 12:38:40,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:38:40,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535179129] [2023-11-17 12:38:40,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:38:40,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:38:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:38:40,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:38:40,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:38:40,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535179129] [2023-11-17 12:38:40,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535179129] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:38:40,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:38:40,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 12:38:40,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109885006] [2023-11-17 12:38:40,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:38:40,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 12:38:40,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:38:40,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 12:38:40,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 12:38:40,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2023-11-17 12:38:40,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 194 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 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 12:38:40,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:38:40,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2023-11-17 12:38:40,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:38:41,007 INFO L124 PetriNetUnfolderBase]: 123/242 cut-off events. [2023-11-17 12:38:41,007 INFO L125 PetriNetUnfolderBase]: For 475/475 co-relation queries the response was YES. [2023-11-17 12:38:41,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 242 events. 123/242 cut-off events. For 475/475 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 895 event pairs, 38 based on Foata normal form. 4/245 useless extension candidates. Maximal degree in co-relation 903. Up to 147 conditions per place. [2023-11-17 12:38:41,009 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 36 selfloop transitions, 10 changer transitions 0/46 dead transitions. [2023-11-17 12:38:41,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 363 flow [2023-11-17 12:38:41,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 12:38:41,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 12:38:41,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2023-11-17 12:38:41,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2023-11-17 12:38:41,011 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 46 transitions. [2023-11-17 12:38:41,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 46 transitions. [2023-11-17 12:38:41,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:38:41,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 46 transitions. [2023-11-17 12:38:41,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 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 12:38:41,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 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 12:38:41,014 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 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 12:38:41,014 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 194 flow. Second operand 4 states and 46 transitions. [2023-11-17 12:38:41,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 363 flow [2023-11-17 12:38:41,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 46 transitions, 361 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-17 12:38:41,020 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 256 flow [2023-11-17 12:38:41,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=256, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2023-11-17 12:38:41,023 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 19 predicate places. [2023-11-17 12:38:41,023 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 256 flow [2023-11-17 12:38:41,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 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 12:38:41,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:38:41,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:38:41,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 12:38:41,024 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 12:38:41,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:38:41,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1692788725, now seen corresponding path program 3 times [2023-11-17 12:38:41,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:38:41,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500524212] [2023-11-17 12:38:41,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:38:41,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:38:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:38:41,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:38:41,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:38:41,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500524212] [2023-11-17 12:38:41,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500524212] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:38:41,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:38:41,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 12:38:41,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244968323] [2023-11-17 12:38:41,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:38:41,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 12:38:41,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:38:41,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 12:38:41,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 12:38:41,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2023-11-17 12:38:41,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 256 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 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 12:38:41,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:38:41,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2023-11-17 12:38:41,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:38:41,225 INFO L124 PetriNetUnfolderBase]: 123/236 cut-off events. [2023-11-17 12:38:41,226 INFO L125 PetriNetUnfolderBase]: For 645/645 co-relation queries the response was YES. [2023-11-17 12:38:41,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1008 conditions, 236 events. 123/236 cut-off events. For 645/645 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 811 event pairs, 38 based on Foata normal form. 4/239 useless extension candidates. Maximal degree in co-relation 982. Up to 146 conditions per place. [2023-11-17 12:38:41,228 INFO L140 encePairwiseOnDemand]: 18/22 looper letters, 33 selfloop transitions, 9 changer transitions 4/46 dead transitions. [2023-11-17 12:38:41,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 405 flow [2023-11-17 12:38:41,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 12:38:41,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 12:38:41,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2023-11-17 12:38:41,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5227272727272727 [2023-11-17 12:38:41,229 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 46 transitions. [2023-11-17 12:38:41,229 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 46 transitions. [2023-11-17 12:38:41,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:38:41,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 46 transitions. [2023-11-17 12:38:41,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 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 12:38:41,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 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 12:38:41,230 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 0 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 12:38:41,230 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 256 flow. Second operand 4 states and 46 transitions. [2023-11-17 12:38:41,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 405 flow [2023-11-17 12:38:41,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 390 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-17 12:38:41,234 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 285 flow [2023-11-17 12:38:41,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=285, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2023-11-17 12:38:41,235 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 23 predicate places. [2023-11-17 12:38:41,235 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 285 flow [2023-11-17 12:38:41,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 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 12:38:41,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:38:41,235 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:38:41,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 12:38:41,236 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 12:38:41,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:38:41,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1117524934, now seen corresponding path program 3 times [2023-11-17 12:38:41,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:38:41,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139514772] [2023-11-17 12:38:41,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:38:41,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:38:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:38:41,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:38:41,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:38:41,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139514772] [2023-11-17 12:38:41,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139514772] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:38:41,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:38:41,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 12:38:41,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369894869] [2023-11-17 12:38:41,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:38:41,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 12:38:41,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:38:41,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 12:38:41,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-17 12:38:41,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2023-11-17 12:38:41,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 285 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 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 12:38:41,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:38:41,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2023-11-17 12:38:41,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:38:41,445 INFO L124 PetriNetUnfolderBase]: 106/195 cut-off events. [2023-11-17 12:38:41,445 INFO L125 PetriNetUnfolderBase]: For 666/666 co-relation queries the response was YES. [2023-11-17 12:38:41,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 195 events. 106/195 cut-off events. For 666/666 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 580 event pairs, 34 based on Foata normal form. 2/196 useless extension candidates. Maximal degree in co-relation 847. Up to 149 conditions per place. [2023-11-17 12:38:41,448 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 31 selfloop transitions, 11 changer transitions 2/44 dead transitions. [2023-11-17 12:38:41,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 415 flow [2023-11-17 12:38:41,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 12:38:41,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 12:38:41,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2023-11-17 12:38:41,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2023-11-17 12:38:41,450 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 45 transitions. [2023-11-17 12:38:41,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 45 transitions. [2023-11-17 12:38:41,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:38:41,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 45 transitions. [2023-11-17 12:38:41,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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 12:38:41,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 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 12:38:41,451 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 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 12:38:41,451 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 285 flow. Second operand 5 states and 45 transitions. [2023-11-17 12:38:41,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 415 flow [2023-11-17 12:38:41,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 383 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-11-17 12:38:41,455 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 301 flow [2023-11-17 12:38:41,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=301, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2023-11-17 12:38:41,458 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 24 predicate places. [2023-11-17 12:38:41,458 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 301 flow [2023-11-17 12:38:41,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 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 12:38:41,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:38:41,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:38:41,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 12:38:41,460 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 12:38:41,461 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:38:41,461 INFO L85 PathProgramCache]: Analyzing trace with hash -973290194, now seen corresponding path program 4 times [2023-11-17 12:38:41,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:38:41,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857913618] [2023-11-17 12:38:41,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:38:41,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:38:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:38:41,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:38:41,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:38:41,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857913618] [2023-11-17 12:38:41,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857913618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:38:41,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:38:41,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 12:38:41,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881835858] [2023-11-17 12:38:41,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:38:41,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 12:38:41,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:38:41,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 12:38:41,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 12:38:41,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2023-11-17 12:38:41,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 301 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 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 12:38:41,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:38:41,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2023-11-17 12:38:41,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:38:41,716 INFO L124 PetriNetUnfolderBase]: 100/181 cut-off events. [2023-11-17 12:38:41,716 INFO L125 PetriNetUnfolderBase]: For 711/711 co-relation queries the response was YES. [2023-11-17 12:38:41,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 181 events. 100/181 cut-off events. For 711/711 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 515 event pairs, 31 based on Foata normal form. 4/184 useless extension candidates. Maximal degree in co-relation 845. Up to 130 conditions per place. [2023-11-17 12:38:41,718 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 32 selfloop transitions, 9 changer transitions 4/45 dead transitions. [2023-11-17 12:38:41,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 45 transitions, 433 flow [2023-11-17 12:38:41,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 12:38:41,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 12:38:41,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2023-11-17 12:38:41,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2023-11-17 12:38:41,720 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 45 transitions. [2023-11-17 12:38:41,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 45 transitions. [2023-11-17 12:38:41,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:38:41,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 45 transitions. [2023-11-17 12:38:41,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 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 12:38:41,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 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 12:38:41,721 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 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 12:38:41,721 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 301 flow. Second operand 5 states and 45 transitions. [2023-11-17 12:38:41,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 45 transitions, 433 flow [2023-11-17 12:38:41,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 45 transitions, 419 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-17 12:38:41,724 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 323 flow [2023-11-17 12:38:41,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=323, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2023-11-17 12:38:41,725 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 29 predicate places. [2023-11-17 12:38:41,725 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 323 flow [2023-11-17 12:38:41,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 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 12:38:41,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:38:41,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:38:41,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 12:38:41,726 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 12:38:41,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:38:41,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1571581472, now seen corresponding path program 1 times [2023-11-17 12:38:41,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:38:41,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984107381] [2023-11-17 12:38:41,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:38:41,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:38:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:38:42,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:38:42,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:38:42,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984107381] [2023-11-17 12:38:42,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984107381] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:38:42,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809346950] [2023-11-17 12:38:42,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:38:42,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:38:42,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:38:42,194 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 12:38:42,222 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 12:38:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:38:42,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-17 12:38:42,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:38:42,475 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 12:38:42,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 15 [2023-11-17 12:38:42,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:38:42,494 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:38:42,609 INFO L349 Elim1Store]: treesize reduction 5, result has 92.3 percent of original size [2023-11-17 12:38:42,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 87 [2023-11-17 12:38:42,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:38:42,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809346950] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:38:42,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:38:42,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 17 [2023-11-17 12:38:42,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865380234] [2023-11-17 12:38:42,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:38:42,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-17 12:38:42,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:38:42,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-17 12:38:42,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2023-11-17 12:38:42,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2023-11-17 12:38:42,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 323 flow. Second operand has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 17 states have internal predecessors, (97), 0 states have call successors, (0), 0 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 12:38:42,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:38:42,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2023-11-17 12:38:42,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:38:45,501 INFO L124 PetriNetUnfolderBase]: 353/634 cut-off events. [2023-11-17 12:38:45,501 INFO L125 PetriNetUnfolderBase]: For 2529/2529 co-relation queries the response was YES. [2023-11-17 12:38:45,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3095 conditions, 634 events. 353/634 cut-off events. For 2529/2529 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2814 event pairs, 32 based on Foata normal form. 10/642 useless extension candidates. Maximal degree in co-relation 3036. Up to 267 conditions per place. [2023-11-17 12:38:45,506 INFO L140 encePairwiseOnDemand]: 11/22 looper letters, 59 selfloop transitions, 33 changer transitions 98/190 dead transitions. [2023-11-17 12:38:45,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 190 transitions, 1687 flow [2023-11-17 12:38:45,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 12:38:45,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-11-17 12:38:45,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 251 transitions. [2023-11-17 12:38:45,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3934169278996865 [2023-11-17 12:38:45,509 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 251 transitions. [2023-11-17 12:38:45,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 251 transitions. [2023-11-17 12:38:45,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:38:45,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 251 transitions. [2023-11-17 12:38:45,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 8.655172413793103) internal successors, (251), 29 states have internal predecessors, (251), 0 states have call successors, (0), 0 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 12:38:45,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 22.0) internal successors, (660), 30 states have internal predecessors, (660), 0 states have call successors, (0), 0 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 12:38:45,512 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 22.0) internal successors, (660), 30 states have internal predecessors, (660), 0 states have call successors, (0), 0 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 12:38:45,512 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 323 flow. Second operand 29 states and 251 transitions. [2023-11-17 12:38:45,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 190 transitions, 1687 flow [2023-11-17 12:38:45,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 190 transitions, 1567 flow, removed 18 selfloop flow, removed 5 redundant places. [2023-11-17 12:38:45,522 INFO L231 Difference]: Finished difference. Result has 86 places, 55 transitions, 583 flow [2023-11-17 12:38:45,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=583, PETRI_PLACES=86, PETRI_TRANSITIONS=55} [2023-11-17 12:38:45,522 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 65 predicate places. [2023-11-17 12:38:45,522 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 55 transitions, 583 flow [2023-11-17 12:38:45,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 17 states have internal predecessors, (97), 0 states have call successors, (0), 0 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 12:38:45,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:38:45,523 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:38:45,532 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 12:38:45,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:38:45,729 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:38:45,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:38:45,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1400540664, now seen corresponding path program 2 times [2023-11-17 12:38:45,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:38:45,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799045405] [2023-11-17 12:38:45,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:38:45,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:38:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:38:46,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:38:46,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:38:46,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799045405] [2023-11-17 12:38:46,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799045405] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:38:46,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31845160] [2023-11-17 12:38:46,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 12:38:46,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:38:46,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:38:46,289 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 12:38:46,304 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 12:38:46,377 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 12:38:46,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:38:46,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-17 12:38:46,380 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:38:46,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 12:38:46,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:38:46,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:38:46,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 12:38:46,664 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 12:38:46,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 15 [2023-11-17 12:38:46,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:38:46,693 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:38:47,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:38:47,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 217 treesize of output 133 [2023-11-17 12:38:47,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:38:47,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 1032 treesize of output 888 [2023-11-17 12:38:47,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:38:47,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 178 treesize of output 204 [2023-11-17 12:38:47,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:38:47,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 113 [2023-11-17 12:38:47,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:38:47,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31845160] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:38:47,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:38:47,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 19 [2023-11-17 12:38:47,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974014836] [2023-11-17 12:38:47,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:38:47,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-17 12:38:47,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:38:47,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-17 12:38:47,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=282, Unknown=7, NotChecked=0, Total=342 [2023-11-17 12:38:47,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2023-11-17 12:38:47,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 55 transitions, 583 flow. Second operand has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 0 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 12:38:47,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:38:47,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2023-11-17 12:38:47,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:38:54,834 INFO L124 PetriNetUnfolderBase]: 199/362 cut-off events. [2023-11-17 12:38:54,835 INFO L125 PetriNetUnfolderBase]: For 2340/2340 co-relation queries the response was YES. [2023-11-17 12:38:54,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2202 conditions, 362 events. 199/362 cut-off events. For 2340/2340 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1288 event pairs, 26 based on Foata normal form. 30/392 useless extension candidates. Maximal degree in co-relation 2167. Up to 159 conditions per place. [2023-11-17 12:38:54,838 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 42 selfloop transitions, 21 changer transitions 39/102 dead transitions. [2023-11-17 12:38:54,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 102 transitions, 1143 flow [2023-11-17 12:38:54,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-17 12:38:54,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-17 12:38:54,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 144 transitions. [2023-11-17 12:38:54,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2023-11-17 12:38:54,840 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 144 transitions. [2023-11-17 12:38:54,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 144 transitions. [2023-11-17 12:38:54,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:38:54,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 144 transitions. [2023-11-17 12:38:54,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 8.0) internal successors, (144), 18 states have internal predecessors, (144), 0 states have call successors, (0), 0 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 12:38:54,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 22.0) internal successors, (418), 19 states have internal predecessors, (418), 0 states have call successors, (0), 0 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 12:38:54,842 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 22.0) internal successors, (418), 19 states have internal predecessors, (418), 0 states have call successors, (0), 0 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 12:38:54,842 INFO L175 Difference]: Start difference. First operand has 86 places, 55 transitions, 583 flow. Second operand 18 states and 144 transitions. [2023-11-17 12:38:54,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 102 transitions, 1143 flow [2023-11-17 12:38:54,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 102 transitions, 940 flow, removed 82 selfloop flow, removed 16 redundant places. [2023-11-17 12:38:54,853 INFO L231 Difference]: Finished difference. Result has 74 places, 44 transitions, 419 flow [2023-11-17 12:38:54,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=419, PETRI_PLACES=74, PETRI_TRANSITIONS=44} [2023-11-17 12:38:54,853 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 53 predicate places. [2023-11-17 12:38:54,853 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 44 transitions, 419 flow [2023-11-17 12:38:54,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 0 states have call successors, (0), 0 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 12:38:54,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:38:54,854 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:38:54,860 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 12:38:55,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:38:55,060 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:38:55,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:38:55,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1862909846, now seen corresponding path program 3 times [2023-11-17 12:38:55,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:38:55,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678900998] [2023-11-17 12:38:55,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:38:55,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:38:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:38:55,311 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 12:38:55,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:38:55,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678900998] [2023-11-17 12:38:55,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678900998] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:38:55,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817673618] [2023-11-17 12:38:55,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 12:38:55,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:38:55,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:38:55,313 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 12:38:55,332 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 12:38:55,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 12:38:55,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:38:55,549 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-17 12:38:55,550 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:38:55,647 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 12:38:55,647 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:38:56,010 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 12:38:56,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817673618] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:38:56,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:38:56,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-11-17 12:38:56,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442865049] [2023-11-17 12:38:56,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:38:56,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-17 12:38:56,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:38:56,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-17 12:38:56,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-11-17 12:38:56,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2023-11-17 12:38:56,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 44 transitions, 419 flow. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 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 12:38:56,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:38:56,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2023-11-17 12:38:56,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:39:00,065 INFO L124 PetriNetUnfolderBase]: 254/446 cut-off events. [2023-11-17 12:39:00,065 INFO L125 PetriNetUnfolderBase]: For 1714/1714 co-relation queries the response was YES. [2023-11-17 12:39:00,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2417 conditions, 446 events. 254/446 cut-off events. For 1714/1714 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1616 event pairs, 16 based on Foata normal form. 46/492 useless extension candidates. Maximal degree in co-relation 2390. Up to 221 conditions per place. [2023-11-17 12:39:00,070 INFO L140 encePairwiseOnDemand]: 17/22 looper letters, 94 selfloop transitions, 26 changer transitions 0/120 dead transitions. [2023-11-17 12:39:00,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 120 transitions, 1271 flow [2023-11-17 12:39:00,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-17 12:39:00,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-17 12:39:00,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 110 transitions. [2023-11-17 12:39:00,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2023-11-17 12:39:00,075 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 110 transitions. [2023-11-17 12:39:00,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 110 transitions. [2023-11-17 12:39:00,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:39:00,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 110 transitions. [2023-11-17 12:39:00,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 10.0) internal successors, (110), 11 states have internal predecessors, (110), 0 states have call successors, (0), 0 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 12:39:00,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 22.0) internal successors, (264), 12 states have internal predecessors, (264), 0 states have call successors, (0), 0 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 12:39:00,076 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 22.0) internal successors, (264), 12 states have internal predecessors, (264), 0 states have call successors, (0), 0 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 12:39:00,076 INFO L175 Difference]: Start difference. First operand has 74 places, 44 transitions, 419 flow. Second operand 11 states and 110 transitions. [2023-11-17 12:39:00,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 120 transitions, 1271 flow [2023-11-17 12:39:00,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 120 transitions, 1225 flow, removed 2 selfloop flow, removed 11 redundant places. [2023-11-17 12:39:00,083 INFO L231 Difference]: Finished difference. Result has 68 places, 54 transitions, 576 flow [2023-11-17 12:39:00,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=576, PETRI_PLACES=68, PETRI_TRANSITIONS=54} [2023-11-17 12:39:00,083 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 47 predicate places. [2023-11-17 12:39:00,083 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 54 transitions, 576 flow [2023-11-17 12:39:00,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 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 12:39:00,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:39:00,084 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:39:00,089 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 12:39:00,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-17 12:39:00,288 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:39:00,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:39:00,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1677546611, now seen corresponding path program 4 times [2023-11-17 12:39:00,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:39:00,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301120268] [2023-11-17 12:39:00,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:39:00,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:39:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:39:01,948 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:39:01,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:39:01,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301120268] [2023-11-17 12:39:01,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301120268] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:39:01,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205204357] [2023-11-17 12:39:01,949 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 12:39:01,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:39:01,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:39:01,950 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 12:39:01,954 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 12:39:02,040 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 12:39:02,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:39:02,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-17 12:39:02,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:39:02,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:39:02,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2023-11-17 12:39:02,239 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:39:02,240 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:39:02,536 INFO L349 Elim1Store]: treesize reduction 15, result has 90.2 percent of original size [2023-11-17 12:39:02,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 173 [2023-11-17 12:39:02,770 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 12:39:02,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205204357] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:39:02,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:39:02,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 4] total 18 [2023-11-17 12:39:02,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220061841] [2023-11-17 12:39:02,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:39:02,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-17 12:39:02,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:39:02,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-17 12:39:02,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2023-11-17 12:39:02,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2023-11-17 12:39:02,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 54 transitions, 576 flow. Second operand has 20 states, 20 states have (on average 5.45) internal successors, (109), 20 states have internal predecessors, (109), 0 states have call successors, (0), 0 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 12:39:02,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:39:02,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2023-11-17 12:39:02,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:39:03,682 INFO L124 PetriNetUnfolderBase]: 652/1150 cut-off events. [2023-11-17 12:39:03,682 INFO L125 PetriNetUnfolderBase]: For 5621/5621 co-relation queries the response was YES. [2023-11-17 12:39:03,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6469 conditions, 1150 events. 652/1150 cut-off events. For 5621/5621 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5171 event pairs, 75 based on Foata normal form. 4/1154 useless extension candidates. Maximal degree in co-relation 6009. Up to 533 conditions per place. [2023-11-17 12:39:03,695 INFO L140 encePairwiseOnDemand]: 15/22 looper letters, 118 selfloop transitions, 85 changer transitions 2/205 dead transitions. [2023-11-17 12:39:03,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 205 transitions, 2356 flow [2023-11-17 12:39:03,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-17 12:39:03,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-17 12:39:03,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 190 transitions. [2023-11-17 12:39:03,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41125541125541126 [2023-11-17 12:39:03,697 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 190 transitions. [2023-11-17 12:39:03,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 190 transitions. [2023-11-17 12:39:03,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:39:03,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 190 transitions. [2023-11-17 12:39:03,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 9.047619047619047) internal successors, (190), 21 states have internal predecessors, (190), 0 states have call successors, (0), 0 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 12:39:03,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 22.0) internal successors, (484), 22 states have internal predecessors, (484), 0 states have call successors, (0), 0 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 12:39:03,699 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 22.0) internal successors, (484), 22 states have internal predecessors, (484), 0 states have call successors, (0), 0 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 12:39:03,699 INFO L175 Difference]: Start difference. First operand has 68 places, 54 transitions, 576 flow. Second operand 21 states and 190 transitions. [2023-11-17 12:39:03,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 205 transitions, 2356 flow [2023-11-17 12:39:03,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 205 transitions, 2043 flow, removed 113 selfloop flow, removed 6 redundant places. [2023-11-17 12:39:03,716 INFO L231 Difference]: Finished difference. Result has 86 places, 131 transitions, 1474 flow [2023-11-17 12:39:03,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1474, PETRI_PLACES=86, PETRI_TRANSITIONS=131} [2023-11-17 12:39:03,717 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 65 predicate places. [2023-11-17 12:39:03,717 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 131 transitions, 1474 flow [2023-11-17 12:39:03,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.45) internal successors, (109), 20 states have internal predecessors, (109), 0 states have call successors, (0), 0 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 12:39:03,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:39:03,717 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:39:03,722 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 12:39:03,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:39:03,921 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:39:03,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:39:03,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1772413015, now seen corresponding path program 5 times [2023-11-17 12:39:03,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:39:03,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163701180] [2023-11-17 12:39:03,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:39:03,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:39:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:39:05,089 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:39:05,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:39:05,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163701180] [2023-11-17 12:39:05,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163701180] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:39:05,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256449979] [2023-11-17 12:39:05,090 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 12:39:05,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:39:05,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:39:05,091 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 12:39:05,101 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 12:39:05,202 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-17 12:39:05,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:39:05,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-17 12:39:05,206 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:39:05,393 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:39:05,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2023-11-17 12:39:05,403 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:39:05,404 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:39:05,681 INFO L349 Elim1Store]: treesize reduction 15, result has 90.2 percent of original size [2023-11-17 12:39:05,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 173 [2023-11-17 12:39:05,943 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:39:05,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256449979] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:39:05,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:39:05,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 5] total 19 [2023-11-17 12:39:05,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901341639] [2023-11-17 12:39:05,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:39:05,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-17 12:39:05,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:39:05,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-17 12:39:05,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2023-11-17 12:39:05,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2023-11-17 12:39:05,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 131 transitions, 1474 flow. Second operand has 21 states, 21 states have (on average 5.333333333333333) internal successors, (112), 21 states have internal predecessors, (112), 0 states have call successors, (0), 0 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 12:39:05,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:39:05,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2023-11-17 12:39:05,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:39:07,262 INFO L124 PetriNetUnfolderBase]: 1196/2117 cut-off events. [2023-11-17 12:39:07,263 INFO L125 PetriNetUnfolderBase]: For 9847/9847 co-relation queries the response was YES. [2023-11-17 12:39:07,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11784 conditions, 2117 events. 1196/2117 cut-off events. For 9847/9847 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11447 event pairs, 189 based on Foata normal form. 4/2121 useless extension candidates. Maximal degree in co-relation 11046. Up to 1068 conditions per place. [2023-11-17 12:39:07,287 INFO L140 encePairwiseOnDemand]: 15/22 looper letters, 175 selfloop transitions, 128 changer transitions 2/305 dead transitions. [2023-11-17 12:39:07,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 305 transitions, 3606 flow [2023-11-17 12:39:07,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-17 12:39:07,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-11-17 12:39:07,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 217 transitions. [2023-11-17 12:39:07,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44834710743801653 [2023-11-17 12:39:07,289 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 217 transitions. [2023-11-17 12:39:07,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 217 transitions. [2023-11-17 12:39:07,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:39:07,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 217 transitions. [2023-11-17 12:39:07,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 9.863636363636363) internal successors, (217), 22 states have internal predecessors, (217), 0 states have call successors, (0), 0 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 12:39:07,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 22.0) internal successors, (506), 23 states have internal predecessors, (506), 0 states have call successors, (0), 0 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 12:39:07,291 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 22.0) internal successors, (506), 23 states have internal predecessors, (506), 0 states have call successors, (0), 0 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 12:39:07,291 INFO L175 Difference]: Start difference. First operand has 86 places, 131 transitions, 1474 flow. Second operand 22 states and 217 transitions. [2023-11-17 12:39:07,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 305 transitions, 3606 flow [2023-11-17 12:39:07,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 305 transitions, 3159 flow, removed 220 selfloop flow, removed 4 redundant places. [2023-11-17 12:39:07,323 INFO L231 Difference]: Finished difference. Result has 110 places, 209 transitions, 2413 flow [2023-11-17 12:39:07,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=1171, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2413, PETRI_PLACES=110, PETRI_TRANSITIONS=209} [2023-11-17 12:39:07,324 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 89 predicate places. [2023-11-17 12:39:07,324 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 209 transitions, 2413 flow [2023-11-17 12:39:07,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.333333333333333) internal successors, (112), 21 states have internal predecessors, (112), 0 states have call successors, (0), 0 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 12:39:07,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:39:07,324 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:39:07,333 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 12:39:07,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:39:07,540 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:39:07,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:39:07,541 INFO L85 PathProgramCache]: Analyzing trace with hash -678211757, now seen corresponding path program 6 times [2023-11-17 12:39:07,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:39:07,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244713790] [2023-11-17 12:39:07,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:39:07,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:39:07,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:39:08,748 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:39:08,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:39:08,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244713790] [2023-11-17 12:39:08,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244713790] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:39:08,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862299073] [2023-11-17 12:39:08,749 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 12:39:08,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:39:08,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:39:08,753 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:39:08,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-17 12:39:08,873 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-17 12:39:08,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:39:08,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-17 12:39:08,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:39:09,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:39:09,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2023-11-17 12:39:09,042 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:39:09,043 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:39:09,252 INFO L349 Elim1Store]: treesize reduction 15, result has 90.2 percent of original size [2023-11-17 12:39:09,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 173 [2023-11-17 12:39:09,443 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 12:39:09,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862299073] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:39:09,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:39:09,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 4] total 17 [2023-11-17 12:39:09,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818249336] [2023-11-17 12:39:09,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:39:09,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-17 12:39:09,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:39:09,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-17 12:39:09,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2023-11-17 12:39:09,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2023-11-17 12:39:09,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 209 transitions, 2413 flow. Second operand has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 0 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 12:39:09,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:39:09,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2023-11-17 12:39:09,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:39:10,589 INFO L124 PetriNetUnfolderBase]: 1576/2791 cut-off events. [2023-11-17 12:39:10,589 INFO L125 PetriNetUnfolderBase]: For 13917/13917 co-relation queries the response was YES. [2023-11-17 12:39:10,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15692 conditions, 2791 events. 1576/2791 cut-off events. For 13917/13917 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 16055 event pairs, 299 based on Foata normal form. 4/2795 useless extension candidates. Maximal degree in co-relation 15642. Up to 2005 conditions per place. [2023-11-17 12:39:10,619 INFO L140 encePairwiseOnDemand]: 15/22 looper letters, 221 selfloop transitions, 101 changer transitions 1/323 dead transitions. [2023-11-17 12:39:10,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 323 transitions, 4126 flow [2023-11-17 12:39:10,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-17 12:39:10,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-17 12:39:10,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 170 transitions. [2023-11-17 12:39:10,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38636363636363635 [2023-11-17 12:39:10,621 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 170 transitions. [2023-11-17 12:39:10,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 170 transitions. [2023-11-17 12:39:10,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:39:10,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 170 transitions. [2023-11-17 12:39:10,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 8.5) internal successors, (170), 20 states have internal predecessors, (170), 0 states have call successors, (0), 0 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 12:39:10,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 22.0) internal successors, (462), 21 states have internal predecessors, (462), 0 states have call successors, (0), 0 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 12:39:10,623 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 22.0) internal successors, (462), 21 states have internal predecessors, (462), 0 states have call successors, (0), 0 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 12:39:10,623 INFO L175 Difference]: Start difference. First operand has 110 places, 209 transitions, 2413 flow. Second operand 20 states and 170 transitions. [2023-11-17 12:39:10,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 323 transitions, 4126 flow [2023-11-17 12:39:10,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 323 transitions, 3755 flow, removed 158 selfloop flow, removed 10 redundant places. [2023-11-17 12:39:10,675 INFO L231 Difference]: Finished difference. Result has 123 places, 263 transitions, 3119 flow [2023-11-17 12:39:10,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=2130, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3119, PETRI_PLACES=123, PETRI_TRANSITIONS=263} [2023-11-17 12:39:10,676 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 102 predicate places. [2023-11-17 12:39:10,676 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 263 transitions, 3119 flow [2023-11-17 12:39:10,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 0 states have call successors, (0), 0 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 12:39:10,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:39:10,676 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:39:10,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-17 12:39:10,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-17 12:39:10,882 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:39:10,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:39:10,883 INFO L85 PathProgramCache]: Analyzing trace with hash -362421895, now seen corresponding path program 7 times [2023-11-17 12:39:10,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:39:10,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149397562] [2023-11-17 12:39:10,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:39:10,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:39:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:39:11,925 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:39:11,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:39:11,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149397562] [2023-11-17 12:39:11,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149397562] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:39:11,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222825852] [2023-11-17 12:39:11,926 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 12:39:11,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:39:11,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:39:11,927 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:39:11,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-17 12:39:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:39:12,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-17 12:39:12,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:39:12,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:39:12,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2023-11-17 12:39:12,231 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:39:12,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:39:12,434 INFO L349 Elim1Store]: treesize reduction 15, result has 90.2 percent of original size [2023-11-17 12:39:12,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 51 treesize of output 173 [2023-11-17 12:39:12,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:39:12,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222825852] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:39:12,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:39:12,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 4] total 18 [2023-11-17 12:39:12,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382205755] [2023-11-17 12:39:12,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:39:12,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-17 12:39:12,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:39:12,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-17 12:39:12,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2023-11-17 12:39:12,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2023-11-17 12:39:12,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 263 transitions, 3119 flow. Second operand has 20 states, 20 states have (on average 5.45) internal successors, (109), 20 states have internal predecessors, (109), 0 states have call successors, (0), 0 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 12:39:12,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:39:12,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2023-11-17 12:39:12,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:39:13,826 INFO L124 PetriNetUnfolderBase]: 2084/3693 cut-off events. [2023-11-17 12:39:13,826 INFO L125 PetriNetUnfolderBase]: For 18261/18261 co-relation queries the response was YES. [2023-11-17 12:39:13,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20458 conditions, 3693 events. 2084/3693 cut-off events. For 18261/18261 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 22574 event pairs, 443 based on Foata normal form. 5/3698 useless extension candidates. Maximal degree in co-relation 20403. Up to 2611 conditions per place. [2023-11-17 12:39:13,875 INFO L140 encePairwiseOnDemand]: 16/22 looper letters, 297 selfloop transitions, 113 changer transitions 2/412 dead transitions. [2023-11-17 12:39:13,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 412 transitions, 5328 flow [2023-11-17 12:39:13,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-17 12:39:13,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-17 12:39:13,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 184 transitions. [2023-11-17 12:39:13,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39826839826839827 [2023-11-17 12:39:13,877 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 184 transitions. [2023-11-17 12:39:13,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 184 transitions. [2023-11-17 12:39:13,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:39:13,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 184 transitions. [2023-11-17 12:39:13,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 8.761904761904763) internal successors, (184), 21 states have internal predecessors, (184), 0 states have call successors, (0), 0 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 12:39:13,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 22.0) internal successors, (484), 22 states have internal predecessors, (484), 0 states have call successors, (0), 0 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 12:39:13,881 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 22.0) internal successors, (484), 22 states have internal predecessors, (484), 0 states have call successors, (0), 0 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 12:39:13,882 INFO L175 Difference]: Start difference. First operand has 123 places, 263 transitions, 3119 flow. Second operand 21 states and 184 transitions. [2023-11-17 12:39:13,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 412 transitions, 5328 flow [2023-11-17 12:39:13,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 412 transitions, 5096 flow, removed 93 selfloop flow, removed 9 redundant places. [2023-11-17 12:39:13,953 INFO L231 Difference]: Finished difference. Result has 142 places, 340 transitions, 4293 flow [2023-11-17 12:39:13,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=2905, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=4293, PETRI_PLACES=142, PETRI_TRANSITIONS=340} [2023-11-17 12:39:13,954 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 121 predicate places. [2023-11-17 12:39:13,954 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 340 transitions, 4293 flow [2023-11-17 12:39:13,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.45) internal successors, (109), 20 states have internal predecessors, (109), 0 states have call successors, (0), 0 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 12:39:13,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:39:13,955 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:39:13,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-17 12:39:14,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-17 12:39:14,161 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:39:14,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:39:14,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1170617243, now seen corresponding path program 8 times [2023-11-17 12:39:14,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:39:14,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343814299] [2023-11-17 12:39:14,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:39:14,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:39:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:39:15,374 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:39:15,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:39:15,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343814299] [2023-11-17 12:39:15,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343814299] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:39:15,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889298915] [2023-11-17 12:39:15,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 12:39:15,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:39:15,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:39:15,377 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:39:15,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-17 12:39:15,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 12:39:15,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:39:15,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-17 12:39:15,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:39:15,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:39:15,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 12:39:15,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:39:15,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2023-11-17 12:39:15,739 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:39:15,739 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:39:16,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:39:16,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 102 treesize of output 230 [2023-11-17 12:39:16,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:39:16,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 136 [2023-11-17 12:39:16,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:39:16,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889298915] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:39:16,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:39:16,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 22 [2023-11-17 12:39:16,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933842074] [2023-11-17 12:39:16,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:39:16,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-17 12:39:16,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:39:16,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-17 12:39:16,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=476, Unknown=4, NotChecked=0, Total=552 [2023-11-17 12:39:16,858 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2023-11-17 12:39:16,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 340 transitions, 4293 flow. Second operand has 24 states, 24 states have (on average 5.041666666666667) internal successors, (121), 24 states have internal predecessors, (121), 0 states have call successors, (0), 0 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 12:39:16,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:39:16,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2023-11-17 12:39:16,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:39:19,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:39:20,729 INFO L124 PetriNetUnfolderBase]: 2601/4613 cut-off events. [2023-11-17 12:39:20,729 INFO L125 PetriNetUnfolderBase]: For 27786/27786 co-relation queries the response was YES. [2023-11-17 12:39:20,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26997 conditions, 4613 events. 2601/4613 cut-off events. For 27786/27786 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 29604 event pairs, 479 based on Foata normal form. 3/4616 useless extension candidates. Maximal degree in co-relation 26933. Up to 3062 conditions per place. [2023-11-17 12:39:20,778 INFO L140 encePairwiseOnDemand]: 15/22 looper letters, 315 selfloop transitions, 197 changer transitions 2/514 dead transitions. [2023-11-17 12:39:20,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 514 transitions, 7139 flow [2023-11-17 12:39:20,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-17 12:39:20,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-11-17 12:39:20,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 219 transitions. [2023-11-17 12:39:20,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43280632411067194 [2023-11-17 12:39:20,781 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 219 transitions. [2023-11-17 12:39:20,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 219 transitions. [2023-11-17 12:39:20,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:39:20,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 219 transitions. [2023-11-17 12:39:20,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 9.521739130434783) internal successors, (219), 23 states have internal predecessors, (219), 0 states have call successors, (0), 0 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 12:39:20,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 22.0) internal successors, (528), 24 states have internal predecessors, (528), 0 states have call successors, (0), 0 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 12:39:20,786 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 22.0) internal successors, (528), 24 states have internal predecessors, (528), 0 states have call successors, (0), 0 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 12:39:20,786 INFO L175 Difference]: Start difference. First operand has 142 places, 340 transitions, 4293 flow. Second operand 23 states and 219 transitions. [2023-11-17 12:39:20,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 514 transitions, 7139 flow [2023-11-17 12:39:20,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 514 transitions, 6807 flow, removed 151 selfloop flow, removed 7 redundant places. [2023-11-17 12:39:20,864 INFO L231 Difference]: Finished difference. Result has 164 places, 425 transitions, 5901 flow [2023-11-17 12:39:20,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=3961, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=5901, PETRI_PLACES=164, PETRI_TRANSITIONS=425} [2023-11-17 12:39:20,865 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 143 predicate places. [2023-11-17 12:39:20,865 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 425 transitions, 5901 flow [2023-11-17 12:39:20,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.041666666666667) internal successors, (121), 24 states have internal predecessors, (121), 0 states have call successors, (0), 0 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 12:39:20,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:39:20,866 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:39:20,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-17 12:39:21,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-17 12:39:21,071 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:39:21,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:39:21,071 INFO L85 PathProgramCache]: Analyzing trace with hash -786796411, now seen corresponding path program 9 times [2023-11-17 12:39:21,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:39:21,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838162048] [2023-11-17 12:39:21,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:39:21,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:39:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:39:22,223 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:39:22,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:39:22,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838162048] [2023-11-17 12:39:22,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838162048] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:39:22,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739549474] [2023-11-17 12:39:22,224 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 12:39:22,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:39:22,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:39:22,229 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:39:22,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-17 12:39:22,371 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-17 12:39:22,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:39:22,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-17 12:39:22,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:39:22,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-17 12:39:22,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:39:22,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:39:22,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 39 [2023-11-17 12:39:22,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:39:22,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 47 [2023-11-17 12:39:22,819 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:39:22,819 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:39:23,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:39:23,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 363 treesize of output 207 [2023-11-17 12:39:23,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:39:23,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 702 treesize of output 678 [2023-11-17 12:39:23,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:39:23,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 294 treesize of output 258 [2023-11-17 12:39:23,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:39:23,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 183 treesize of output 265 [2023-11-17 12:39:28,658 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-11-17 12:39:29,000 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:39:29,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739549474] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:39:29,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:39:29,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2023-11-17 12:39:29,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187354105] [2023-11-17 12:39:29,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:39:29,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-17 12:39:29,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:39:29,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-17 12:39:29,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=597, Unknown=3, NotChecked=0, Total=702 [2023-11-17 12:39:29,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2023-11-17 12:39:29,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 425 transitions, 5901 flow. Second operand has 27 states, 27 states have (on average 4.851851851851852) internal successors, (131), 27 states have internal predecessors, (131), 0 states have call successors, (0), 0 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 12:39:29,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:39:29,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2023-11-17 12:39:29,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:39:31,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:39:34,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:39:35,879 INFO L124 PetriNetUnfolderBase]: 3046/5414 cut-off events. [2023-11-17 12:39:35,879 INFO L125 PetriNetUnfolderBase]: For 39359/39359 co-relation queries the response was YES. [2023-11-17 12:39:35,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33089 conditions, 5414 events. 3046/5414 cut-off events. For 39359/39359 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 35718 event pairs, 693 based on Foata normal form. 4/5418 useless extension candidates. Maximal degree in co-relation 32908. Up to 4021 conditions per place. [2023-11-17 12:39:35,934 INFO L140 encePairwiseOnDemand]: 15/22 looper letters, 399 selfloop transitions, 183 changer transitions 2/584 dead transitions. [2023-11-17 12:39:35,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 584 transitions, 8793 flow [2023-11-17 12:39:35,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-17 12:39:35,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-11-17 12:39:35,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 209 transitions. [2023-11-17 12:39:35,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318181818181818 [2023-11-17 12:39:35,936 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 209 transitions. [2023-11-17 12:39:35,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 209 transitions. [2023-11-17 12:39:35,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:39:35,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 209 transitions. [2023-11-17 12:39:35,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 9.5) internal successors, (209), 22 states have internal predecessors, (209), 0 states have call successors, (0), 0 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 12:39:35,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 22.0) internal successors, (506), 23 states have internal predecessors, (506), 0 states have call successors, (0), 0 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 12:39:35,938 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 22.0) internal successors, (506), 23 states have internal predecessors, (506), 0 states have call successors, (0), 0 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 12:39:35,938 INFO L175 Difference]: Start difference. First operand has 164 places, 425 transitions, 5901 flow. Second operand 22 states and 209 transitions. [2023-11-17 12:39:35,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 584 transitions, 8793 flow [2023-11-17 12:39:36,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 584 transitions, 8433 flow, removed 165 selfloop flow, removed 6 redundant places. [2023-11-17 12:39:36,130 INFO L231 Difference]: Finished difference. Result has 188 places, 501 transitions, 7412 flow [2023-11-17 12:39:36,130 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=5576, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=7412, PETRI_PLACES=188, PETRI_TRANSITIONS=501} [2023-11-17 12:39:36,131 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 167 predicate places. [2023-11-17 12:39:36,131 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 501 transitions, 7412 flow [2023-11-17 12:39:36,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.851851851851852) internal successors, (131), 27 states have internal predecessors, (131), 0 states have call successors, (0), 0 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 12:39:36,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:39:36,131 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:39:36,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-17 12:39:36,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-17 12:39:36,337 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:39:36,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:39:36,337 INFO L85 PathProgramCache]: Analyzing trace with hash 65361053, now seen corresponding path program 10 times [2023-11-17 12:39:36,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:39:36,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158628034] [2023-11-17 12:39:36,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:39:36,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:39:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:39:37,619 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:39:37,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:39:37,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158628034] [2023-11-17 12:39:37,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158628034] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:39:37,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204176167] [2023-11-17 12:39:37,620 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 12:39:37,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:39:37,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:39:37,621 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:39:37,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-17 12:39:37,718 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 12:39:37,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:39:37,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-17 12:39:37,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:39:37,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2023-11-17 12:39:37,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2023-11-17 12:39:37,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:39:37,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2023-11-17 12:39:38,007 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:39:38,007 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:39:38,075 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_412 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_412) c_~f~0.base))) (= (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset)) 4))) 4))) (select .cse0 (+ (* c_~x1~0 4) c_~f~0.offset))))) is different from false [2023-11-17 12:39:38,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:39:38,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 104 treesize of output 224 [2023-11-17 12:39:38,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:39:38,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 88 [2023-11-17 12:39:38,819 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:39:38,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204176167] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:39:38,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:39:38,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 22 [2023-11-17 12:39:38,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614211508] [2023-11-17 12:39:38,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:39:38,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-17 12:39:38,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:39:38,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-17 12:39:38,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=432, Unknown=1, NotChecked=42, Total=552 [2023-11-17 12:39:38,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2023-11-17 12:39:38,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 501 transitions, 7412 flow. Second operand has 24 states, 24 states have (on average 4.958333333333333) internal successors, (119), 24 states have internal predecessors, (119), 0 states have call successors, (0), 0 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 12:39:38,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:39:38,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2023-11-17 12:39:38,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:39:39,489 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~f~0.base) (+ (* c_~x1~0 4) c_~f~0.offset)))) (and (= c_~x2~0 .cse0) (forall ((v_ArrVal_412 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_412) c_~f~0.base))) (= (select .cse1 (+ c_~f~0.offset (* (select .cse1 (+ c_~f~0.offset (* (select .cse1 (+ (* c_~x2~0 4) c_~f~0.offset)) 4))) 4))) (select .cse1 (+ c_~f~0.offset (* .cse0 4)))))))) is different from false [2023-11-17 12:39:43,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:39:45,113 INFO L124 PetriNetUnfolderBase]: 3628/6417 cut-off events. [2023-11-17 12:39:45,114 INFO L125 PetriNetUnfolderBase]: For 52273/52273 co-relation queries the response was YES. [2023-11-17 12:39:45,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40526 conditions, 6417 events. 3628/6417 cut-off events. For 52273/52273 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 43686 event pairs, 619 based on Foata normal form. 6/6423 useless extension candidates. Maximal degree in co-relation 40320. Up to 4464 conditions per place. [2023-11-17 12:39:45,183 INFO L140 encePairwiseOnDemand]: 11/22 looper letters, 408 selfloop transitions, 287 changer transitions 2/697 dead transitions. [2023-11-17 12:39:45,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 697 transitions, 11276 flow [2023-11-17 12:39:45,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-17 12:39:45,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-17 12:39:45,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 183 transitions. [2023-11-17 12:39:45,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4159090909090909 [2023-11-17 12:39:45,185 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 183 transitions. [2023-11-17 12:39:45,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 183 transitions. [2023-11-17 12:39:45,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:39:45,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 183 transitions. [2023-11-17 12:39:45,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 9.15) internal successors, (183), 20 states have internal predecessors, (183), 0 states have call successors, (0), 0 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 12:39:45,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 22.0) internal successors, (462), 21 states have internal predecessors, (462), 0 states have call successors, (0), 0 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 12:39:45,187 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 22.0) internal successors, (462), 21 states have internal predecessors, (462), 0 states have call successors, (0), 0 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 12:39:45,187 INFO L175 Difference]: Start difference. First operand has 188 places, 501 transitions, 7412 flow. Second operand 20 states and 183 transitions. [2023-11-17 12:39:45,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 697 transitions, 11276 flow [2023-11-17 12:39:45,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 697 transitions, 10953 flow, removed 138 selfloop flow, removed 9 redundant places. [2023-11-17 12:39:45,471 INFO L231 Difference]: Finished difference. Result has 204 places, 633 transitions, 10239 flow [2023-11-17 12:39:45,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=7115, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=164, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=10239, PETRI_PLACES=204, PETRI_TRANSITIONS=633} [2023-11-17 12:39:45,471 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 183 predicate places. [2023-11-17 12:39:45,472 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 633 transitions, 10239 flow [2023-11-17 12:39:45,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.958333333333333) internal successors, (119), 24 states have internal predecessors, (119), 0 states have call successors, (0), 0 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 12:39:45,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:39:45,472 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:39:45,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-17 12:39:45,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:39:45,672 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:39:45,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:39:45,673 INFO L85 PathProgramCache]: Analyzing trace with hash -793940571, now seen corresponding path program 11 times [2023-11-17 12:39:45,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:39:45,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322558133] [2023-11-17 12:39:45,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:39:45,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:39:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:39:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:39:46,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:39:46,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322558133] [2023-11-17 12:39:46,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322558133] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:39:46,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904350337] [2023-11-17 12:39:46,656 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 12:39:46,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:39:46,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:39:46,661 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:39:46,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-17 12:39:46,777 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-11-17 12:39:46,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:39:46,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-17 12:39:46,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:39:46,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:39:46,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 12:39:47,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:39:47,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2023-11-17 12:39:47,083 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:39:47,083 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:39:47,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:39:47,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 102 treesize of output 230 [2023-11-17 12:39:47,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:39:47,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 37 treesize of output 136 [2023-11-17 12:39:48,413 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:39:48,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904350337] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:39:48,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:39:48,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 22 [2023-11-17 12:39:48,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34298649] [2023-11-17 12:39:48,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:39:48,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-17 12:39:48,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:39:48,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-17 12:39:48,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=487, Unknown=1, NotChecked=0, Total=552 [2023-11-17 12:39:48,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2023-11-17 12:39:48,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 633 transitions, 10239 flow. Second operand has 24 states, 24 states have (on average 4.958333333333333) internal successors, (119), 24 states have internal predecessors, (119), 0 states have call successors, (0), 0 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 12:39:48,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:39:48,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2023-11-17 12:39:48,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:39:51,262 INFO L124 PetriNetUnfolderBase]: 3894/6891 cut-off events. [2023-11-17 12:39:51,262 INFO L125 PetriNetUnfolderBase]: For 70982/70982 co-relation queries the response was YES. [2023-11-17 12:39:51,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51916 conditions, 6891 events. 3894/6891 cut-off events. For 70982/70982 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 47545 event pairs, 775 based on Foata normal form. 4/6895 useless extension candidates. Maximal degree in co-relation 50692. Up to 5524 conditions per place. [2023-11-17 12:39:51,351 INFO L140 encePairwiseOnDemand]: 16/22 looper letters, 566 selfloop transitions, 188 changer transitions 2/756 dead transitions. [2023-11-17 12:39:51,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 756 transitions, 13411 flow [2023-11-17 12:39:51,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-17 12:39:51,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-17 12:39:51,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 187 transitions. [2023-11-17 12:39:51,353 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2023-11-17 12:39:51,353 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 187 transitions. [2023-11-17 12:39:51,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 187 transitions. [2023-11-17 12:39:51,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:39:51,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 187 transitions. [2023-11-17 12:39:51,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 8.904761904761905) internal successors, (187), 21 states have internal predecessors, (187), 0 states have call successors, (0), 0 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 12:39:51,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 22.0) internal successors, (484), 22 states have internal predecessors, (484), 0 states have call successors, (0), 0 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 12:39:51,355 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 22.0) internal successors, (484), 22 states have internal predecessors, (484), 0 states have call successors, (0), 0 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 12:39:51,355 INFO L175 Difference]: Start difference. First operand has 204 places, 633 transitions, 10239 flow. Second operand 21 states and 187 transitions. [2023-11-17 12:39:51,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 756 transitions, 13411 flow [2023-11-17 12:39:51,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 756 transitions, 12878 flow, removed 190 selfloop flow, removed 10 redundant places. [2023-11-17 12:39:51,758 INFO L231 Difference]: Finished difference. Result has 223 places, 681 transitions, 11369 flow [2023-11-17 12:39:51,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=9736, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=147, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=11369, PETRI_PLACES=223, PETRI_TRANSITIONS=681} [2023-11-17 12:39:51,759 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 202 predicate places. [2023-11-17 12:39:51,759 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 681 transitions, 11369 flow [2023-11-17 12:39:51,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.958333333333333) internal successors, (119), 24 states have internal predecessors, (119), 0 states have call successors, (0), 0 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 12:39:51,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:39:51,759 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:39:51,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-17 12:39:51,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2023-11-17 12:39:51,960 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:39:51,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:39:51,960 INFO L85 PathProgramCache]: Analyzing trace with hash -2091104248, now seen corresponding path program 12 times [2023-11-17 12:39:51,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:39:51,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138980011] [2023-11-17 12:39:51,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:39:51,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:39:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:39:54,406 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:39:54,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:39:54,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138980011] [2023-11-17 12:39:54,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138980011] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:39:54,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043906998] [2023-11-17 12:39:54,407 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 12:39:54,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:39:54,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:39:54,408 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:39:54,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-17 12:39:54,520 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-17 12:39:54,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:39:54,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-17 12:39:54,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:39:54,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:39:54,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2023-11-17 12:39:54,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:39:54,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2023-11-17 12:39:54,848 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:39:54,848 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:39:56,975 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_474 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_474) c_~f~0.base))) (= (select .cse0 (+ c_~f~0.offset (* (select (select |c_#memory_int| c_~f~0.base) (+ (* c_~x1~0 4) c_~f~0.offset)) 4))) (select .cse0 (+ (* (select .cse0 (+ c_~f~0.offset (* (select .cse0 (+ (* c_~x2~0 4) c_~f~0.offset)) 4))) 4) c_~f~0.offset))))) is different from false [2023-11-17 12:39:57,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:39:57,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 10 new quantified variables, introduced 15 case distinctions, treesize of input 104 treesize of output 224 [2023-11-17 12:39:57,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:39:57,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 88 [2023-11-17 12:39:57,792 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 3 not checked. [2023-11-17 12:39:57,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043906998] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:39:57,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:39:57,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 24 [2023-11-17 12:39:57,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049792425] [2023-11-17 12:39:57,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:39:57,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-17 12:39:57,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:39:57,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-17 12:39:57,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=521, Unknown=3, NotChecked=46, Total=650 [2023-11-17 12:39:57,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2023-11-17 12:39:57,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 681 transitions, 11369 flow. Second operand has 26 states, 26 states have (on average 4.961538461538462) internal successors, (129), 26 states have internal predecessors, (129), 0 states have call successors, (0), 0 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 12:39:57,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:39:57,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2023-11-17 12:39:57,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:40:01,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:40:02,592 INFO L124 PetriNetUnfolderBase]: 4148/7361 cut-off events. [2023-11-17 12:40:02,593 INFO L125 PetriNetUnfolderBase]: For 80509/80509 co-relation queries the response was YES. [2023-11-17 12:40:02,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56106 conditions, 7361 events. 4148/7361 cut-off events. For 80509/80509 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 51759 event pairs, 915 based on Foata normal form. 2/7363 useless extension candidates. Maximal degree in co-relation 54882. Up to 6377 conditions per place. [2023-11-17 12:40:02,672 INFO L140 encePairwiseOnDemand]: 13/22 looper letters, 630 selfloop transitions, 177 changer transitions 2/809 dead transitions. [2023-11-17 12:40:02,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 809 transitions, 14870 flow [2023-11-17 12:40:02,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-17 12:40:02,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-17 12:40:02,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 163 transitions. [2023-11-17 12:40:02,683 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38995215311004783 [2023-11-17 12:40:02,683 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 163 transitions. [2023-11-17 12:40:02,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 163 transitions. [2023-11-17 12:40:02,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:40:02,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 163 transitions. [2023-11-17 12:40:02,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 8.578947368421053) internal successors, (163), 19 states have internal predecessors, (163), 0 states have call successors, (0), 0 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 12:40:02,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 22.0) internal successors, (440), 20 states have internal predecessors, (440), 0 states have call successors, (0), 0 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 12:40:02,696 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 22.0) internal successors, (440), 20 states have internal predecessors, (440), 0 states have call successors, (0), 0 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 12:40:02,696 INFO L175 Difference]: Start difference. First operand has 223 places, 681 transitions, 11369 flow. Second operand 19 states and 163 transitions. [2023-11-17 12:40:02,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 809 transitions, 14870 flow [2023-11-17 12:40:03,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 809 transitions, 14549 flow, removed 125 selfloop flow, removed 8 redundant places. [2023-11-17 12:40:03,100 INFO L231 Difference]: Finished difference. Result has 239 places, 757 transitions, 13111 flow [2023-11-17 12:40:03,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=11067, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=13111, PETRI_PLACES=239, PETRI_TRANSITIONS=757} [2023-11-17 12:40:03,101 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 218 predicate places. [2023-11-17 12:40:03,101 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 757 transitions, 13111 flow [2023-11-17 12:40:03,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.961538461538462) internal successors, (129), 26 states have internal predecessors, (129), 0 states have call successors, (0), 0 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 12:40:03,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:40:03,101 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:40:03,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-17 12:40:03,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:40:03,302 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:40:03,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:40:03,302 INFO L85 PathProgramCache]: Analyzing trace with hash 106107781, now seen corresponding path program 13 times [2023-11-17 12:40:03,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:40:03,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466405830] [2023-11-17 12:40:03,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:40:03,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:40:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:40:03,495 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:40:03,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:40:03,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466405830] [2023-11-17 12:40:03,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466405830] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:40:03,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581053118] [2023-11-17 12:40:03,496 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 12:40:03,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:40:03,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:40:03,501 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:40:03,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-17 12:40:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:40:03,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-17 12:40:03,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:40:03,696 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:40:03,696 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:40:40,963 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:40:40,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581053118] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:40:40,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:40:40,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2023-11-17 12:40:40,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101001259] [2023-11-17 12:40:40,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:40:40,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-17 12:40:40,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:40:40,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-17 12:40:40,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=177, Unknown=14, NotChecked=0, Total=240 [2023-11-17 12:40:40,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2023-11-17 12:40:40,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 757 transitions, 13111 flow. Second operand has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 0 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 12:40:40,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:40:40,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2023-11-17 12:40:40,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:40:43,910 INFO L124 PetriNetUnfolderBase]: 4209/7727 cut-off events. [2023-11-17 12:40:43,910 INFO L125 PetriNetUnfolderBase]: For 105784/105784 co-relation queries the response was YES. [2023-11-17 12:40:43,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61114 conditions, 7727 events. 4209/7727 cut-off events. For 105784/105784 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 58331 event pairs, 424 based on Foata normal form. 132/7859 useless extension candidates. Maximal degree in co-relation 59742. Up to 4047 conditions per place. [2023-11-17 12:40:43,989 INFO L140 encePairwiseOnDemand]: 16/22 looper letters, 896 selfloop transitions, 376 changer transitions 38/1310 dead transitions. [2023-11-17 12:40:43,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 1310 transitions, 24704 flow [2023-11-17 12:40:43,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-17 12:40:43,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-17 12:40:43,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 140 transitions. [2023-11-17 12:40:43,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2023-11-17 12:40:43,990 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 140 transitions. [2023-11-17 12:40:43,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 140 transitions. [2023-11-17 12:40:43,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:40:43,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 140 transitions. [2023-11-17 12:40:43,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 8.75) internal successors, (140), 16 states have internal predecessors, (140), 0 states have call successors, (0), 0 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 12:40:43,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 22.0) internal successors, (374), 17 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 12:40:43,992 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 22.0) internal successors, (374), 17 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 12:40:43,992 INFO L175 Difference]: Start difference. First operand has 239 places, 757 transitions, 13111 flow. Second operand 16 states and 140 transitions. [2023-11-17 12:40:43,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 1310 transitions, 24704 flow [2023-11-17 12:40:44,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 1310 transitions, 24084 flow, removed 297 selfloop flow, removed 6 redundant places. [2023-11-17 12:40:44,491 INFO L231 Difference]: Finished difference. Result has 252 places, 934 transitions, 16892 flow [2023-11-17 12:40:44,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=12698, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=757, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=201, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=509, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=16892, PETRI_PLACES=252, PETRI_TRANSITIONS=934} [2023-11-17 12:40:44,492 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 231 predicate places. [2023-11-17 12:40:44,492 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 934 transitions, 16892 flow [2023-11-17 12:40:44,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 16 states have internal predecessors, (82), 0 states have call successors, (0), 0 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 12:40:44,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:40:44,492 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:40:44,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-17 12:40:44,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:40:44,699 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 12:40:44,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:40:44,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1083768373, now seen corresponding path program 14 times [2023-11-17 12:40:44,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:40:44,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234395599] [2023-11-17 12:40:44,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:40:44,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:40:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:40:44,894 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:40:44,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:40:44,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234395599] [2023-11-17 12:40:44,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234395599] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:40:44,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002846573] [2023-11-17 12:40:44,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 12:40:44,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:40:44,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:40:44,896 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:40:44,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-17 12:40:45,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 12:40:45,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:40:45,021 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-17 12:40:45,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:40:45,132 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:40:45,132 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:40:57,312 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:40:57,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002846573] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:40:57,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:40:57,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2023-11-17 12:40:57,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462251070] [2023-11-17 12:40:57,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:40:57,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-17 12:40:57,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:40:57,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-17 12:40:57,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=269, Unknown=4, NotChecked=0, Total=342 [2023-11-17 12:40:57,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 22 [2023-11-17 12:40:57,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 934 transitions, 16892 flow. Second operand has 19 states, 19 states have (on average 4.7894736842105265) internal successors, (91), 19 states have internal predecessors, (91), 0 states have call successors, (0), 0 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 12:40:57,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:40:57,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 22 [2023-11-17 12:40:57,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:41:15,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:41:17,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:41:19,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:41:21,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:41:23,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:41:25,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:41:27,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:41:30,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:41:32,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:41:34,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:41:36,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:41:38,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:41:40,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:41:42,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:41:44,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:41:46,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:41:48,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:41:50,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:41:52,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:41:54,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:41:57,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:41:59,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:42:01,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:42:03,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:42:05,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:42:07,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:42:09,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:42:11,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:42:13,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:42:15,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:42:17,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:42:19,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:42:21,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:42:23,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:42:25,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:42:27,307 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 [1] [2023-11-17 12:42:29,316 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 [1] [2023-11-17 12:42:31,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:42:33,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:42:35,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:42:37,459 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 [1] [2023-11-17 12:42:39,469 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 [1] [2023-11-17 12:42:41,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:42:43,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:42:45,545 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* (div |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296))) (and (let ((.cse1 (* 3 c_~n~0))) (< (+ .cse0 .cse1) (+ (* (div .cse1 4294967296) 4294967296) |c_thread2Thread1of1ForFork1_~i~1#1| 1))) (<= 0 (div (+ (* (- 1) |c_thread1Thread1of1ForFork0_~i~0#1|) 1) 4294967296)) (<= 1 |c_thread1Thread1of1ForFork0_~i~0#1|) (<= 0 (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (<= (+ .cse0 |c_thread1Thread1of1ForFork0_~i~0#1|) |c_thread2Thread1of1ForFork1_~i~1#1|) (forall ((v_z_11 Int)) (or (< v_z_11 0) (< (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) v_z_11) (let ((.cse2 (* 8589934593 v_z_11))) (< (+ (* 4294967296 (div (+ |c_thread2Thread1of1ForFork1_~i~1#1| 3) 4294967296)) .cse2) (+ |c_thread2Thread1of1ForFork1_~i~1#1| (* (div .cse2 4294967296) 4294967296) 4))))))) is different from false [2023-11-17 12:42:51,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:42:53,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:42:56,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:42:58,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:43:00,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:43:02,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:43:04,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:43:06,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:43:09,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:43:11,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:43:13,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:43:15,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:43:17,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:43:19,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:43:22,556 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 [1] [2023-11-17 12:43:23,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:43:25,707 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 [1] [2023-11-17 12:43:27,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:43:30,477 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 [1] [2023-11-17 12:43:32,485 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 [1] [2023-11-17 12:43:42,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:43:44,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:43:46,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:43:48,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:43:50,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:43:52,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:43:54,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:43:56,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:43:58,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:44:00,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:44:02,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:44:04,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:44:06,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:44:08,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:44:10,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:44:33,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 [1] [2023-11-17 12:44:35,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:44:37,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:44:39,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:44:41,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:44:43,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:44:45,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:44:47,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:44:50,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:44:52,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:44:54,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:44:56,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:44:58,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:45:00,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:45:02,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:45:04,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:45:06,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:45:08,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:45:10,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:45:12,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:45:14,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:45:23,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:45:25,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:45:27,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:45:29,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:45:31,166 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 [1] [2023-11-17 12:45:33,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:45:35,352 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 (* 3 c_~n~0))) (< (+ (* (div |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296) 4294967296) .cse0) (+ (* (div .cse0 4294967296) 4294967296) |c_thread2Thread1of1ForFork1_~i~1#1| 1))) (forall ((v_z_11 Int)) (or (< v_z_11 0) (< (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) v_z_11) (let ((.cse1 (* 8589934593 v_z_11))) (< (+ (* 4294967296 (div (+ |c_thread2Thread1of1ForFork1_~i~1#1| 3) 4294967296)) .cse1) (+ |c_thread2Thread1of1ForFork1_~i~1#1| (* (div .cse1 4294967296) 4294967296) 4)))))) is different from false [2023-11-17 12:45:37,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:45:41,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:45:43,533 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 [1] [2023-11-17 12:45:45,542 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 [1] [2023-11-17 12:46:38,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:46:40,239 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 [1] [2023-11-17 12:46:41,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:46:51,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:46:53,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:46:55,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:46:57,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:46:59,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:47:01,688 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 [1] [2023-11-17 12:47:03,699 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 [1] [2023-11-17 12:47:05,707 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 [1] [2023-11-17 12:47:07,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:47:09,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:47:11,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:47:13,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:47:15,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:47:17,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:47:19,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:47:21,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:47:23,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:47:25,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:47:27,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:47:29,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:47:31,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:47:33,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:47:35,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:47:38,149 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 [1] [2023-11-17 12:47:40,162 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 [1] [2023-11-17 12:47:42,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-11-17 12:47:43,390 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 12:47:43,390 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 12:47:44,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-17 12:47:44,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:47:44,596 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 12:47:44,606 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-11-17 12:47:44,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-17 12:47:44,606 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-11-17 12:47:44,608 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-11-17 12:47:44,608 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-11-17 12:47:44,608 INFO L445 BasicCegarLoop]: Path program histogram: [14, 4, 3, 1, 1] [2023-11-17 12:47:44,613 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 12:47:44,613 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 12:47:44,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 12:47:44 BasicIcfg [2023-11-17 12:47:44,615 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 12:47:44,616 INFO L158 Benchmark]: Toolchain (without parser) took 547938.40ms. Allocated memory was 281.0MB in the beginning and 1.2GB in the end (delta: 937.4MB). Free memory was 232.7MB in the beginning and 628.4MB in the end (delta: -395.7MB). Peak memory consumption was 832.2MB. Max. memory is 8.0GB. [2023-11-17 12:47:44,616 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 150.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 12:47:44,616 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.71ms. Allocated memory is still 281.0MB. Free memory was 232.4MB in the beginning and 220.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-11-17 12:47:44,618 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.99ms. Allocated memory is still 281.0MB. Free memory was 220.9MB in the beginning and 218.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 12:47:44,618 INFO L158 Benchmark]: Boogie Preprocessor took 37.99ms. Allocated memory is still 281.0MB. Free memory was 218.8MB in the beginning and 217.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 12:47:44,618 INFO L158 Benchmark]: RCFGBuilder took 750.44ms. Allocated memory is still 281.0MB. Free memory was 217.1MB in the beginning and 233.2MB in the end (delta: -16.2MB). Peak memory consumption was 34.1MB. Max. memory is 8.0GB. [2023-11-17 12:47:44,622 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 12:47:44,623 INFO L158 Benchmark]: TraceAbstraction took 546782.45ms. Allocated memory was 281.0MB in the beginning and 1.2GB in the end (delta: 937.4MB). Free memory was 232.2MB in the beginning and 628.4MB in the end (delta: -396.2MB). Peak memory consumption was 830.6MB. Max. memory is 8.0GB. [2023-11-17 12:47:44,624 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 150.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 308.71ms. Allocated memory is still 281.0MB. Free memory was 232.4MB in the beginning and 220.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 49.99ms. Allocated memory is still 281.0MB. Free memory was 220.9MB in the beginning and 218.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.99ms. Allocated memory is still 281.0MB. Free memory was 218.8MB in the beginning and 217.4MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 750.44ms. Allocated memory is still 281.0MB. Free memory was 217.1MB in the beginning and 233.2MB in the end (delta: -16.2MB). Peak memory consumption was 34.1MB. Max. memory is 8.0GB. * TraceAbstraction took 546782.45ms. Allocated memory was 281.0MB in the beginning and 1.2GB in the end (delta: 937.4MB). Free memory was 232.2MB in the beginning and 628.4MB in the end (delta: -396.2MB). Peak memory consumption was 830.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 22 PlacesBefore, 21 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 1 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 54 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 52, independent: 50, independent conditional: 0, independent unconditional: 50, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 25, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 52, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 25, unknown conditional: 0, unknown unconditional: 25] , Statistics on independence cache: Total cache size (in pairs): 25, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 27 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: 546.7s, OverallIterations: 23, TraceHistogramMax: 3, PathProgramHistogramMax: 14, EmptinessCheckTime: 0.0s, AutomataDifference: 457.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 276 mSolverCounterUnknown, 1579 SdHoareTripleChecker+Valid, 308.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1579 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 305.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 643 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 212 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10214 IncrementalHoareTripleChecker+Invalid, 11345 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 212 mSolverCounterUnsat, 0 mSDtfsCounter, 10214 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 939 GetRequests, 470 SyntacticMatches, 16 SemanticMatches, 453 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2470 ImplicationChecksByTransitivity, 191.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16892occurred in iteration=22, InterpolantAutomatonStates: 301, 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.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 83.4s InterpolantComputationTime, 725 NumberOfCodeBlocks, 725 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 978 ConstructedInterpolants, 31 QuantifiedInterpolants, 16965 SizeOfPredicates, 112 NumberOfNonLiveVariables, 3007 ConjunctsInSsa, 353 ConjunctsInUnsatCore, 55 InterpolantComputations, 8 PerfectInterpolantSequences, 101/413 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