/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/queue_ok_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 14:58:30,900 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 14:58:30,971 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 14:58:30,995 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 14:58:30,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 14:58:30,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 14:58:30,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 14:58:30,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 14:58:30,998 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 14:58:31,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 14:58:31,001 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 14:58:31,001 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 14:58:31,001 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 14:58:31,002 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 14:58:31,002 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 14:58:31,002 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 14:58:31,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 14:58:31,002 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 14:58:31,002 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 14:58:31,003 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 14:58:31,003 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 14:58:31,003 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 14:58:31,003 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 14:58:31,004 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 14:58:31,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 14:58:31,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 14:58:31,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 14:58:31,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 14:58:31,004 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 14:58:31,004 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 14:58:31,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 14:58:31,005 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 14:58:31,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-17 14:58:31,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 14:58:31,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 14:58:31,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 14:58:31,193 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 14:58:31,193 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 14:58:31,194 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-11-17 14:58:32,241 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 14:58:32,493 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 14:58:32,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2023-11-17 14:58:32,510 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb7f3e0e2/c91455da23aa4d02ada450c8ca1265b9/FLAGea7fb82cb [2023-11-17 14:58:32,817 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb7f3e0e2/c91455da23aa4d02ada450c8ca1265b9 [2023-11-17 14:58:32,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 14:58:32,820 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 14:58:32,821 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 14:58:32,821 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 14:58:32,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 14:58:32,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:58:32" (1/1) ... [2023-11-17 14:58:32,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b682c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:32, skipping insertion in model container [2023-11-17 14:58:32,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:58:32" (1/1) ... [2023-11-17 14:58:32,879 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 14:58:33,187 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43280,43293] [2023-11-17 14:58:33,196 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43553,43566] [2023-11-17 14:58:33,201 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 14:58:33,214 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 14:58:33,281 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43280,43293] [2023-11-17 14:58:33,287 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43553,43566] [2023-11-17 14:58:33,292 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 14:58:33,347 INFO L206 MainTranslator]: Completed translation [2023-11-17 14:58:33,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:33 WrapperNode [2023-11-17 14:58:33,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 14:58:33,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 14:58:33,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 14:58:33,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 14:58:33,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:33" (1/1) ... [2023-11-17 14:58:33,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:33" (1/1) ... [2023-11-17 14:58:33,403 INFO L138 Inliner]: procedures = 275, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 208 [2023-11-17 14:58:33,404 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 14:58:33,404 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 14:58:33,404 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 14:58:33,404 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 14:58:33,414 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:33" (1/1) ... [2023-11-17 14:58:33,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:33" (1/1) ... [2023-11-17 14:58:33,417 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:33" (1/1) ... [2023-11-17 14:58:33,417 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:33" (1/1) ... [2023-11-17 14:58:33,423 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:33" (1/1) ... [2023-11-17 14:58:33,437 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:33" (1/1) ... [2023-11-17 14:58:33,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:33" (1/1) ... [2023-11-17 14:58:33,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:33" (1/1) ... [2023-11-17 14:58:33,442 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 14:58:33,443 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 14:58:33,443 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 14:58:33,443 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 14:58:33,443 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:33" (1/1) ... [2023-11-17 14:58:33,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 14:58:33,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:58:33,473 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 14:58:33,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 14:58:33,511 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-17 14:58:33,511 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-17 14:58:33,511 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-17 14:58:33,511 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-17 14:58:33,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 14:58:33,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 14:58:33,511 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-17 14:58:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 14:58:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 14:58:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-17 14:58:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 14:58:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 14:58:33,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 14:58:33,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 14:58:33,513 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 14:58:33,627 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 14:58:33,630 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 14:58:33,860 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 14:58:33,880 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 14:58:33,885 INFO L307 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-17 14:58:33,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 02:58:33 BoogieIcfgContainer [2023-11-17 14:58:33,886 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 14:58:33,888 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 14:58:33,888 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 14:58:33,890 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 14:58:33,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 02:58:32" (1/3) ... [2023-11-17 14:58:33,891 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a488ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:58:33, skipping insertion in model container [2023-11-17 14:58:33,891 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:58:33" (2/3) ... [2023-11-17 14:58:33,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a488ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:58:33, skipping insertion in model container [2023-11-17 14:58:33,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 02:58:33" (3/3) ... [2023-11-17 14:58:33,893 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2023-11-17 14:58:33,906 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 14:58:33,906 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 14:58:33,906 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 14:58:33,988 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-17 14:58:34,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 228 transitions, 470 flow [2023-11-17 14:58:34,085 INFO L124 PetriNetUnfolderBase]: 13/226 cut-off events. [2023-11-17 14:58:34,085 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 14:58:34,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 226 events. 13/226 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 375 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 149. Up to 3 conditions per place. [2023-11-17 14:58:34,096 INFO L82 GeneralOperation]: Start removeDead. Operand has 222 places, 228 transitions, 470 flow [2023-11-17 14:58:34,100 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 210 places, 216 transitions, 441 flow [2023-11-17 14:58:34,102 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 14:58:34,110 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 216 transitions, 441 flow [2023-11-17 14:58:34,112 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 210 places, 216 transitions, 441 flow [2023-11-17 14:58:34,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 216 transitions, 441 flow [2023-11-17 14:58:34,162 INFO L124 PetriNetUnfolderBase]: 13/216 cut-off events. [2023-11-17 14:58:34,163 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-17 14:58:34,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 216 events. 13/216 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 308 event pairs, 0 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 149. Up to 3 conditions per place. [2023-11-17 14:58:34,168 INFO L119 LiptonReduction]: Number of co-enabled transitions 11116 [2023-11-17 14:58:39,715 INFO L134 LiptonReduction]: Checked pairs total: 21569 [2023-11-17 14:58:39,716 INFO L136 LiptonReduction]: Total number of compositions: 208 [2023-11-17 14:58:39,735 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 14:58:39,742 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2da8b23c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 14:58:39,742 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-17 14:58:39,743 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 14:58:39,744 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-17 14:58:39,744 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 14:58:39,744 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 14:58:39,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-17 14:58:39,745 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 14:58:39,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:58:39,750 INFO L85 PathProgramCache]: Analyzing trace with hash 909, now seen corresponding path program 1 times [2023-11-17 14:58:39,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:58:39,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868975637] [2023-11-17 14:58:39,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:58:39,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:58:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:58:39,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:58:39,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:58:39,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868975637] [2023-11-17 14:58:39,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868975637] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 14:58:39,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 14:58:39,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-17 14:58:39,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616742537] [2023-11-17 14:58:39,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 14:58:39,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-17 14:58:39,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 14:58:39,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-17 14:58:39,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-17 14:58:39,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 436 [2023-11-17 14:58:39,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 101 flow. Second operand has 2 states, 2 states have (on average 213.5) internal successors, (427), 2 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:39,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 14:58:39,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 436 [2023-11-17 14:58:39,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 14:58:40,074 INFO L124 PetriNetUnfolderBase]: 953/1560 cut-off events. [2023-11-17 14:58:40,075 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2023-11-17 14:58:40,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3118 conditions, 1560 events. 953/1560 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 6560 event pairs, 762 based on Foata normal form. 0/1292 useless extension candidates. Maximal degree in co-relation 2945. Up to 1506 conditions per place. [2023-11-17 14:58:40,086 INFO L140 encePairwiseOnDemand]: 435/436 looper letters, 42 selfloop transitions, 0 changer transitions 0/45 dead transitions. [2023-11-17 14:58:40,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 183 flow [2023-11-17 14:58:40,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-17 14:58:40,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-17 14:58:40,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 469 transitions. [2023-11-17 14:58:40,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5378440366972477 [2023-11-17 14:58:40,104 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 469 transitions. [2023-11-17 14:58:40,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 469 transitions. [2023-11-17 14:58:40,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 14:58:40,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 469 transitions. [2023-11-17 14:58:40,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 234.5) internal successors, (469), 2 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:40,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 436.0) internal successors, (1308), 3 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:40,118 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 436.0) internal successors, (1308), 3 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:40,119 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 101 flow. Second operand 2 states and 469 transitions. [2023-11-17 14:58:40,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 183 flow [2023-11-17 14:58:40,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 14:58:40,126 INFO L231 Difference]: Finished difference. Result has 43 places, 45 transitions, 94 flow [2023-11-17 14:58:40,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=43, PETRI_TRANSITIONS=45} [2023-11-17 14:58:40,132 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2023-11-17 14:58:40,132 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 45 transitions, 94 flow [2023-11-17 14:58:40,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 213.5) internal successors, (427), 2 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:40,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 14:58:40,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 14:58:40,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 14:58:40,133 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 14:58:40,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:58:40,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1842108697, now seen corresponding path program 1 times [2023-11-17 14:58:40,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:58:40,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861841491] [2023-11-17 14:58:40,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:58:40,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:58:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:58:40,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:58:40,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:58:40,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861841491] [2023-11-17 14:58:40,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861841491] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 14:58:40,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 14:58:40,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 14:58:40,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56235962] [2023-11-17 14:58:40,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 14:58:40,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 14:58:40,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 14:58:40,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 14:58:40,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 14:58:40,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 436 [2023-11-17 14:58:40,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 45 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:40,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 14:58:40,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 436 [2023-11-17 14:58:40,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 14:58:40,489 INFO L124 PetriNetUnfolderBase]: 433/774 cut-off events. [2023-11-17 14:58:40,489 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-11-17 14:58:40,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1578 conditions, 774 events. 433/774 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 3046 event pairs, 291 based on Foata normal form. 32/698 useless extension candidates. Maximal degree in co-relation 1575. Up to 454 conditions per place. [2023-11-17 14:58:40,491 INFO L140 encePairwiseOnDemand]: 432/436 looper letters, 40 selfloop transitions, 2 changer transitions 13/56 dead transitions. [2023-11-17 14:58:40,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 227 flow [2023-11-17 14:58:40,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:58:40,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 14:58:40,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 676 transitions. [2023-11-17 14:58:40,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5168195718654435 [2023-11-17 14:58:40,493 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 676 transitions. [2023-11-17 14:58:40,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 676 transitions. [2023-11-17 14:58:40,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 14:58:40,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 676 transitions. [2023-11-17 14:58:40,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:40,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:40,498 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:40,498 INFO L175 Difference]: Start difference. First operand has 43 places, 45 transitions, 94 flow. Second operand 3 states and 676 transitions. [2023-11-17 14:58:40,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 227 flow [2023-11-17 14:58:40,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 227 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 14:58:40,499 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 90 flow [2023-11-17 14:58:40,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2023-11-17 14:58:40,500 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2023-11-17 14:58:40,500 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 90 flow [2023-11-17 14:58:40,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:40,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 14:58:40,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 14:58:40,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 14:58:40,501 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 14:58:40,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:58:40,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1388712167, now seen corresponding path program 1 times [2023-11-17 14:58:40,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:58:40,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963259007] [2023-11-17 14:58:40,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:58:40,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:58:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:58:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:58:40,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:58:40,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963259007] [2023-11-17 14:58:40,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963259007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 14:58:40,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 14:58:40,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 14:58:40,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829480653] [2023-11-17 14:58:40,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 14:58:40,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 14:58:40,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 14:58:40,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 14:58:40,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 14:58:40,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 436 [2023-11-17 14:58:40,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:40,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 14:58:40,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 436 [2023-11-17 14:58:40,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 14:58:40,648 INFO L124 PetriNetUnfolderBase]: 276/521 cut-off events. [2023-11-17 14:58:40,649 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-11-17 14:58:40,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1101 conditions, 521 events. 276/521 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1668 event pairs, 180 based on Foata normal form. 0/479 useless extension candidates. Maximal degree in co-relation 1096. Up to 394 conditions per place. [2023-11-17 14:58:40,651 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 49 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-17 14:58:40,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 53 transitions, 222 flow [2023-11-17 14:58:40,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:58:40,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 14:58:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 670 transitions. [2023-11-17 14:58:40,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5122324159021406 [2023-11-17 14:58:40,653 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 670 transitions. [2023-11-17 14:58:40,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 670 transitions. [2023-11-17 14:58:40,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 14:58:40,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 670 transitions. [2023-11-17 14:58:40,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:40,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:40,657 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:40,657 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 90 flow. Second operand 3 states and 670 transitions. [2023-11-17 14:58:40,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 53 transitions, 222 flow [2023-11-17 14:58:40,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 53 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 14:58:40,658 INFO L231 Difference]: Finished difference. Result has 43 places, 40 transitions, 98 flow [2023-11-17 14:58:40,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=43, PETRI_TRANSITIONS=40} [2023-11-17 14:58:40,659 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2023-11-17 14:58:40,659 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 98 flow [2023-11-17 14:58:40,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:40,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 14:58:40,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 14:58:40,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 14:58:40,660 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 14:58:40,660 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:58:40,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1983605789, now seen corresponding path program 1 times [2023-11-17 14:58:40,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:58:40,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415569684] [2023-11-17 14:58:40,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:58:40,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:58:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:58:40,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:58:40,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:58:40,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415569684] [2023-11-17 14:58:40,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415569684] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 14:58:40,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 14:58:40,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 14:58:40,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164099070] [2023-11-17 14:58:40,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 14:58:40,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 14:58:40,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 14:58:40,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 14:58:40,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 14:58:40,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 436 [2023-11-17 14:58:40,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:40,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 14:58:40,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 436 [2023-11-17 14:58:40,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 14:58:40,834 INFO L124 PetriNetUnfolderBase]: 169/348 cut-off events. [2023-11-17 14:58:40,834 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-17 14:58:40,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 348 events. 169/348 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1020 event pairs, 6 based on Foata normal form. 42/364 useless extension candidates. Maximal degree in co-relation 763. Up to 317 conditions per place. [2023-11-17 14:58:40,835 INFO L140 encePairwiseOnDemand]: 433/436 looper letters, 41 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2023-11-17 14:58:40,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 46 transitions, 201 flow [2023-11-17 14:58:40,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 14:58:40,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 14:58:40,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 663 transitions. [2023-11-17 14:58:40,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5068807339449541 [2023-11-17 14:58:40,837 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 663 transitions. [2023-11-17 14:58:40,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 663 transitions. [2023-11-17 14:58:40,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 14:58:40,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 663 transitions. [2023-11-17 14:58:40,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:40,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:40,841 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 436.0) internal successors, (1744), 4 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:40,841 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 98 flow. Second operand 3 states and 663 transitions. [2023-11-17 14:58:40,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 46 transitions, 201 flow [2023-11-17 14:58:40,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 199 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 14:58:40,842 INFO L231 Difference]: Finished difference. Result has 44 places, 40 transitions, 102 flow [2023-11-17 14:58:40,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=44, PETRI_TRANSITIONS=40} [2023-11-17 14:58:40,843 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2023-11-17 14:58:40,843 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 40 transitions, 102 flow [2023-11-17 14:58:40,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:40,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 14:58:40,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 14:58:40,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 14:58:40,844 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 14:58:40,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:58:40,844 INFO L85 PathProgramCache]: Analyzing trace with hash -848080467, now seen corresponding path program 1 times [2023-11-17 14:58:40,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:58:40,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084523054] [2023-11-17 14:58:40,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:58:40,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:58:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:58:40,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:58:40,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:58:40,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084523054] [2023-11-17 14:58:40,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084523054] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 14:58:40,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728639660] [2023-11-17 14:58:40,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:58:40,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:58:40,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:58:40,923 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 14:58:40,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-17 14:58:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:58:41,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-17 14:58:41,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 14:58:41,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:58:41,078 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 14:58:41,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:58:41,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728639660] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 14:58:41,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 14:58:41,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-17 14:58:41,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212509387] [2023-11-17 14:58:41,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 14:58:41,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 14:58:41,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 14:58:41,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 14:58:41,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-17 14:58:41,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 436 [2023-11-17 14:58:41,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 102 flow. Second operand has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:41,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 14:58:41,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 436 [2023-11-17 14:58:41,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 14:58:41,234 INFO L124 PetriNetUnfolderBase]: 234/489 cut-off events. [2023-11-17 14:58:41,235 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-11-17 14:58:41,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1109 conditions, 489 events. 234/489 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1251 event pairs, 88 based on Foata normal form. 12/467 useless extension candidates. Maximal degree in co-relation 1103. Up to 208 conditions per place. [2023-11-17 14:58:41,236 INFO L140 encePairwiseOnDemand]: 432/436 looper letters, 74 selfloop transitions, 6 changer transitions 0/82 dead transitions. [2023-11-17 14:58:41,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 82 transitions, 358 flow [2023-11-17 14:58:41,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 14:58:41,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 14:58:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1319 transitions. [2023-11-17 14:58:41,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5042048929663608 [2023-11-17 14:58:41,239 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1319 transitions. [2023-11-17 14:58:41,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1319 transitions. [2023-11-17 14:58:41,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 14:58:41,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1319 transitions. [2023-11-17 14:58:41,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 219.83333333333334) internal successors, (1319), 6 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:41,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 436.0) internal successors, (3052), 7 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:41,246 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 436.0) internal successors, (3052), 7 states have internal predecessors, (3052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:41,246 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 102 flow. Second operand 6 states and 1319 transitions. [2023-11-17 14:58:41,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 82 transitions, 358 flow [2023-11-17 14:58:41,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 82 transitions, 355 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 14:58:41,247 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 139 flow [2023-11-17 14:58:41,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=139, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-17 14:58:41,248 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 6 predicate places. [2023-11-17 14:58:41,248 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 139 flow [2023-11-17 14:58:41,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:41,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 14:58:41,249 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 14:58:41,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-17 14:58:41,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:58:41,454 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 14:58:41,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:58:41,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1964352533, now seen corresponding path program 2 times [2023-11-17 14:58:41,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:58:41,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943320427] [2023-11-17 14:58:41,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:58:41,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:58:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:58:41,657 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:58:41,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:58:41,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943320427] [2023-11-17 14:58:41,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943320427] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 14:58:41,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129496972] [2023-11-17 14:58:41,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 14:58:41,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:58:41,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:58:41,659 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 14:58:41,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-17 14:58:41,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 14:58:41,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 14:58:41,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 14:58:41,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 14:58:41,888 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:58:41,889 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 14:58:41,956 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:58:41,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129496972] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 14:58:41,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 14:58:41,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-11-17 14:58:41,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109765009] [2023-11-17 14:58:41,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 14:58:41,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-17 14:58:41,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 14:58:41,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-17 14:58:41,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-11-17 14:58:41,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 436 [2023-11-17 14:58:41,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 139 flow. Second operand has 13 states, 13 states have (on average 212.53846153846155) internal successors, (2763), 13 states have internal predecessors, (2763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:41,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 14:58:41,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 436 [2023-11-17 14:58:41,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 14:58:42,200 INFO L124 PetriNetUnfolderBase]: 420/891 cut-off events. [2023-11-17 14:58:42,200 INFO L125 PetriNetUnfolderBase]: For 205/205 co-relation queries the response was YES. [2023-11-17 14:58:42,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2205 conditions, 891 events. 420/891 cut-off events. For 205/205 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2269 event pairs, 88 based on Foata normal form. 24/857 useless extension candidates. Maximal degree in co-relation 2195. Up to 208 conditions per place. [2023-11-17 14:58:42,204 INFO L140 encePairwiseOnDemand]: 432/436 looper letters, 146 selfloop transitions, 12 changer transitions 0/160 dead transitions. [2023-11-17 14:58:42,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 160 transitions, 775 flow [2023-11-17 14:58:42,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 14:58:42,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-17 14:58:42,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2636 transitions. [2023-11-17 14:58:42,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503822629969419 [2023-11-17 14:58:42,209 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2636 transitions. [2023-11-17 14:58:42,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2636 transitions. [2023-11-17 14:58:42,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 14:58:42,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2636 transitions. [2023-11-17 14:58:42,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 219.66666666666666) internal successors, (2636), 12 states have internal predecessors, (2636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:42,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 436.0) internal successors, (5668), 13 states have internal predecessors, (5668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:42,219 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 436.0) internal successors, (5668), 13 states have internal predecessors, (5668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:42,219 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 139 flow. Second operand 12 states and 2636 transitions. [2023-11-17 14:58:42,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 160 transitions, 775 flow [2023-11-17 14:58:42,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 160 transitions, 755 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-11-17 14:58:42,223 INFO L231 Difference]: Finished difference. Result has 69 places, 50 transitions, 227 flow [2023-11-17 14:58:42,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=227, PETRI_PLACES=69, PETRI_TRANSITIONS=50} [2023-11-17 14:58:42,224 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 23 predicate places. [2023-11-17 14:58:42,224 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 50 transitions, 227 flow [2023-11-17 14:58:42,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 212.53846153846155) internal successors, (2763), 13 states have internal predecessors, (2763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:42,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 14:58:42,225 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 14:58:42,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-17 14:58:42,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-17 14:58:42,431 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 14:58:42,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:58:42,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1491181205, now seen corresponding path program 3 times [2023-11-17 14:58:42,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:58:42,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772745564] [2023-11-17 14:58:42,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:58:42,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:58:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:58:42,725 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:58:42,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:58:42,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772745564] [2023-11-17 14:58:42,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772745564] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 14:58:42,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416998693] [2023-11-17 14:58:42,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 14:58:42,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:58:42,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:58:42,741 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 14:58:42,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-17 14:58:43,182 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-17 14:58:43,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 14:58:43,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-17 14:58:43,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 14:58:43,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-17 14:58:43,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 14:58:43,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 14:58:43,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-17 14:58:43,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-17 14:58:43,633 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2023-11-17 14:58:43,633 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-17 14:58:43,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416998693] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 14:58:43,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-17 14:58:43,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 18 [2023-11-17 14:58:43,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019997323] [2023-11-17 14:58:43,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 14:58:43,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 14:58:43,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 14:58:43,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 14:58:43,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-11-17 14:58:43,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 436 [2023-11-17 14:58:43,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 50 transitions, 227 flow. Second operand has 7 states, 7 states have (on average 169.71428571428572) internal successors, (1188), 7 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:43,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 14:58:43,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 436 [2023-11-17 14:58:43,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 14:58:43,897 INFO L124 PetriNetUnfolderBase]: 711/1538 cut-off events. [2023-11-17 14:58:43,897 INFO L125 PetriNetUnfolderBase]: For 710/710 co-relation queries the response was YES. [2023-11-17 14:58:43,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4048 conditions, 1538 events. 711/1538 cut-off events. For 710/710 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 5199 event pairs, 144 based on Foata normal form. 0/1474 useless extension candidates. Maximal degree in co-relation 4031. Up to 548 conditions per place. [2023-11-17 14:58:43,903 INFO L140 encePairwiseOnDemand]: 428/436 looper letters, 79 selfloop transitions, 15 changer transitions 0/95 dead transitions. [2023-11-17 14:58:43,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 95 transitions, 627 flow [2023-11-17 14:58:43,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 14:58:43,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 14:58:43,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1221 transitions. [2023-11-17 14:58:43,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40006553079947577 [2023-11-17 14:58:43,906 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1221 transitions. [2023-11-17 14:58:43,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1221 transitions. [2023-11-17 14:58:43,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 14:58:43,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1221 transitions. [2023-11-17 14:58:43,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 174.42857142857142) internal successors, (1221), 7 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:43,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 436.0) internal successors, (3488), 8 states have internal predecessors, (3488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:43,912 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 436.0) internal successors, (3488), 8 states have internal predecessors, (3488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:43,913 INFO L175 Difference]: Start difference. First operand has 69 places, 50 transitions, 227 flow. Second operand 7 states and 1221 transitions. [2023-11-17 14:58:43,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 95 transitions, 627 flow [2023-11-17 14:58:43,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 95 transitions, 616 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 14:58:43,916 INFO L231 Difference]: Finished difference. Result has 75 places, 60 transitions, 311 flow [2023-11-17 14:58:43,917 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=311, PETRI_PLACES=75, PETRI_TRANSITIONS=60} [2023-11-17 14:58:43,917 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 29 predicate places. [2023-11-17 14:58:43,917 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 60 transitions, 311 flow [2023-11-17 14:58:43,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 169.71428571428572) internal successors, (1188), 7 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:43,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 14:58:43,918 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 14:58:43,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-17 14:58:44,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:58:44,125 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 14:58:44,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:58:44,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1833332481, now seen corresponding path program 1 times [2023-11-17 14:58:44,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:58:44,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857302542] [2023-11-17 14:58:44,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:58:44,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:58:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:58:44,380 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:58:44,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:58:44,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857302542] [2023-11-17 14:58:44,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857302542] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 14:58:44,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019143437] [2023-11-17 14:58:44,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:58:44,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:58:44,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:58:44,397 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 14:58:44,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-17 14:58:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:58:44,606 INFO L262 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-17 14:58:44,609 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 14:58:44,691 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:58:44,691 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 14:58:44,919 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:58:44,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019143437] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 14:58:44,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 14:58:44,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2023-11-17 14:58:44,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548577220] [2023-11-17 14:58:44,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 14:58:44,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-17 14:58:44,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 14:58:44,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-17 14:58:44,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2023-11-17 14:58:44,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 436 [2023-11-17 14:58:44,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 60 transitions, 311 flow. Second operand has 25 states, 25 states have (on average 213.12) internal successors, (5328), 25 states have internal predecessors, (5328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:44,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 14:58:44,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 436 [2023-11-17 14:58:44,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 14:58:45,599 INFO L124 PetriNetUnfolderBase]: 1359/3002 cut-off events. [2023-11-17 14:58:45,599 INFO L125 PetriNetUnfolderBase]: For 4608/4608 co-relation queries the response was YES. [2023-11-17 14:58:45,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9649 conditions, 3002 events. 1359/3002 cut-off events. For 4608/4608 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 10282 event pairs, 130 based on Foata normal form. 96/3074 useless extension candidates. Maximal degree in co-relation 9628. Up to 414 conditions per place. [2023-11-17 14:58:45,614 INFO L140 encePairwiseOnDemand]: 432/436 looper letters, 441 selfloop transitions, 25 changer transitions 0/468 dead transitions. [2023-11-17 14:58:45,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 468 transitions, 3178 flow [2023-11-17 14:58:45,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-17 14:58:45,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-11-17 14:58:45,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 5270 transitions. [2023-11-17 14:58:45,622 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503631498470948 [2023-11-17 14:58:45,622 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 5270 transitions. [2023-11-17 14:58:45,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 5270 transitions. [2023-11-17 14:58:45,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 14:58:45,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 5270 transitions. [2023-11-17 14:58:45,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 219.58333333333334) internal successors, (5270), 24 states have internal predecessors, (5270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:45,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 436.0) internal successors, (10900), 25 states have internal predecessors, (10900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:45,642 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 436.0) internal successors, (10900), 25 states have internal predecessors, (10900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:45,642 INFO L175 Difference]: Start difference. First operand has 75 places, 60 transitions, 311 flow. Second operand 24 states and 5270 transitions. [2023-11-17 14:58:45,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 468 transitions, 3178 flow [2023-11-17 14:58:45,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 468 transitions, 3177 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 14:58:45,652 INFO L231 Difference]: Finished difference. Result has 110 places, 74 transitions, 564 flow [2023-11-17 14:58:45,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=564, PETRI_PLACES=110, PETRI_TRANSITIONS=74} [2023-11-17 14:58:45,652 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 64 predicate places. [2023-11-17 14:58:45,652 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 74 transitions, 564 flow [2023-11-17 14:58:45,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 213.12) internal successors, (5328), 25 states have internal predecessors, (5328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:45,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 14:58:45,654 INFO L208 CegarLoopForPetriNet]: trace histogram [22, 22, 22, 22, 22, 12, 12, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 14:58:45,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-17 14:58:45,860 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-11-17 14:58:45,860 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 14:58:45,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:58:45,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1854385177, now seen corresponding path program 2 times [2023-11-17 14:58:45,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:58:45,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587622940] [2023-11-17 14:58:45,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:58:45,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:58:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:58:46,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 0 proven. 1564 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:58:46,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:58:46,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587622940] [2023-11-17 14:58:46,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587622940] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 14:58:46,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964134498] [2023-11-17 14:58:46,724 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 14:58:46,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:58:46,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:58:46,725 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 14:58:46,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-17 14:58:47,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 14:58:47,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 14:58:47,073 INFO L262 TraceCheckSpWp]: Trace formula consists of 1191 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-17 14:58:47,078 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 14:58:47,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 0 proven. 1564 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:58:47,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 14:58:47,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 0 proven. 1564 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:58:47,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964134498] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 14:58:47,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 14:58:47,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2023-11-17 14:58:47,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758065527] [2023-11-17 14:58:47,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 14:58:47,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-17 14:58:47,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 14:58:47,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-17 14:58:47,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2023-11-17 14:58:47,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 436 [2023-11-17 14:58:47,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 74 transitions, 564 flow. Second operand has 49 states, 49 states have (on average 213.3265306122449) internal successors, (10453), 49 states have internal predecessors, (10453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:47,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 14:58:47,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 436 [2023-11-17 14:58:47,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 14:58:50,014 INFO L124 PetriNetUnfolderBase]: 2679/5954 cut-off events. [2023-11-17 14:58:50,014 INFO L125 PetriNetUnfolderBase]: For 40801/40801 co-relation queries the response was YES. [2023-11-17 14:58:50,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20829 conditions, 5954 events. 2679/5954 cut-off events. For 40801/40801 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 20507 event pairs, 130 based on Foata normal form. 192/6122 useless extension candidates. Maximal degree in co-relation 20796. Up to 822 conditions per place. [2023-11-17 14:58:50,138 INFO L140 encePairwiseOnDemand]: 432/436 looper letters, 897 selfloop transitions, 49 changer transitions 0/948 dead transitions. [2023-11-17 14:58:50,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 948 transitions, 7001 flow [2023-11-17 14:58:50,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-11-17 14:58:50,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-11-17 14:58:50,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 10538 transitions. [2023-11-17 14:58:50,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035359327217125 [2023-11-17 14:58:50,162 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 10538 transitions. [2023-11-17 14:58:50,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 10538 transitions. [2023-11-17 14:58:50,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 14:58:50,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 10538 transitions. [2023-11-17 14:58:50,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 219.54166666666666) internal successors, (10538), 48 states have internal predecessors, (10538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:50,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 436.0) internal successors, (21364), 49 states have internal predecessors, (21364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:50,202 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 436.0) internal successors, (21364), 49 states have internal predecessors, (21364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:50,202 INFO L175 Difference]: Start difference. First operand has 110 places, 74 transitions, 564 flow. Second operand 48 states and 10538 transitions. [2023-11-17 14:58:50,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 948 transitions, 7001 flow [2023-11-17 14:58:50,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 948 transitions, 6983 flow, removed 0 selfloop flow, removed 9 redundant places. [2023-11-17 14:58:50,241 INFO L231 Difference]: Finished difference. Result has 173 places, 100 transitions, 1120 flow [2023-11-17 14:58:50,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=1120, PETRI_PLACES=173, PETRI_TRANSITIONS=100} [2023-11-17 14:58:50,242 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 127 predicate places. [2023-11-17 14:58:50,242 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 100 transitions, 1120 flow [2023-11-17 14:58:50,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 213.3265306122449) internal successors, (10453), 49 states have internal predecessors, (10453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:50,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 14:58:50,245 INFO L208 CegarLoopForPetriNet]: trace histogram [46, 46, 46, 46, 46, 24, 24, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 14:58:50,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-17 14:58:50,451 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-11-17 14:58:50,451 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 14:58:50,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 14:58:50,451 INFO L85 PathProgramCache]: Analyzing trace with hash 855142887, now seen corresponding path program 3 times [2023-11-17 14:58:50,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 14:58:50,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360320104] [2023-11-17 14:58:50,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 14:58:50,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 14:58:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 14:58:53,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6994 backedges. 0 proven. 6994 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 14:58:53,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 14:58:53,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360320104] [2023-11-17 14:58:53,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360320104] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 14:58:53,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537140958] [2023-11-17 14:58:53,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 14:58:53,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 14:58:53,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 14:58:53,160 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 14:58:53,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-17 14:58:53,951 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-17 14:58:53,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 14:58:53,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-17 14:58:53,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 14:58:55,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-17 14:58:55,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 14:58:55,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 14:58:55,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 14:58:55,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-17 14:58:55,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-17 14:58:55,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2023-11-17 14:58:55,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 14:58:55,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 14:58:55,470 INFO L349 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-11-17 14:58:55,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2023-11-17 14:58:55,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-17 14:58:55,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6994 backedges. 656 proven. 226 refuted. 0 times theorem prover too weak. 6112 trivial. 0 not checked. [2023-11-17 14:58:55,524 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 14:58:55,660 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1878 (Array Int Int))) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1878) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1)) 800)) is different from false [2023-11-17 14:58:55,676 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1878 (Array Int Int)) (v_ArrVal_1877 Int)) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_1877)) |c_~#stored_elements~0.base| v_ArrVal_1878) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1)) 800) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| 1) v_ArrVal_1877))) is different from false [2023-11-17 14:58:55,686 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1878 (Array Int Int)) (v_ArrVal_1877 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse2 .cse3 v_ArrVal_1877)) |c_~#stored_elements~0.base| v_ArrVal_1878) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1)) 800) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1877)))) is different from false [2023-11-17 14:58:55,710 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1878 (Array Int Int)) (v_ArrVal_1877 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse3 v_ArrVal_1877)) |c_~#stored_elements~0.base| v_ArrVal_1878) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1)) 800) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1877)))) is different from false [2023-11-17 14:58:55,732 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1878 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_160| Int) (v_ArrVal_1877 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1877) (< (let ((.cse3 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 v_ArrVal_1877)) |c_~#stored_elements~0.base| v_ArrVal_1878) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_160|)) .cse3)) 800)))) is different from false [2023-11-17 14:58:55,861 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_1878 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_177| Int) (v_ArrVal_1873 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_160| Int) (v_ArrVal_1877 Int) (|t1Thread1of1ForFork1_enqueue_#t~post38#1| Int)) (let ((.cse3 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1873) |c_~#queue~0.base|))) (let ((.cse2 (store .cse3 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_177| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 (+ 3208 |c_~#queue~0.offset|) (+ |t1Thread1of1ForFork1_enqueue_#t~post38#1| 1)) .cse1 v_ArrVal_1877)) |c_~#stored_elements~0.base| v_ArrVal_1878) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_160|)) .cse1) 800) (< (+ (select .cse2 .cse1) 1) v_ArrVal_1877) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_177|))))) is different from false [2023-11-17 14:58:55,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:58:55,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 126 [2023-11-17 14:58:55,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:58:55,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 184 [2023-11-17 14:58:55,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2023-11-17 14:58:55,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2023-11-17 14:58:55,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-17 14:58:55,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 14:58:55,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 73 [2023-11-17 14:58:58,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6994 backedges. 308 proven. 221 refuted. 44 times theorem prover too weak. 6112 trivial. 309 not checked. [2023-11-17 14:58:58,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537140958] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 14:58:58,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 14:58:58,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 11, 13] total 71 [2023-11-17 14:58:58,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348577301] [2023-11-17 14:58:58,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 14:58:58,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-11-17 14:58:58,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 14:58:58,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-11-17 14:58:58,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1283, Invalid=2894, Unknown=7, NotChecked=786, Total=4970 [2023-11-17 14:58:58,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 436 [2023-11-17 14:58:58,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 100 transitions, 1120 flow. Second operand has 71 states, 71 states have (on average 162.1549295774648) internal successors, (11513), 71 states have internal predecessors, (11513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 14:58:58,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 14:58:58,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 436 [2023-11-17 14:58:58,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:00:11,513 INFO L124 PetriNetUnfolderBase]: 5105/11590 cut-off events. [2023-11-17 15:00:11,513 INFO L125 PetriNetUnfolderBase]: For 47310/47310 co-relation queries the response was YES. [2023-11-17 15:00:11,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41862 conditions, 11590 events. 5105/11590 cut-off events. For 47310/47310 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 52453 event pairs, 113 based on Foata normal form. 378/11932 useless extension candidates. Maximal degree in co-relation 41804. Up to 1678 conditions per place. [2023-11-17 15:00:11,595 INFO L140 encePairwiseOnDemand]: 422/436 looper letters, 2034 selfloop transitions, 1484 changer transitions 0/3519 dead transitions. [2023-11-17 15:00:11,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 788 places, 3519 transitions, 23581 flow [2023-11-17 15:00:11,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 616 states. [2023-11-17 15:00:11,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2023-11-17 15:00:11,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 99711 transitions. [2023-11-17 15:00:11,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3712580424162993 [2023-11-17 15:00:11,835 INFO L72 ComplementDD]: Start complementDD. Operand 616 states and 99711 transitions. [2023-11-17 15:00:11,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 616 states and 99711 transitions. [2023-11-17 15:00:11,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:00:11,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 616 states and 99711 transitions. [2023-11-17 15:00:11,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 617 states, 616 states have (on average 161.8685064935065) internal successors, (99711), 616 states have internal predecessors, (99711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:00:12,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 617 states, 617 states have (on average 436.0) internal successors, (269012), 617 states have internal predecessors, (269012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:00:12,259 INFO L81 ComplementDD]: Finished complementDD. Result has 617 states, 617 states have (on average 436.0) internal successors, (269012), 617 states have internal predecessors, (269012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:00:12,259 INFO L175 Difference]: Start difference. First operand has 173 places, 100 transitions, 1120 flow. Second operand 616 states and 99711 transitions. [2023-11-17 15:00:12,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 788 places, 3519 transitions, 23581 flow [2023-11-17 15:00:12,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 767 places, 3519 transitions, 23419 flow, removed 0 selfloop flow, removed 21 redundant places. [2023-11-17 15:00:12,506 INFO L231 Difference]: Finished difference. Result has 957 places, 1660 transitions, 15791 flow [2023-11-17 15:00:12,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=1078, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=616, PETRI_FLOW=15791, PETRI_PLACES=957, PETRI_TRANSITIONS=1660} [2023-11-17 15:00:12,507 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 911 predicate places. [2023-11-17 15:00:12,507 INFO L495 AbstractCegarLoop]: Abstraction has has 957 places, 1660 transitions, 15791 flow [2023-11-17 15:00:12,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 162.1549295774648) internal successors, (11513), 71 states have internal predecessors, (11513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:00:12,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:00:12,510 INFO L208 CegarLoopForPetriNet]: trace histogram [47, 47, 47, 47, 47, 34, 34, 34, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:00:12,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-17 15:00:12,710 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-11-17 15:00:12,710 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:00:12,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:00:12,711 INFO L85 PathProgramCache]: Analyzing trace with hash -679607889, now seen corresponding path program 4 times [2023-11-17 15:00:12,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:00:12,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598168096] [2023-11-17 15:00:12,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:00:12,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:00:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:00:15,483 INFO L134 CoverageAnalysis]: Checked inductivity of 7733 backedges. 0 proven. 7733 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:00:15,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:00:15,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598168096] [2023-11-17 15:00:15,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598168096] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 15:00:15,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019526140] [2023-11-17 15:00:15,484 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 15:00:15,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:00:15,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:00:15,485 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 15:00:15,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process Received shutdown request... [2023-11-17 15:07:59,655 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 15:07:59,677 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 15:08:00,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2023-11-17 15:08:00,856 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forcibly destroying the process [2023-11-17 15:08:00,870 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-17 15:08:00,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-11-17 15:08:00,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2023-11-17 15:08:00,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969805905] [2023-11-17 15:08:00,870 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-11-17 15:08:00,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-17 15:08:00,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:08:00,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-17 15:08:00,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2023-11-17 15:08:00,886 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 436 [2023-11-17 15:08:00,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 957 places, 1660 transitions, 15791 flow. Second operand has 50 states, 50 states have (on average 213.62) internal successors, (10681), 50 states have internal predecessors, (10681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:08:00,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:08:00,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 436 [2023-11-17 15:08:00,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 137 [2023-11-17 15:08:00,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:08:00,901 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-17 15:08:00,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 15:08:00,902 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-11-17 15:08:00,903 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-11-17 15:08:00,903 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-17 15:08:00,903 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-17 15:08:00,903 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-11-17 15:08:00,903 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1] [2023-11-17 15:08:00,906 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:08:00,906 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:08:00,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:08:00 BasicIcfg [2023-11-17 15:08:00,908 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:08:00,908 INFO L158 Benchmark]: Toolchain (without parser) took 568088.47ms. Allocated memory was 219.2MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 154.6MB in the beginning and 409.8MB in the end (delta: -255.2MB). Peak memory consumption was 878.4MB. Max. memory is 8.0GB. [2023-11-17 15:08:00,914 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 219.2MB. Free memory is still 170.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:08:00,914 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.71ms. Allocated memory was 219.2MB in the beginning and 332.4MB in the end (delta: 113.2MB). Free memory was 154.4MB in the beginning and 285.6MB in the end (delta: -131.3MB). Peak memory consumption was 24.7MB. Max. memory is 8.0GB. [2023-11-17 15:08:00,914 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.58ms. Allocated memory is still 332.4MB. Free memory was 285.6MB in the beginning and 282.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 15:08:00,914 INFO L158 Benchmark]: Boogie Preprocessor took 37.54ms. Allocated memory is still 332.4MB. Free memory was 282.5MB in the beginning and 280.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:08:00,915 INFO L158 Benchmark]: RCFGBuilder took 443.84ms. Allocated memory is still 332.4MB. Free memory was 280.4MB in the beginning and 257.8MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-11-17 15:08:00,916 INFO L158 Benchmark]: TraceAbstraction took 567020.00ms. Allocated memory was 332.4MB in the beginning and 1.4GB in the end (delta: 1.0GB). Free memory was 257.3MB in the beginning and 409.8MB in the end (delta: -152.5MB). Peak memory consumption was 867.3MB. Max. memory is 8.0GB. [2023-11-17 15:08:00,920 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 219.2MB. Free memory is still 170.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 526.71ms. Allocated memory was 219.2MB in the beginning and 332.4MB in the end (delta: 113.2MB). Free memory was 154.4MB in the beginning and 285.6MB in the end (delta: -131.3MB). Peak memory consumption was 24.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.58ms. Allocated memory is still 332.4MB. Free memory was 285.6MB in the beginning and 282.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.54ms. Allocated memory is still 332.4MB. Free memory was 282.5MB in the beginning and 280.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 443.84ms. Allocated memory is still 332.4MB. Free memory was 280.4MB in the beginning and 257.8MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 567020.00ms. Allocated memory was 332.4MB in the beginning and 1.4GB in the end (delta: 1.0GB). Free memory was 257.3MB in the beginning and 409.8MB in the end (delta: -152.5MB). Peak memory consumption was 867.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 210 PlacesBefore, 46 PlacesAfterwards, 216 TransitionsBefore, 46 TransitionsAfterwards, 11116 CoEnabledTransitionPairs, 8 FixpointIterations, 62 TrivialSequentialCompositions, 112 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 20 ConcurrentYvCompositions, 6 ChoiceCompositions, 208 TotalNumberOfCompositions, 21569 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11762, independent: 11293, independent conditional: 0, independent unconditional: 11293, dependent: 469, dependent conditional: 0, dependent unconditional: 469, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7526, independent: 7396, independent conditional: 0, independent unconditional: 7396, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7526, independent: 7379, independent conditional: 0, independent unconditional: 7379, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 147, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 130, dependent conditional: 0, dependent unconditional: 130, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 162, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11762, independent: 3897, independent conditional: 0, independent unconditional: 3897, dependent: 339, dependent conditional: 0, dependent unconditional: 339, unknown: 7526, unknown conditional: 0, unknown unconditional: 7526] , Statistics on independence cache: Total cache size (in pairs): 423, Positive cache size: 374, Positive conditional cache size: 0, Positive unconditional cache size: 374, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 347 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: 566.9s, OverallIterations: 11, TraceHistogramMax: 47, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 78.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7072 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7072 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 20402 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 435 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3515 IncrementalHoareTripleChecker+Invalid, 24353 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 435 mSolverCounterUnsat, 1 mSDtfsCounter, 3515 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2758 GetRequests, 1646 SyntacticMatches, 282 SemanticMatches, 830 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 342714 ImplicationChecksByTransitivity, 68.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15791occurred in iteration=10, InterpolantAutomatonStates: 724, 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.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 13.2s InterpolantComputationTime, 2058 NumberOfCodeBlocks, 1694 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2753 ConstructedInterpolants, 11 QuantifiedInterpolants, 11900 SizeOfPredicates, 19 NumberOfNonLiveVariables, 3222 ConjunctsInSsa, 171 ConjunctsInUnsatCore, 22 InterpolantComputations, 5 PerfectInterpolantSequences, 13514/35120 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