/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 23:08:35,117 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 23:08:35,163 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 23:08:35,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 23:08:35,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 23:08:35,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 23:08:35,211 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 23:08:35,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 23:08:35,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 23:08:35,211 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 23:08:35,212 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 23:08:35,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 23:08:35,212 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 23:08:35,213 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 23:08:35,213 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 23:08:35,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 23:08:35,213 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 23:08:35,213 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 23:08:35,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 23:08:35,214 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 23:08:35,214 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 23:08:35,218 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 23:08:35,218 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 23:08:35,219 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 23:08:35,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 23:08:35,221 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 23:08:35,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 23:08:35,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 23:08:35,222 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 23:08:35,222 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 23:08:35,223 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 23:08:35,223 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 23:08:35,223 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 23:08:35,223 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 23:08:35,223 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 23:08:35,223 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-26 23:08:35,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 23:08:35,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 23:08:35,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 23:08:35,533 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 23:08:35,533 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 23:08:35,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2023-08-26 23:08:36,653 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 23:08:36,834 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 23:08:36,835 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2023-08-26 23:08:36,841 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/190efbbf3/aa9d185238da4096b0492476dfc20958/FLAG5cd6594af [2023-08-26 23:08:36,852 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/190efbbf3/aa9d185238da4096b0492476dfc20958 [2023-08-26 23:08:36,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 23:08:36,857 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 23:08:36,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 23:08:36,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 23:08:36,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 23:08:36,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 11:08:36" (1/1) ... [2023-08-26 23:08:36,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f2a6ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:08:36, skipping insertion in model container [2023-08-26 23:08:36,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 11:08:36" (1/1) ... [2023-08-26 23:08:36,877 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 23:08:36,999 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 23:08:37,009 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 23:08:37,022 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 23:08:37,032 INFO L206 MainTranslator]: Completed translation [2023-08-26 23:08:37,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:08:37 WrapperNode [2023-08-26 23:08:37,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 23:08:37,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 23:08:37,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 23:08:37,034 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 23:08:37,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:08:37" (1/1) ... [2023-08-26 23:08:37,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:08:37" (1/1) ... [2023-08-26 23:08:37,056 INFO L138 Inliner]: procedures = 20, calls = 33, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 98 [2023-08-26 23:08:37,056 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 23:08:37,057 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 23:08:37,057 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 23:08:37,057 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 23:08:37,063 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:08:37" (1/1) ... [2023-08-26 23:08:37,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:08:37" (1/1) ... [2023-08-26 23:08:37,067 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:08:37" (1/1) ... [2023-08-26 23:08:37,067 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:08:37" (1/1) ... [2023-08-26 23:08:37,074 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:08:37" (1/1) ... [2023-08-26 23:08:37,077 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:08:37" (1/1) ... [2023-08-26 23:08:37,078 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:08:37" (1/1) ... [2023-08-26 23:08:37,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:08:37" (1/1) ... [2023-08-26 23:08:37,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 23:08:37,080 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 23:08:37,081 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 23:08:37,081 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 23:08:37,081 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:08:37" (1/1) ... [2023-08-26 23:08:37,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 23:08:37,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:08:37,113 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 23:08:37,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 23:08:37,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 23:08:37,154 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-26 23:08:37,154 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-26 23:08:37,154 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-26 23:08:37,154 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-26 23:08:37,155 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-26 23:08:37,155 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-26 23:08:37,155 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-26 23:08:37,155 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-26 23:08:37,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 23:08:37,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 23:08:37,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 23:08:37,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 23:08:37,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 23:08:37,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 23:08:37,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 23:08:37,157 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 23:08:37,223 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 23:08:37,224 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 23:08:37,440 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 23:08:37,445 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 23:08:37,446 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-26 23:08:37,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 11:08:37 BoogieIcfgContainer [2023-08-26 23:08:37,447 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 23:08:37,449 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 23:08:37,449 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 23:08:37,455 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 23:08:37,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 11:08:36" (1/3) ... [2023-08-26 23:08:37,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3918cb34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 11:08:37, skipping insertion in model container [2023-08-26 23:08:37,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:08:37" (2/3) ... [2023-08-26 23:08:37,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3918cb34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 11:08:37, skipping insertion in model container [2023-08-26 23:08:37,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 11:08:37" (3/3) ... [2023-08-26 23:08:37,457 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2023-08-26 23:08:37,469 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 23:08:37,470 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-26 23:08:37,470 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 23:08:37,522 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-26 23:08:37,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 124 transitions, 280 flow [2023-08-26 23:08:37,593 INFO L124 PetriNetUnfolderBase]: 10/120 cut-off events. [2023-08-26 23:08:37,593 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 23:08:37,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 120 events. 10/120 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-08-26 23:08:37,597 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 124 transitions, 280 flow [2023-08-26 23:08:37,600 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 107 transitions, 238 flow [2023-08-26 23:08:37,602 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 23:08:37,608 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 107 transitions, 238 flow [2023-08-26 23:08:37,609 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 107 transitions, 238 flow [2023-08-26 23:08:37,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 107 transitions, 238 flow [2023-08-26 23:08:37,648 INFO L124 PetriNetUnfolderBase]: 10/107 cut-off events. [2023-08-26 23:08:37,649 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 23:08:37,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 107 events. 10/107 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-08-26 23:08:37,650 INFO L119 LiptonReduction]: Number of co-enabled transitions 1224 [2023-08-26 23:08:40,116 INFO L134 LiptonReduction]: Checked pairs total: 1432 [2023-08-26 23:08:40,116 INFO L136 LiptonReduction]: Total number of compositions: 93 [2023-08-26 23:08:40,127 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 23:08:40,131 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@36351d0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 23:08:40,131 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-26 23:08:40,141 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 23:08:40,141 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2023-08-26 23:08:40,141 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 23:08:40,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:08:40,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:08:40,143 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-26 23:08:40,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:08:40,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1796374311, now seen corresponding path program 1 times [2023-08-26 23:08:40,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:08:40,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210023357] [2023-08-26 23:08:40,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:08:40,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:08:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:08:40,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:08:40,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:08:40,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210023357] [2023-08-26 23:08:40,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210023357] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 23:08:40,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 23:08:40,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 23:08:40,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347446071] [2023-08-26 23:08:40,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 23:08:40,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 23:08:40,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:08:40,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 23:08:40,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 23:08:40,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 217 [2023-08-26 23:08:40,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:40,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:08:40,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 217 [2023-08-26 23:08:40,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:08:40,919 INFO L124 PetriNetUnfolderBase]: 497/677 cut-off events. [2023-08-26 23:08:40,919 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2023-08-26 23:08:40,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 677 events. 497/677 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1771 event pairs, 117 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 1016. Up to 471 conditions per place. [2023-08-26 23:08:40,927 INFO L140 encePairwiseOnDemand]: 211/217 looper letters, 41 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2023-08-26 23:08:40,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 233 flow [2023-08-26 23:08:40,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 23:08:40,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 23:08:40,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2023-08-26 23:08:40,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47465437788018433 [2023-08-26 23:08:40,943 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 309 transitions. [2023-08-26 23:08:40,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 309 transitions. [2023-08-26 23:08:40,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:08:40,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 309 transitions. [2023-08-26 23:08:40,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:40,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:40,956 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:40,957 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 74 flow. Second operand 3 states and 309 transitions. [2023-08-26 23:08:40,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 233 flow [2023-08-26 23:08:40,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 47 transitions, 203 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-26 23:08:40,963 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 91 flow [2023-08-26 23:08:40,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=29, PETRI_TRANSITIONS=29} [2023-08-26 23:08:40,967 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2023-08-26 23:08:40,967 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 91 flow [2023-08-26 23:08:40,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:40,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:08:40,968 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:08:40,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 23:08:40,968 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-26 23:08:40,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:08:40,970 INFO L85 PathProgramCache]: Analyzing trace with hash -2088456596, now seen corresponding path program 1 times [2023-08-26 23:08:40,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:08:40,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784514117] [2023-08-26 23:08:40,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:08:40,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:08:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:08:41,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:08:41,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:08:41,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784514117] [2023-08-26 23:08:41,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784514117] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 23:08:41,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 23:08:41,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 23:08:41,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391518626] [2023-08-26 23:08:41,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 23:08:41,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 23:08:41,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:08:41,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 23:08:41,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 23:08:41,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 217 [2023-08-26 23:08:41,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 29 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:41,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:08:41,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 217 [2023-08-26 23:08:41,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:08:41,324 INFO L124 PetriNetUnfolderBase]: 461/641 cut-off events. [2023-08-26 23:08:41,325 INFO L125 PetriNetUnfolderBase]: For 227/227 co-relation queries the response was YES. [2023-08-26 23:08:41,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1641 conditions, 641 events. 461/641 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1796 event pairs, 37 based on Foata normal form. 36/677 useless extension candidates. Maximal degree in co-relation 586. Up to 435 conditions per place. [2023-08-26 23:08:41,327 INFO L140 encePairwiseOnDemand]: 210/217 looper letters, 50 selfloop transitions, 9 changer transitions 1/60 dead transitions. [2023-08-26 23:08:41,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 60 transitions, 289 flow [2023-08-26 23:08:41,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 23:08:41,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 23:08:41,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 402 transitions. [2023-08-26 23:08:41,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4631336405529954 [2023-08-26 23:08:41,329 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 402 transitions. [2023-08-26 23:08:41,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 402 transitions. [2023-08-26 23:08:41,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:08:41,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 402 transitions. [2023-08-26 23:08:41,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:41,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:41,333 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:41,333 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 91 flow. Second operand 4 states and 402 transitions. [2023-08-26 23:08:41,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 60 transitions, 289 flow [2023-08-26 23:08:41,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 60 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 23:08:41,334 INFO L231 Difference]: Finished difference. Result has 32 places, 33 transitions, 127 flow [2023-08-26 23:08:41,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=32, PETRI_TRANSITIONS=33} [2023-08-26 23:08:41,335 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-08-26 23:08:41,335 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 33 transitions, 127 flow [2023-08-26 23:08:41,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:41,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:08:41,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:08:41,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 23:08:41,336 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-26 23:08:41,336 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:08:41,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1526630126, now seen corresponding path program 2 times [2023-08-26 23:08:41,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:08:41,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042558516] [2023-08-26 23:08:41,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:08:41,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:08:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:08:41,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:08:41,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:08:41,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042558516] [2023-08-26 23:08:41,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042558516] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 23:08:41,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279649831] [2023-08-26 23:08:41,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 23:08:41,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:08:41,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:08:41,489 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 23:08:41,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-26 23:08:41,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 23:08:41,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 23:08:41,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 23:08:41,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 23:08:41,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:08:41,689 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 23:08:41,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:08:41,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1279649831] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 23:08:41,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 23:08:41,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-26 23:08:41,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647743179] [2023-08-26 23:08:41,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 23:08:41,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 23:08:41,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:08:41,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 23:08:41,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 23:08:41,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 217 [2023-08-26 23:08:41,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 33 transitions, 127 flow. Second operand has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:41,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:08:41,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 217 [2023-08-26 23:08:41,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:08:42,000 INFO L124 PetriNetUnfolderBase]: 893/1233 cut-off events. [2023-08-26 23:08:42,001 INFO L125 PetriNetUnfolderBase]: For 586/586 co-relation queries the response was YES. [2023-08-26 23:08:42,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3381 conditions, 1233 events. 893/1233 cut-off events. For 586/586 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3982 event pairs, 125 based on Foata normal form. 36/1269 useless extension candidates. Maximal degree in co-relation 745. Up to 482 conditions per place. [2023-08-26 23:08:42,007 INFO L140 encePairwiseOnDemand]: 210/217 looper letters, 89 selfloop transitions, 12 changer transitions 1/102 dead transitions. [2023-08-26 23:08:42,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 102 transitions, 526 flow [2023-08-26 23:08:42,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 23:08:42,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 23:08:42,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 610 transitions. [2023-08-26 23:08:42,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4685099846390169 [2023-08-26 23:08:42,008 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 610 transitions. [2023-08-26 23:08:42,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 610 transitions. [2023-08-26 23:08:42,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:08:42,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 610 transitions. [2023-08-26 23:08:42,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:42,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:42,012 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:42,012 INFO L175 Difference]: Start difference. First operand has 32 places, 33 transitions, 127 flow. Second operand 6 states and 610 transitions. [2023-08-26 23:08:42,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 102 transitions, 526 flow [2023-08-26 23:08:42,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 102 transitions, 512 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 23:08:42,015 INFO L231 Difference]: Finished difference. Result has 38 places, 38 transitions, 179 flow [2023-08-26 23:08:42,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=179, PETRI_PLACES=38, PETRI_TRANSITIONS=38} [2023-08-26 23:08:42,016 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2023-08-26 23:08:42,017 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 38 transitions, 179 flow [2023-08-26 23:08:42,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.85714285714286) internal successors, (643), 7 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:42,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:08:42,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:08:42,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-26 23:08:42,224 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-08-26 23:08:42,225 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-26 23:08:42,226 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:08:42,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1256948426, now seen corresponding path program 1 times [2023-08-26 23:08:42,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:08:42,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601539171] [2023-08-26 23:08:42,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:08:42,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:08:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:08:42,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:08:42,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:08:42,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601539171] [2023-08-26 23:08:42,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601539171] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 23:08:42,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 23:08:42,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 23:08:42,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99772933] [2023-08-26 23:08:42,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 23:08:42,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 23:08:42,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:08:42,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 23:08:42,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 23:08:42,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 217 [2023-08-26 23:08:42,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 38 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:42,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:08:42,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 217 [2023-08-26 23:08:42,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:08:42,501 INFO L124 PetriNetUnfolderBase]: 863/1203 cut-off events. [2023-08-26 23:08:42,501 INFO L125 PetriNetUnfolderBase]: For 1859/1859 co-relation queries the response was YES. [2023-08-26 23:08:42,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3838 conditions, 1203 events. 863/1203 cut-off events. For 1859/1859 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3864 event pairs, 175 based on Foata normal form. 30/1233 useless extension candidates. Maximal degree in co-relation 2126. Up to 997 conditions per place. [2023-08-26 23:08:42,506 INFO L140 encePairwiseOnDemand]: 210/217 looper letters, 49 selfloop transitions, 11 changer transitions 11/71 dead transitions. [2023-08-26 23:08:42,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 71 transitions, 434 flow [2023-08-26 23:08:42,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 23:08:42,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 23:08:42,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 402 transitions. [2023-08-26 23:08:42,508 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4631336405529954 [2023-08-26 23:08:42,508 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 402 transitions. [2023-08-26 23:08:42,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 402 transitions. [2023-08-26 23:08:42,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:08:42,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 402 transitions. [2023-08-26 23:08:42,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:42,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:42,510 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:42,510 INFO L175 Difference]: Start difference. First operand has 38 places, 38 transitions, 179 flow. Second operand 4 states and 402 transitions. [2023-08-26 23:08:42,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 71 transitions, 434 flow [2023-08-26 23:08:42,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 71 transitions, 423 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 23:08:42,513 INFO L231 Difference]: Finished difference. Result has 41 places, 42 transitions, 222 flow [2023-08-26 23:08:42,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=41, PETRI_TRANSITIONS=42} [2023-08-26 23:08:42,514 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2023-08-26 23:08:42,543 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 42 transitions, 222 flow [2023-08-26 23:08:42,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:42,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:08:42,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:08:42,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 23:08:42,544 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-26 23:08:42,544 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:08:42,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1211851505, now seen corresponding path program 1 times [2023-08-26 23:08:42,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:08:42,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803208042] [2023-08-26 23:08:42,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:08:42,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:08:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:08:42,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:08:42,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:08:42,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803208042] [2023-08-26 23:08:42,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803208042] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 23:08:42,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726715349] [2023-08-26 23:08:42,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:08:42,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:08:42,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:08:42,677 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 23:08:42,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-26 23:08:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:08:42,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 23:08:42,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 23:08:42,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:08:42,886 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 23:08:42,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:08:42,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726715349] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 23:08:42,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 23:08:42,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-26 23:08:42,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654518961] [2023-08-26 23:08:42,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 23:08:42,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 23:08:42,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:08:42,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 23:08:42,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 23:08:42,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 217 [2023-08-26 23:08:42,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 42 transitions, 222 flow. Second operand has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:42,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:08:42,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 217 [2023-08-26 23:08:42,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:08:43,223 INFO L124 PetriNetUnfolderBase]: 1541/2125 cut-off events. [2023-08-26 23:08:43,223 INFO L125 PetriNetUnfolderBase]: For 3017/3017 co-relation queries the response was YES. [2023-08-26 23:08:43,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7304 conditions, 2125 events. 1541/2125 cut-off events. For 3017/3017 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7624 event pairs, 285 based on Foata normal form. 90/2215 useless extension candidates. Maximal degree in co-relation 3827. Up to 896 conditions per place. [2023-08-26 23:08:43,235 INFO L140 encePairwiseOnDemand]: 210/217 looper letters, 103 selfloop transitions, 14 changer transitions 3/120 dead transitions. [2023-08-26 23:08:43,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 120 transitions, 789 flow [2023-08-26 23:08:43,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 23:08:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 23:08:43,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions. [2023-08-26 23:08:43,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46543778801843316 [2023-08-26 23:08:43,237 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 606 transitions. [2023-08-26 23:08:43,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 606 transitions. [2023-08-26 23:08:43,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:08:43,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 606 transitions. [2023-08-26 23:08:43,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:43,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:43,242 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:43,242 INFO L175 Difference]: Start difference. First operand has 41 places, 42 transitions, 222 flow. Second operand 6 states and 606 transitions. [2023-08-26 23:08:43,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 120 transitions, 789 flow [2023-08-26 23:08:43,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 120 transitions, 780 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 23:08:43,250 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 284 flow [2023-08-26 23:08:43,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=284, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2023-08-26 23:08:43,252 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2023-08-26 23:08:43,252 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 284 flow [2023-08-26 23:08:43,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:43,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:08:43,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:08:43,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-26 23:08:43,463 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-08-26 23:08:43,466 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-26 23:08:43,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:08:43,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1542290784, now seen corresponding path program 2 times [2023-08-26 23:08:43,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:08:43,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869573174] [2023-08-26 23:08:43,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:08:43,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:08:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:08:43,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:08:43,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:08:43,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869573174] [2023-08-26 23:08:43,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869573174] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 23:08:43,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601942142] [2023-08-26 23:08:43,567 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 23:08:43,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:08:43,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:08:43,568 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 23:08:43,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-26 23:08:43,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 23:08:43,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 23:08:43,666 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 23:08:43,667 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 23:08:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:08:43,743 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 23:08:43,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:08:43,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601942142] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 23:08:43,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 23:08:43,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-26 23:08:43,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235062094] [2023-08-26 23:08:43,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 23:08:43,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 23:08:43,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:08:43,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 23:08:43,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 23:08:43,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 217 [2023-08-26 23:08:43,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 284 flow. Second operand has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:43,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:08:43,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 217 [2023-08-26 23:08:43,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:08:44,080 INFO L124 PetriNetUnfolderBase]: 1885/2599 cut-off events. [2023-08-26 23:08:44,080 INFO L125 PetriNetUnfolderBase]: For 5858/5858 co-relation queries the response was YES. [2023-08-26 23:08:44,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10407 conditions, 2599 events. 1885/2599 cut-off events. For 5858/5858 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9699 event pairs, 317 based on Foata normal form. 84/2683 useless extension candidates. Maximal degree in co-relation 5273. Up to 1525 conditions per place. [2023-08-26 23:08:44,093 INFO L140 encePairwiseOnDemand]: 210/217 looper letters, 106 selfloop transitions, 14 changer transitions 3/123 dead transitions. [2023-08-26 23:08:44,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 123 transitions, 871 flow [2023-08-26 23:08:44,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 23:08:44,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 23:08:44,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions. [2023-08-26 23:08:44,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46543778801843316 [2023-08-26 23:08:44,095 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 606 transitions. [2023-08-26 23:08:44,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 606 transitions. [2023-08-26 23:08:44,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:08:44,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 606 transitions. [2023-08-26 23:08:44,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:44,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:44,097 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 217.0) internal successors, (1519), 7 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:44,097 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 284 flow. Second operand 6 states and 606 transitions. [2023-08-26 23:08:44,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 123 transitions, 871 flow [2023-08-26 23:08:44,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 123 transitions, 860 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 23:08:44,107 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 336 flow [2023-08-26 23:08:44,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=336, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2023-08-26 23:08:44,107 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 20 predicate places. [2023-08-26 23:08:44,108 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 336 flow [2023-08-26 23:08:44,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.0) internal successors, (651), 7 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:44,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:08:44,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:08:44,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-26 23:08:44,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:08:44,313 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-26 23:08:44,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:08:44,313 INFO L85 PathProgramCache]: Analyzing trace with hash 535008700, now seen corresponding path program 1 times [2023-08-26 23:08:44,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:08:44,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623804506] [2023-08-26 23:08:44,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:08:44,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:08:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:08:44,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:08:44,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:08:44,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623804506] [2023-08-26 23:08:44,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623804506] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 23:08:44,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 23:08:44,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 23:08:44,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721127464] [2023-08-26 23:08:44,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 23:08:44,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 23:08:44,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:08:44,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 23:08:44,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 23:08:44,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 217 [2023-08-26 23:08:44,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 336 flow. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:44,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:08:44,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 217 [2023-08-26 23:08:44,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:08:44,651 INFO L124 PetriNetUnfolderBase]: 2149/2947 cut-off events. [2023-08-26 23:08:44,652 INFO L125 PetriNetUnfolderBase]: For 9149/9149 co-relation queries the response was YES. [2023-08-26 23:08:44,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12918 conditions, 2947 events. 2149/2947 cut-off events. For 9149/9149 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 11278 event pairs, 555 based on Foata normal form. 84/3031 useless extension candidates. Maximal degree in co-relation 8105. Up to 2463 conditions per place. [2023-08-26 23:08:44,666 INFO L140 encePairwiseOnDemand]: 211/217 looper letters, 75 selfloop transitions, 10 changer transitions 3/88 dead transitions. [2023-08-26 23:08:44,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 88 transitions, 717 flow [2023-08-26 23:08:44,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 23:08:44,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 23:08:44,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 400 transitions. [2023-08-26 23:08:44,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4608294930875576 [2023-08-26 23:08:44,667 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 400 transitions. [2023-08-26 23:08:44,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 400 transitions. [2023-08-26 23:08:44,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:08:44,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 400 transitions. [2023-08-26 23:08:44,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:44,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:44,670 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 217.0) internal successors, (1085), 5 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:44,670 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 336 flow. Second operand 4 states and 400 transitions. [2023-08-26 23:08:44,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 88 transitions, 717 flow [2023-08-26 23:08:44,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 88 transitions, 668 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-26 23:08:44,702 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 336 flow [2023-08-26 23:08:44,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=336, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2023-08-26 23:08:44,703 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2023-08-26 23:08:44,703 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 336 flow [2023-08-26 23:08:44,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:44,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:08:44,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:08:44,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 23:08:44,704 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-26 23:08:44,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:08:44,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1140566447, now seen corresponding path program 1 times [2023-08-26 23:08:44,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:08:44,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690001779] [2023-08-26 23:08:44,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:08:44,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:08:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:08:45,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:08:45,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:08:45,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690001779] [2023-08-26 23:08:45,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690001779] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 23:08:45,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224977491] [2023-08-26 23:08:45,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:08:45,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:08:45,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:08:45,037 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 23:08:45,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-26 23:08:45,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:08:45,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 23:08:45,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 23:09:13,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:09:13,218 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 23:09:30,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:09:30,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224977491] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 23:09:30,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 23:09:30,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-08-26 23:09:30,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597922537] [2023-08-26 23:09:30,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 23:09:30,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-26 23:09:30,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:09:30,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-26 23:09:30,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=165, Unknown=17, NotChecked=0, Total=240 [2023-08-26 23:09:30,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 217 [2023-08-26 23:09:30,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 336 flow. Second operand has 16 states, 16 states have (on average 88.6875) internal successors, (1419), 16 states have internal predecessors, (1419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:09:30,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:09:30,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 217 [2023-08-26 23:09:30,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:09:32,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:09:34,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:09:56,321 WARN L234 SmtUtils]: Spent 17.22s on a formula simplification. DAG size of input: 71 DAG size of output: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 23:10:56,444 WARN L234 SmtUtils]: Spent 56.81s on a formula simplification. DAG size of input: 87 DAG size of output: 65 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 23:11:03,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:11:05,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:11:07,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:11:09,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:11:31,537 WARN L234 SmtUtils]: Spent 5.65s on a formula simplification. DAG size of input: 55 DAG size of output: 27 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 23:11:33,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:11:35,726 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 [] [2023-08-26 23:11:38,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:11:42,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:11:44,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:11:46,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:11:48,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:11:50,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:11:52,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:11:54,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:11:56,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:11:58,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:12:00,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:12:02,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:12:47,094 WARN L234 SmtUtils]: Spent 30.95s on a formula simplification. DAG size of input: 54 DAG size of output: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 23:12:49,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:12:51,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:12:53,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:12:55,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:12:57,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:12:59,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:13:01,581 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 [] [2023-08-26 23:13:03,598 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 [] [2023-08-26 23:13:05,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:13:07,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:13:09,635 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 [] [2023-08-26 23:13:11,656 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 [] [2023-08-26 23:13:13,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:13:15,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:13:17,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:13:19,697 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 [] [2023-08-26 23:13:21,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:13:23,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:13:25,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:13:27,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:13:29,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:13:32,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:13:34,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:14:07,537 WARN L234 SmtUtils]: Spent 28.75s on a formula simplification. DAG size of input: 88 DAG size of output: 45 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 23:14:09,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:14:11,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:14:13,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:14:19,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:14:20,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:14:23,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:14:25,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:14:27,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:14:29,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:14:31,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:14:36,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:14:38,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:14:40,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:14:42,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:14:43,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:14:45,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:14:47,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:14:49,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:14:52,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:14:53,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:14:55,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:14:58,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:15:00,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:15:02,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:15:04,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:15:15,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:15:17,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:15:41,485 WARN L234 SmtUtils]: Spent 9.17s on a formula simplification. DAG size of input: 77 DAG size of output: 53 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 23:15:43,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:15:45,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:15:48,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:15:51,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:15:53,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:15:55,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:15:57,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:00,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:02,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:04,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:07,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:09,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:11,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:13,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:16,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:19,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:21,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:23,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:25,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:28,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:30,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:32,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:34,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:36,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:38,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:40,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:42,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:45,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:46,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:49,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:51,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:54,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:56,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:58,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:00,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:02,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:04,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:06,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:08,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:10,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:12,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:14,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:16,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:18,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:20,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 [] [2023-08-26 23:17:21,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:24,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:26,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:28,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:30,976 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 [] [2023-08-26 23:17:32,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:06,363 WARN L234 SmtUtils]: Spent 12.57s on a formula simplification. DAG size of input: 52 DAG size of output: 27 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 23:18:08,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:10,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:23,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:25,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:29,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:31,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:33,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:35,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:37,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:39,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:41,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:43,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:46,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:49,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:52,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:53,041 INFO L124 PetriNetUnfolderBase]: 3822/5248 cut-off events. [2023-08-26 23:18:53,041 INFO L125 PetriNetUnfolderBase]: For 14662/14662 co-relation queries the response was YES. [2023-08-26 23:18:53,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22709 conditions, 5248 events. 3822/5248 cut-off events. For 14662/14662 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 22495 event pairs, 345 based on Foata normal form. 4/5252 useless extension candidates. Maximal degree in co-relation 15420. Up to 3339 conditions per place. [2023-08-26 23:18:53,128 INFO L140 encePairwiseOnDemand]: 198/217 looper letters, 174 selfloop transitions, 144 changer transitions 5/323 dead transitions. [2023-08-26 23:18:53,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 323 transitions, 2444 flow [2023-08-26 23:18:53,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-26 23:18:53,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-26 23:18:53,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1966 transitions. [2023-08-26 23:18:53,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45299539170506914 [2023-08-26 23:18:53,138 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1966 transitions. [2023-08-26 23:18:53,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1966 transitions. [2023-08-26 23:18:53,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:18:53,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1966 transitions. [2023-08-26 23:18:53,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 98.3) internal successors, (1966), 20 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:18:53,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 217.0) internal successors, (4557), 21 states have internal predecessors, (4557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:18:53,153 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 217.0) internal successors, (4557), 21 states have internal predecessors, (4557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:18:53,153 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 336 flow. Second operand 20 states and 1966 transitions. [2023-08-26 23:18:53,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 323 transitions, 2444 flow [2023-08-26 23:18:53,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 323 transitions, 2418 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-26 23:18:53,173 INFO L231 Difference]: Finished difference. Result has 85 places, 190 transitions, 1782 flow [2023-08-26 23:18:53,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1782, PETRI_PLACES=85, PETRI_TRANSITIONS=190} [2023-08-26 23:18:53,174 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 51 predicate places. [2023-08-26 23:18:53,174 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 190 transitions, 1782 flow [2023-08-26 23:18:53,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 88.6875) internal successors, (1419), 16 states have internal predecessors, (1419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:18:53,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:18:53,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:18:53,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-26 23:18:53,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:18:53,380 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-26 23:18:53,381 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:18:53,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1852218380, now seen corresponding path program 1 times [2023-08-26 23:18:53,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:18:53,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258777832] [2023-08-26 23:18:53,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:18:53,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:18:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:18:53,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:18:53,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:18:53,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258777832] [2023-08-26 23:18:53,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258777832] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 23:18:53,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649730938] [2023-08-26 23:18:53,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:18:53,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:18:53,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:18:53,760 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 23:18:53,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-26 23:18:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:18:53,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-26 23:18:53,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 23:19:12,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:19:12,577 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 23:19:22,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:19:22,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649730938] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 23:19:22,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 23:19:22,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2023-08-26 23:19:22,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155879254] [2023-08-26 23:19:22,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 23:19:22,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-26 23:19:22,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:19:22,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-26 23:19:22,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=136, Unknown=10, NotChecked=0, Total=182 [2023-08-26 23:19:22,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 217 [2023-08-26 23:19:22,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 190 transitions, 1782 flow. Second operand has 14 states, 14 states have (on average 89.64285714285714) internal successors, (1255), 14 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:19:22,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:19:22,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 217 [2023-08-26 23:19:22,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:19:33,148 WARN L234 SmtUtils]: Spent 6.39s on a formula simplification. DAG size of input: 80 DAG size of output: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 23:19:35,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:19:38,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:19:40,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:19:42,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:19:44,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:19:47,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:19:50,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:19:52,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:19:54,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:19:56,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:02,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:04,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:05,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:09,356 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 [] [2023-08-26 23:20:11,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:14,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:16,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:18,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:21,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:28,347 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 [] [2023-08-26 23:20:29,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:31,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:34,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:35,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:38,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:40,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:42,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:46,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:48,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:50,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:56,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:58,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:59,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:21:05,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:21:06,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:21:08,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:21:10,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:21:17,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:21:18,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:21:20,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:21:22,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 [] [2023-08-26 23:21:24,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:21:26,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:21:30,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:21:32,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:21:34,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:21:36,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:21:38,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:21:39,522 INFO L124 PetriNetUnfolderBase]: 4669/6406 cut-off events. [2023-08-26 23:21:39,523 INFO L125 PetriNetUnfolderBase]: For 53902/53902 co-relation queries the response was YES. [2023-08-26 23:21:39,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40554 conditions, 6406 events. 4669/6406 cut-off events. For 53902/53902 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 28123 event pairs, 790 based on Foata normal form. 3/6409 useless extension candidates. Maximal degree in co-relation 38147. Up to 5376 conditions per place. [2023-08-26 23:21:39,557 INFO L140 encePairwiseOnDemand]: 199/217 looper letters, 259 selfloop transitions, 49 changer transitions 9/317 dead transitions. [2023-08-26 23:21:39,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 317 transitions, 3459 flow [2023-08-26 23:21:39,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 23:21:39,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 23:21:39,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1006 transitions. [2023-08-26 23:21:39,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46359447004608295 [2023-08-26 23:21:39,562 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1006 transitions. [2023-08-26 23:21:39,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1006 transitions. [2023-08-26 23:21:39,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:21:39,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1006 transitions. [2023-08-26 23:21:39,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 100.6) internal successors, (1006), 10 states have internal predecessors, (1006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:21:39,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 217.0) internal successors, (2387), 11 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:21:39,566 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 217.0) internal successors, (2387), 11 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:21:39,566 INFO L175 Difference]: Start difference. First operand has 85 places, 190 transitions, 1782 flow. Second operand 10 states and 1006 transitions. [2023-08-26 23:21:39,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 317 transitions, 3459 flow [2023-08-26 23:21:39,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 317 transitions, 3140 flow, removed 155 selfloop flow, removed 1 redundant places. [2023-08-26 23:21:39,645 INFO L231 Difference]: Finished difference. Result has 99 places, 230 transitions, 1998 flow [2023-08-26 23:21:39,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1998, PETRI_PLACES=99, PETRI_TRANSITIONS=230} [2023-08-26 23:21:39,646 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 65 predicate places. [2023-08-26 23:21:39,646 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 230 transitions, 1998 flow [2023-08-26 23:21:39,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 89.64285714285714) internal successors, (1255), 14 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:21:39,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:21:39,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:21:39,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-26 23:21:39,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:21:39,851 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-26 23:21:39,852 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:21:39,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1926549130, now seen corresponding path program 2 times [2023-08-26 23:21:39,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:21:39,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141949872] [2023-08-26 23:21:39,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:21:39,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:21:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:21:40,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:21:40,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:21:40,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141949872] [2023-08-26 23:21:40,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141949872] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 23:21:40,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963703186] [2023-08-26 23:21:40,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 23:21:40,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:21:40,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:21:40,146 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 23:21:40,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-26 23:21:40,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 23:21:40,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 23:21:40,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 23:21:40,310 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 23:21:49,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:21:49,707 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 23:21:50,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:21:50,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963703186] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 23:21:50,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 23:21:50,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-08-26 23:21:50,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981393829] [2023-08-26 23:21:50,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 23:21:50,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-26 23:21:50,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:21:50,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-26 23:21:50,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2023-08-26 23:21:50,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 217 [2023-08-26 23:21:50,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 230 transitions, 1998 flow. Second operand has 16 states, 16 states have (on average 89.0625) internal successors, (1425), 16 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:21:50,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:21:50,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 217 [2023-08-26 23:21:50,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:21:52,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:21:56,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:21:58,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:22:00,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:22:02,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:22:03,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:22:05,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:22:07,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:22:10,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:22:14,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:22:17,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:22:21,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:22:23,755 INFO L124 PetriNetUnfolderBase]: 6296/8652 cut-off events. [2023-08-26 23:22:23,755 INFO L125 PetriNetUnfolderBase]: For 97543/97543 co-relation queries the response was YES. [2023-08-26 23:22:23,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60103 conditions, 8652 events. 6296/8652 cut-off events. For 97543/97543 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 40292 event pairs, 627 based on Foata normal form. 33/8685 useless extension candidates. Maximal degree in co-relation 57545. Up to 6199 conditions per place. [2023-08-26 23:22:23,798 INFO L140 encePairwiseOnDemand]: 209/217 looper letters, 301 selfloop transitions, 127 changer transitions 11/439 dead transitions. [2023-08-26 23:22:23,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 439 transitions, 5030 flow [2023-08-26 23:22:23,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-26 23:22:23,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-26 23:22:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1303 transitions. [2023-08-26 23:22:23,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4618929457639135 [2023-08-26 23:22:23,801 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1303 transitions. [2023-08-26 23:22:23,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1303 transitions. [2023-08-26 23:22:23,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:22:23,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1303 transitions. [2023-08-26 23:22:23,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 100.23076923076923) internal successors, (1303), 13 states have internal predecessors, (1303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:22:23,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 217.0) internal successors, (3038), 14 states have internal predecessors, (3038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:22:23,807 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 217.0) internal successors, (3038), 14 states have internal predecessors, (3038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:22:23,807 INFO L175 Difference]: Start difference. First operand has 99 places, 230 transitions, 1998 flow. Second operand 13 states and 1303 transitions. [2023-08-26 23:22:23,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 439 transitions, 5030 flow [2023-08-26 23:22:23,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 439 transitions, 4875 flow, removed 73 selfloop flow, removed 1 redundant places. [2023-08-26 23:22:23,931 INFO L231 Difference]: Finished difference. Result has 118 places, 307 transitions, 3066 flow [2023-08-26 23:22:23,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=1859, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3066, PETRI_PLACES=118, PETRI_TRANSITIONS=307} [2023-08-26 23:22:23,932 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 84 predicate places. [2023-08-26 23:22:23,932 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 307 transitions, 3066 flow [2023-08-26 23:22:23,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 89.0625) internal successors, (1425), 16 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:22:23,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:22:23,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:22:23,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-26 23:22:24,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:22:24,139 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-26 23:22:24,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:22:24,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1506696273, now seen corresponding path program 2 times [2023-08-26 23:22:24,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:22:24,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873998225] [2023-08-26 23:22:24,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:22:24,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:22:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:22:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:22:24,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:22:24,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873998225] [2023-08-26 23:22:24,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873998225] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 23:22:24,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642350758] [2023-08-26 23:22:24,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 23:22:24,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:22:24,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:22:24,497 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 23:22:24,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-26 23:22:25,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 23:22:25,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 23:22:25,201 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 23:22:25,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 23:22:56,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:22:56,988 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-08-26 23:23:19,702 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 23:23:19,702 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 23:23:20,622 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (4 of 5 remaining) [2023-08-26 23:23:20,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-26 23:23:20,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 [2023-08-26 23:23:20,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:23:20,823 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 24 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. [2023-08-26 23:23:20,824 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-08-26 23:23:20,824 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-26 23:23:20,825 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-26 23:23:20,825 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-08-26 23:23:20,825 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1] [2023-08-26 23:23:20,827 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 23:23:20,827 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 23:23:20,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 11:23:20 BasicIcfg [2023-08-26 23:23:20,830 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 23:23:20,831 INFO L158 Benchmark]: Toolchain (without parser) took 883973.13ms. Allocated memory was 312.5MB in the beginning and 476.1MB in the end (delta: 163.6MB). Free memory was 288.5MB in the beginning and 263.5MB in the end (delta: 25.0MB). Peak memory consumption was 191.1MB. Max. memory is 16.0GB. [2023-08-26 23:23:20,831 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 312.5MB. Free memory was 288.9MB in the beginning and 288.8MB in the end (delta: 94.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 23:23:20,831 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.72ms. Allocated memory is still 312.5MB. Free memory was 288.5MB in the beginning and 277.4MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-26 23:23:20,834 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.12ms. Allocated memory is still 312.5MB. Free memory was 277.4MB in the beginning and 275.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 23:23:20,834 INFO L158 Benchmark]: Boogie Preprocessor took 23.00ms. Allocated memory is still 312.5MB. Free memory was 275.7MB in the beginning and 274.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 23:23:20,834 INFO L158 Benchmark]: RCFGBuilder took 366.80ms. Allocated memory is still 312.5MB. Free memory was 274.2MB in the beginning and 259.2MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-08-26 23:23:20,834 INFO L158 Benchmark]: TraceAbstraction took 883381.59ms. Allocated memory was 312.5MB in the beginning and 476.1MB in the end (delta: 163.6MB). Free memory was 258.5MB in the beginning and 263.5MB in the end (delta: -5.0MB). Peak memory consumption was 161.7MB. Max. memory is 16.0GB. [2023-08-26 23:23:20,835 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.11ms. Allocated memory is still 312.5MB. Free memory was 288.9MB in the beginning and 288.8MB in the end (delta: 94.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 172.72ms. Allocated memory is still 312.5MB. Free memory was 288.5MB in the beginning and 277.4MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 23.12ms. Allocated memory is still 312.5MB. Free memory was 277.4MB in the beginning and 275.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 23.00ms. Allocated memory is still 312.5MB. Free memory was 275.7MB in the beginning and 274.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 366.80ms. Allocated memory is still 312.5MB. Free memory was 274.2MB in the beginning and 259.2MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * TraceAbstraction took 883381.59ms. Allocated memory was 312.5MB in the beginning and 476.1MB in the end (delta: 163.6MB). Free memory was 258.5MB in the beginning and 263.5MB in the end (delta: -5.0MB). Peak memory consumption was 161.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 110 PlacesBefore, 34 PlacesAfterwards, 107 TransitionsBefore, 25 TransitionsAfterwards, 1224 CoEnabledTransitionPairs, 6 FixpointIterations, 48 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 8 ConcurrentYvCompositions, 6 ChoiceCompositions, 93 TotalNumberOfCompositions, 1432 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1432, independent: 1432, independent conditional: 0, independent unconditional: 1432, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 656, independent: 656, independent conditional: 0, independent unconditional: 656, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1432, independent: 776, independent conditional: 0, independent unconditional: 776, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 656, unknown conditional: 0, unknown unconditional: 656] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while CegarLoopForPetriNet was analyzing trace of length 24 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 24 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 24 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 24 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 24 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 15 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 139 locations, 5 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: 883.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 735.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 167 mSolverCounterUnknown, 695 SdHoareTripleChecker+Valid, 443.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 695 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 441.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3206 IncrementalHoareTripleChecker+Invalid, 3461 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 0 mSDtfsCounter, 3206 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 224 SyntacticMatches, 15 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 365.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3066occurred in iteration=10, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 86.0s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 470 ConstructedInterpolants, 0 QuantifiedInterpolants, 16200 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1209 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 4/30 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