/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 04:42:19,609 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 04:42:19,682 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 04:42:19,689 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 04:42:19,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 04:42:19,721 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 04:42:19,721 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 04:42:19,722 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 04:42:19,722 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 04:42:19,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 04:42:19,726 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 04:42:19,726 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 04:42:19,727 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 04:42:19,728 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 04:42:19,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 04:42:19,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 04:42:19,729 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 04:42:19,729 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 04:42:19,729 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 04:42:19,729 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 04:42:19,729 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 04:42:19,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 04:42:19,730 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 04:42:19,731 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 04:42:19,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 04:42:19,731 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 04:42:19,732 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 04:42:19,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 04:42:19,732 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 04:42:19,732 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 04:42:19,733 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 04:42:19,733 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 04:42:19,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 04:42:19,734 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 04:42:19,734 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 04:42:19,734 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-24 04:42:20,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 04:42:20,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 04:42:20,057 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 04:42:20,058 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 04:42:20,059 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 04:42:20,060 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-2.i [2023-08-24 04:42:21,317 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 04:42:21,587 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 04:42:21,587 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-2.i [2023-08-24 04:42:21,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ab740e9/1f42bb2963874518b1ede60d91ea01b3/FLAGe0314cfcd [2023-08-24 04:42:21,612 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17ab740e9/1f42bb2963874518b1ede60d91ea01b3 [2023-08-24 04:42:21,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 04:42:21,615 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 04:42:21,616 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 04:42:21,616 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 04:42:21,619 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 04:42:21,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 04:42:21" (1/1) ... [2023-08-24 04:42:21,620 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@422bd7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:42:21, skipping insertion in model container [2023-08-24 04:42:21,620 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 04:42:21" (1/1) ... [2023-08-24 04:42:21,664 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 04:42:21,982 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/stack-2.i[41520,41533] [2023-08-24 04:42:21,999 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 04:42:22,010 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 04:42:22,025 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [261] [2023-08-24 04:42:22,027 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [261] [2023-08-24 04:42:22,037 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [753] [2023-08-24 04:42:22,043 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/stack-2.i[41520,41533] [2023-08-24 04:42:22,051 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 04:42:22,105 INFO L206 MainTranslator]: Completed translation [2023-08-24 04:42:22,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:42:22 WrapperNode [2023-08-24 04:42:22,105 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 04:42:22,106 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 04:42:22,106 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 04:42:22,106 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 04:42:22,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:42:22" (1/1) ... [2023-08-24 04:42:22,127 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:42:22" (1/1) ... [2023-08-24 04:42:22,149 INFO L138 Inliner]: procedures = 277, calls = 44, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 160 [2023-08-24 04:42:22,149 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 04:42:22,150 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 04:42:22,150 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 04:42:22,150 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 04:42:22,157 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:42:22" (1/1) ... [2023-08-24 04:42:22,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:42:22" (1/1) ... [2023-08-24 04:42:22,161 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:42:22" (1/1) ... [2023-08-24 04:42:22,161 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:42:22" (1/1) ... [2023-08-24 04:42:22,166 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:42:22" (1/1) ... [2023-08-24 04:42:22,170 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:42:22" (1/1) ... [2023-08-24 04:42:22,171 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:42:22" (1/1) ... [2023-08-24 04:42:22,172 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:42:22" (1/1) ... [2023-08-24 04:42:22,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 04:42:22,176 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 04:42:22,176 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 04:42:22,176 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 04:42:22,177 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:42:22" (1/1) ... [2023-08-24 04:42:22,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 04:42:22,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 04:42:22,206 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 04:42:22,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 04:42:22,236 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-24 04:42:22,236 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-24 04:42:22,236 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-24 04:42:22,237 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-24 04:42:22,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 04:42:22,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 04:42:22,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 04:42:22,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 04:42:22,237 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-24 04:42:22,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 04:42:22,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 04:42:22,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 04:42:22,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 04:42:22,239 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 04:42:22,381 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 04:42:22,382 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 04:42:22,685 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 04:42:22,696 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 04:42:22,697 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-24 04:42:22,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 04:42:22 BoogieIcfgContainer [2023-08-24 04:42:22,698 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 04:42:22,700 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 04:42:22,700 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 04:42:22,703 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 04:42:22,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 04:42:21" (1/3) ... [2023-08-24 04:42:22,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5977eab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 04:42:22, skipping insertion in model container [2023-08-24 04:42:22,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 04:42:22" (2/3) ... [2023-08-24 04:42:22,705 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5977eab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 04:42:22, skipping insertion in model container [2023-08-24 04:42:22,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 04:42:22" (3/3) ... [2023-08-24 04:42:22,706 INFO L112 eAbstractionObserver]: Analyzing ICFG stack-2.i [2023-08-24 04:42:22,717 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 04:42:22,717 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 04:42:22,717 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 04:42:22,832 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-24 04:42:22,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 162 transitions, 340 flow [2023-08-24 04:42:22,935 INFO L124 PetriNetUnfolderBase]: 10/160 cut-off events. [2023-08-24 04:42:22,935 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 04:42:22,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 160 events. 10/160 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 379 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 118. Up to 3 conditions per place. [2023-08-24 04:42:22,943 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 162 transitions, 340 flow [2023-08-24 04:42:22,948 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 151 transitions, 311 flow [2023-08-24 04:42:22,953 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 04:42:22,960 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 151 transitions, 311 flow [2023-08-24 04:42:22,963 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 151 transitions, 311 flow [2023-08-24 04:42:22,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 151 transitions, 311 flow [2023-08-24 04:42:23,008 INFO L124 PetriNetUnfolderBase]: 10/151 cut-off events. [2023-08-24 04:42:23,009 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-24 04:42:23,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 151 events. 10/151 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 311 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 118. Up to 3 conditions per place. [2023-08-24 04:42:23,019 INFO L119 LiptonReduction]: Number of co-enabled transitions 7334 [2023-08-24 04:42:26,741 INFO L134 LiptonReduction]: Checked pairs total: 9688 [2023-08-24 04:42:26,741 INFO L136 LiptonReduction]: Total number of compositions: 141 [2023-08-24 04:42:26,753 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 04:42:26,757 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@42470c07, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 04:42:26,758 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-24 04:42:26,761 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 04:42:26,761 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-08-24 04:42:26,762 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-24 04:42:26,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 04:42:26,762 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-24 04:42:26,763 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 04:42:26,767 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 04:42:26,767 INFO L85 PathProgramCache]: Analyzing trace with hash 2091505467, now seen corresponding path program 1 times [2023-08-24 04:42:26,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 04:42:26,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515063940] [2023-08-24 04:42:26,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 04:42:26,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 04:42:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 04:42:27,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 04:42:27,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 04:42:27,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515063940] [2023-08-24 04:42:27,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515063940] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 04:42:27,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 04:42:27,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 04:42:27,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157114733] [2023-08-24 04:42:27,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 04:42:27,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 04:42:27,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 04:42:27,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 04:42:27,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 04:42:27,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 303 [2023-08-24 04:42:27,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:27,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 04:42:27,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 303 [2023-08-24 04:42:27,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 04:42:27,245 INFO L124 PetriNetUnfolderBase]: 917/1474 cut-off events. [2023-08-24 04:42:27,246 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-08-24 04:42:27,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3012 conditions, 1474 events. 917/1474 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6122 event pairs, 270 based on Foata normal form. 0/1164 useless extension candidates. Maximal degree in co-relation 2788. Up to 840 conditions per place. [2023-08-24 04:42:27,256 INFO L140 encePairwiseOnDemand]: 298/303 looper letters, 57 selfloop transitions, 4 changer transitions 0/61 dead transitions. [2023-08-24 04:42:27,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 61 transitions, 259 flow [2023-08-24 04:42:27,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 04:42:27,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 04:42:27,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2023-08-24 04:42:27,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5335533553355336 [2023-08-24 04:42:27,274 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 485 transitions. [2023-08-24 04:42:27,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 485 transitions. [2023-08-24 04:42:27,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 04:42:27,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 485 transitions. [2023-08-24 04:42:27,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:27,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:27,288 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:27,290 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 75 flow. Second operand 3 states and 485 transitions. [2023-08-24 04:42:27,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 61 transitions, 259 flow [2023-08-24 04:42:27,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 61 transitions, 251 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-24 04:42:27,295 INFO L231 Difference]: Finished difference. Result has 36 places, 36 transitions, 100 flow [2023-08-24 04:42:27,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=36, PETRI_TRANSITIONS=36} [2023-08-24 04:42:27,299 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2023-08-24 04:42:27,300 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 36 transitions, 100 flow [2023-08-24 04:42:27,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:27,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 04:42:27,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 04:42:27,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 04:42:27,301 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 04:42:27,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 04:42:27,302 INFO L85 PathProgramCache]: Analyzing trace with hash 985591015, now seen corresponding path program 1 times [2023-08-24 04:42:27,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 04:42:27,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511461608] [2023-08-24 04:42:27,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 04:42:27,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 04:42:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 04:42:27,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 04:42:27,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 04:42:27,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511461608] [2023-08-24 04:42:27,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511461608] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 04:42:27,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 04:42:27,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 04:42:27,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417107636] [2023-08-24 04:42:27,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 04:42:27,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 04:42:27,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 04:42:27,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 04:42:27,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 04:42:27,465 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 303 [2023-08-24 04:42:27,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 36 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:27,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 04:42:27,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 303 [2023-08-24 04:42:27,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 04:42:27,676 INFO L124 PetriNetUnfolderBase]: 897/1480 cut-off events. [2023-08-24 04:42:27,676 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2023-08-24 04:42:27,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3209 conditions, 1480 events. 897/1480 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 6152 event pairs, 398 based on Foata normal form. 0/1228 useless extension candidates. Maximal degree in co-relation 2952. Up to 1184 conditions per place. [2023-08-24 04:42:27,683 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 48 selfloop transitions, 2 changer transitions 3/54 dead transitions. [2023-08-24 04:42:27,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 54 transitions, 249 flow [2023-08-24 04:42:27,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 04:42:27,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 04:42:27,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 492 transitions. [2023-08-24 04:42:27,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5412541254125413 [2023-08-24 04:42:27,686 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 492 transitions. [2023-08-24 04:42:27,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 492 transitions. [2023-08-24 04:42:27,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 04:42:27,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 492 transitions. [2023-08-24 04:42:27,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:27,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:27,691 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:27,691 INFO L175 Difference]: Start difference. First operand has 36 places, 36 transitions, 100 flow. Second operand 3 states and 492 transitions. [2023-08-24 04:42:27,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 54 transitions, 249 flow [2023-08-24 04:42:27,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 54 transitions, 239 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 04:42:27,694 INFO L231 Difference]: Finished difference. Result has 37 places, 37 transitions, 104 flow [2023-08-24 04:42:27,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=37, PETRI_TRANSITIONS=37} [2023-08-24 04:42:27,695 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2023-08-24 04:42:27,695 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 37 transitions, 104 flow [2023-08-24 04:42:27,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:27,695 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 04:42:27,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 04:42:27,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 04:42:27,696 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 04:42:27,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 04:42:27,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1796788492, now seen corresponding path program 1 times [2023-08-24 04:42:27,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 04:42:27,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70041720] [2023-08-24 04:42:27,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 04:42:27,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 04:42:27,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 04:42:27,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 04:42:27,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 04:42:27,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70041720] [2023-08-24 04:42:27,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70041720] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 04:42:27,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 04:42:27,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 04:42:27,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957107957] [2023-08-24 04:42:27,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 04:42:27,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 04:42:27,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 04:42:27,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 04:42:27,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 04:42:27,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 303 [2023-08-24 04:42:27,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 37 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:27,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 04:42:27,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 303 [2023-08-24 04:42:27,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 04:42:27,938 INFO L124 PetriNetUnfolderBase]: 953/1566 cut-off events. [2023-08-24 04:42:27,938 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-08-24 04:42:27,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3478 conditions, 1566 events. 953/1566 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6650 event pairs, 659 based on Foata normal form. 56/1460 useless extension candidates. Maximal degree in co-relation 3214. Up to 1397 conditions per place. [2023-08-24 04:42:27,946 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 52 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2023-08-24 04:42:27,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 57 transitions, 270 flow [2023-08-24 04:42:27,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 04:42:27,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 04:42:27,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2023-08-24 04:42:27,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5346534653465347 [2023-08-24 04:42:27,949 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 486 transitions. [2023-08-24 04:42:27,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 486 transitions. [2023-08-24 04:42:27,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 04:42:27,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 486 transitions. [2023-08-24 04:42:27,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:27,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:27,953 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:27,953 INFO L175 Difference]: Start difference. First operand has 37 places, 37 transitions, 104 flow. Second operand 3 states and 486 transitions. [2023-08-24 04:42:27,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 57 transitions, 270 flow [2023-08-24 04:42:27,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 57 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 04:42:27,955 INFO L231 Difference]: Finished difference. Result has 39 places, 38 transitions, 122 flow [2023-08-24 04:42:27,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=39, PETRI_TRANSITIONS=38} [2023-08-24 04:42:27,956 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2023-08-24 04:42:27,956 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 38 transitions, 122 flow [2023-08-24 04:42:27,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:27,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 04:42:27,956 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 04:42:27,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 04:42:27,957 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 04:42:27,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 04:42:27,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1638577751, now seen corresponding path program 1 times [2023-08-24 04:42:27,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 04:42:27,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501581813] [2023-08-24 04:42:27,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 04:42:27,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 04:42:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 04:42:28,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 04:42:28,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 04:42:28,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501581813] [2023-08-24 04:42:28,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501581813] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 04:42:28,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294892270] [2023-08-24 04:42:28,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 04:42:28,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 04:42:28,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 04:42:28,065 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 04:42:28,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-24 04:42:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 04:42:28,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-24 04:42:28,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 04:42:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 04:42:28,223 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 04:42:28,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 04:42:28,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294892270] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 04:42:28,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 04:42:28,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-08-24 04:42:28,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549979907] [2023-08-24 04:42:28,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 04:42:28,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 04:42:28,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 04:42:28,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 04:42:28,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-24 04:42:28,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 303 [2023-08-24 04:42:28,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 38 transitions, 122 flow. Second operand has 8 states, 8 states have (on average 142.375) internal successors, (1139), 8 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:28,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 04:42:28,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 303 [2023-08-24 04:42:28,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 04:42:28,916 INFO L124 PetriNetUnfolderBase]: 1986/3223 cut-off events. [2023-08-24 04:42:28,917 INFO L125 PetriNetUnfolderBase]: For 1186/1186 co-relation queries the response was YES. [2023-08-24 04:42:28,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7663 conditions, 3223 events. 1986/3223 cut-off events. For 1186/1186 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 15001 event pairs, 399 based on Foata normal form. 52/2955 useless extension candidates. Maximal degree in co-relation 7184. Up to 909 conditions per place. [2023-08-24 04:42:28,933 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 173 selfloop transitions, 22 changer transitions 0/195 dead transitions. [2023-08-24 04:42:28,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 195 transitions, 934 flow [2023-08-24 04:42:28,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 04:42:28,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 04:42:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1584 transitions. [2023-08-24 04:42:28,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5227722772277228 [2023-08-24 04:42:28,938 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1584 transitions. [2023-08-24 04:42:28,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1584 transitions. [2023-08-24 04:42:28,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 04:42:28,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1584 transitions. [2023-08-24 04:42:28,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 158.4) internal successors, (1584), 10 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:28,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 303.0) internal successors, (3333), 11 states have internal predecessors, (3333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:28,949 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 303.0) internal successors, (3333), 11 states have internal predecessors, (3333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:28,949 INFO L175 Difference]: Start difference. First operand has 39 places, 38 transitions, 122 flow. Second operand 10 states and 1584 transitions. [2023-08-24 04:42:28,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 195 transitions, 934 flow [2023-08-24 04:42:28,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 195 transitions, 921 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 04:42:28,961 INFO L231 Difference]: Finished difference. Result has 51 places, 56 transitions, 280 flow [2023-08-24 04:42:28,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=280, PETRI_PLACES=51, PETRI_TRANSITIONS=56} [2023-08-24 04:42:28,962 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 16 predicate places. [2023-08-24 04:42:28,962 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 56 transitions, 280 flow [2023-08-24 04:42:28,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 142.375) internal successors, (1139), 8 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:28,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 04:42:28,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 04:42:28,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-24 04:42:29,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 04:42:29,170 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 04:42:29,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 04:42:29,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1568042570, now seen corresponding path program 1 times [2023-08-24 04:42:29,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 04:42:29,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971988173] [2023-08-24 04:42:29,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 04:42:29,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 04:42:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 04:42:29,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 04:42:29,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 04:42:29,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971988173] [2023-08-24 04:42:29,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971988173] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 04:42:29,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 04:42:29,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 04:42:29,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501556347] [2023-08-24 04:42:29,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 04:42:29,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 04:42:29,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 04:42:29,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 04:42:29,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 04:42:29,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 303 [2023-08-24 04:42:29,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 56 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:29,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 04:42:29,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 303 [2023-08-24 04:42:29,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 04:42:29,414 INFO L124 PetriNetUnfolderBase]: 606/1135 cut-off events. [2023-08-24 04:42:29,414 INFO L125 PetriNetUnfolderBase]: For 415/415 co-relation queries the response was YES. [2023-08-24 04:42:29,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2770 conditions, 1135 events. 606/1135 cut-off events. For 415/415 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4845 event pairs, 98 based on Foata normal form. 0/1055 useless extension candidates. Maximal degree in co-relation 2292. Up to 850 conditions per place. [2023-08-24 04:42:29,420 INFO L140 encePairwiseOnDemand]: 298/303 looper letters, 47 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2023-08-24 04:42:29,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 331 flow [2023-08-24 04:42:29,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 04:42:29,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 04:42:29,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2023-08-24 04:42:29,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5093509350935094 [2023-08-24 04:42:29,422 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 463 transitions. [2023-08-24 04:42:29,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 463 transitions. [2023-08-24 04:42:29,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 04:42:29,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 463 transitions. [2023-08-24 04:42:29,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:29,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:29,427 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:29,427 INFO L175 Difference]: Start difference. First operand has 51 places, 56 transitions, 280 flow. Second operand 3 states and 463 transitions. [2023-08-24 04:42:29,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 331 flow [2023-08-24 04:42:29,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 55 transitions, 319 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-24 04:42:29,432 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 204 flow [2023-08-24 04:42:29,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2023-08-24 04:42:29,434 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2023-08-24 04:42:29,435 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 204 flow [2023-08-24 04:42:29,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:29,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 04:42:29,435 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 04:42:29,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 04:42:29,436 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 04:42:29,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 04:42:29,436 INFO L85 PathProgramCache]: Analyzing trace with hash 321710418, now seen corresponding path program 1 times [2023-08-24 04:42:29,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 04:42:29,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146104543] [2023-08-24 04:42:29,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 04:42:29,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 04:42:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 04:42:29,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 04:42:29,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 04:42:29,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146104543] [2023-08-24 04:42:29,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146104543] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 04:42:29,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 04:42:29,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 04:42:29,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693695940] [2023-08-24 04:42:29,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 04:42:29,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 04:42:29,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 04:42:29,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 04:42:29,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 04:42:29,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 303 [2023-08-24 04:42:29,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 204 flow. Second operand has 5 states, 5 states have (on average 142.6) internal successors, (713), 5 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:29,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 04:42:29,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 303 [2023-08-24 04:42:29,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 04:42:29,767 INFO L124 PetriNetUnfolderBase]: 718/1317 cut-off events. [2023-08-24 04:42:29,768 INFO L125 PetriNetUnfolderBase]: For 378/378 co-relation queries the response was YES. [2023-08-24 04:42:29,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3320 conditions, 1317 events. 718/1317 cut-off events. For 378/378 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5602 event pairs, 236 based on Foata normal form. 18/1335 useless extension candidates. Maximal degree in co-relation 2798. Up to 702 conditions per place. [2023-08-24 04:42:29,774 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 81 selfloop transitions, 14 changer transitions 0/95 dead transitions. [2023-08-24 04:42:29,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 95 transitions, 534 flow [2023-08-24 04:42:29,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 04:42:29,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 04:42:29,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 923 transitions. [2023-08-24 04:42:29,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5077007700770076 [2023-08-24 04:42:29,777 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 923 transitions. [2023-08-24 04:42:29,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 923 transitions. [2023-08-24 04:42:29,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 04:42:29,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 923 transitions. [2023-08-24 04:42:29,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 153.83333333333334) internal successors, (923), 6 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:29,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 303.0) internal successors, (2121), 7 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:29,783 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 303.0) internal successors, (2121), 7 states have internal predecessors, (2121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:29,783 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 204 flow. Second operand 6 states and 923 transitions. [2023-08-24 04:42:29,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 95 transitions, 534 flow [2023-08-24 04:42:29,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 95 transitions, 521 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 04:42:29,787 INFO L231 Difference]: Finished difference. Result has 56 places, 48 transitions, 271 flow [2023-08-24 04:42:29,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=56, PETRI_TRANSITIONS=48} [2023-08-24 04:42:29,788 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 21 predicate places. [2023-08-24 04:42:29,788 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 48 transitions, 271 flow [2023-08-24 04:42:29,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.6) internal successors, (713), 5 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:29,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 04:42:29,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 04:42:29,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 04:42:29,789 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 04:42:29,789 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 04:42:29,789 INFO L85 PathProgramCache]: Analyzing trace with hash -2070456889, now seen corresponding path program 1 times [2023-08-24 04:42:29,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 04:42:29,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251938645] [2023-08-24 04:42:29,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 04:42:29,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 04:42:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 04:42:30,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 04:42:30,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 04:42:30,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251938645] [2023-08-24 04:42:30,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251938645] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 04:42:30,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 04:42:30,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-08-24 04:42:30,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145958196] [2023-08-24 04:42:30,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 04:42:30,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-24 04:42:30,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 04:42:30,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-24 04:42:30,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-08-24 04:42:30,940 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 303 [2023-08-24 04:42:30,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 48 transitions, 271 flow. Second operand has 16 states, 16 states have (on average 96.375) internal successors, (1542), 16 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:30,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 04:42:30,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 303 [2023-08-24 04:42:30,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 04:42:31,992 INFO L124 PetriNetUnfolderBase]: 1006/1842 cut-off events. [2023-08-24 04:42:31,992 INFO L125 PetriNetUnfolderBase]: For 1064/1064 co-relation queries the response was YES. [2023-08-24 04:42:31,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4739 conditions, 1842 events. 1006/1842 cut-off events. For 1064/1064 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 8702 event pairs, 306 based on Foata normal form. 4/1828 useless extension candidates. Maximal degree in co-relation 3526. Up to 1181 conditions per place. [2023-08-24 04:42:32,001 INFO L140 encePairwiseOnDemand]: 286/303 looper letters, 136 selfloop transitions, 23 changer transitions 3/162 dead transitions. [2023-08-24 04:42:32,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 162 transitions, 917 flow [2023-08-24 04:42:32,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-24 04:42:32,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-24 04:42:32,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1478 transitions. [2023-08-24 04:42:32,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34842055634134844 [2023-08-24 04:42:32,008 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1478 transitions. [2023-08-24 04:42:32,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1478 transitions. [2023-08-24 04:42:32,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 04:42:32,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1478 transitions. [2023-08-24 04:42:32,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 105.57142857142857) internal successors, (1478), 14 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:32,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 303.0) internal successors, (4545), 15 states have internal predecessors, (4545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:32,023 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 303.0) internal successors, (4545), 15 states have internal predecessors, (4545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:32,024 INFO L175 Difference]: Start difference. First operand has 56 places, 48 transitions, 271 flow. Second operand 14 states and 1478 transitions. [2023-08-24 04:42:32,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 162 transitions, 917 flow [2023-08-24 04:42:32,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 162 transitions, 894 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-24 04:42:32,031 INFO L231 Difference]: Finished difference. Result has 78 places, 70 transitions, 465 flow [2023-08-24 04:42:32,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=465, PETRI_PLACES=78, PETRI_TRANSITIONS=70} [2023-08-24 04:42:32,032 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 43 predicate places. [2023-08-24 04:42:32,032 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 70 transitions, 465 flow [2023-08-24 04:42:32,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 96.375) internal successors, (1542), 16 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:32,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 04:42:32,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 04:42:32,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 04:42:32,033 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 04:42:32,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 04:42:32,033 INFO L85 PathProgramCache]: Analyzing trace with hash -734851743, now seen corresponding path program 2 times [2023-08-24 04:42:32,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 04:42:32,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642998687] [2023-08-24 04:42:32,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 04:42:32,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 04:42:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 04:42:33,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 04:42:33,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 04:42:33,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642998687] [2023-08-24 04:42:33,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642998687] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 04:42:33,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 04:42:33,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-08-24 04:42:33,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444801050] [2023-08-24 04:42:33,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 04:42:33,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-24 04:42:33,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 04:42:33,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-24 04:42:33,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2023-08-24 04:42:33,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 303 [2023-08-24 04:42:33,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 70 transitions, 465 flow. Second operand has 16 states, 16 states have (on average 96.375) internal successors, (1542), 16 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:33,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 04:42:33,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 303 [2023-08-24 04:42:33,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 04:42:34,076 INFO L124 PetriNetUnfolderBase]: 1244/2276 cut-off events. [2023-08-24 04:42:34,077 INFO L125 PetriNetUnfolderBase]: For 1796/1796 co-relation queries the response was YES. [2023-08-24 04:42:34,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6565 conditions, 2276 events. 1244/2276 cut-off events. For 1796/1796 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 10700 event pairs, 350 based on Foata normal form. 4/2256 useless extension candidates. Maximal degree in co-relation 4346. Up to 1108 conditions per place. [2023-08-24 04:42:34,093 INFO L140 encePairwiseOnDemand]: 287/303 looper letters, 138 selfloop transitions, 36 changer transitions 3/177 dead transitions. [2023-08-24 04:42:34,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 177 transitions, 1195 flow [2023-08-24 04:42:34,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-24 04:42:34,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-24 04:42:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1478 transitions. [2023-08-24 04:42:34,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34842055634134844 [2023-08-24 04:42:34,098 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1478 transitions. [2023-08-24 04:42:34,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1478 transitions. [2023-08-24 04:42:34,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 04:42:34,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1478 transitions. [2023-08-24 04:42:34,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 105.57142857142857) internal successors, (1478), 14 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:34,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 303.0) internal successors, (4545), 15 states have internal predecessors, (4545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:34,111 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 303.0) internal successors, (4545), 15 states have internal predecessors, (4545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:34,111 INFO L175 Difference]: Start difference. First operand has 78 places, 70 transitions, 465 flow. Second operand 14 states and 1478 transitions. [2023-08-24 04:42:34,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 177 transitions, 1195 flow [2023-08-24 04:42:34,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 177 transitions, 1191 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-24 04:42:34,122 INFO L231 Difference]: Finished difference. Result has 100 places, 86 transitions, 730 flow [2023-08-24 04:42:34,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=730, PETRI_PLACES=100, PETRI_TRANSITIONS=86} [2023-08-24 04:42:34,124 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 65 predicate places. [2023-08-24 04:42:34,124 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 86 transitions, 730 flow [2023-08-24 04:42:34,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 96.375) internal successors, (1542), 16 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 04:42:34,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 04:42:34,125 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 04:42:34,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 04:42:34,125 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 04:42:34,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 04:42:34,126 INFO L85 PathProgramCache]: Analyzing trace with hash -2144319276, now seen corresponding path program 1 times [2023-08-24 04:42:34,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 04:42:34,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058825677] [2023-08-24 04:42:34,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 04:42:34,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 04:42:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 04:42:34,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 04:42:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 04:42:34,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 04:42:34,214 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 04:42:34,215 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-24 04:42:34,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2023-08-24 04:42:34,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-24 04:42:34,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-08-24 04:42:34,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-08-24 04:42:34,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-24 04:42:34,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 04:42:34,218 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 04:42:34,223 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 04:42:34,223 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 04:42:34,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 04:42:34 BasicIcfg [2023-08-24 04:42:34,292 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 04:42:34,293 INFO L158 Benchmark]: Toolchain (without parser) took 12677.39ms. Allocated memory was 377.5MB in the beginning and 572.5MB in the end (delta: 195.0MB). Free memory was 351.8MB in the beginning and 383.8MB in the end (delta: -32.0MB). Peak memory consumption was 165.5MB. Max. memory is 16.0GB. [2023-08-24 04:42:34,293 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 377.5MB. Free memory is still 353.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 04:42:34,293 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.31ms. Allocated memory is still 377.5MB. Free memory was 351.8MB in the beginning and 322.1MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-24 04:42:34,293 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.26ms. Allocated memory is still 377.5MB. Free memory was 322.1MB in the beginning and 319.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 04:42:34,293 INFO L158 Benchmark]: Boogie Preprocessor took 25.36ms. Allocated memory is still 377.5MB. Free memory was 319.6MB in the beginning and 317.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 04:42:34,294 INFO L158 Benchmark]: RCFGBuilder took 522.65ms. Allocated memory is still 377.5MB. Free memory was 317.5MB in the beginning and 300.2MB in the end (delta: 17.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-24 04:42:34,294 INFO L158 Benchmark]: TraceAbstraction took 11591.92ms. Allocated memory was 377.5MB in the beginning and 572.5MB in the end (delta: 195.0MB). Free memory was 299.2MB in the beginning and 383.8MB in the end (delta: -84.6MB). Peak memory consumption was 113.1MB. Max. memory is 16.0GB. [2023-08-24 04:42:34,297 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.16ms. Allocated memory is still 377.5MB. Free memory is still 353.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 489.31ms. Allocated memory is still 377.5MB. Free memory was 351.8MB in the beginning and 322.1MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 43.26ms. Allocated memory is still 377.5MB. Free memory was 322.1MB in the beginning and 319.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 25.36ms. Allocated memory is still 377.5MB. Free memory was 319.6MB in the beginning and 317.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 522.65ms. Allocated memory is still 377.5MB. Free memory was 317.5MB in the beginning and 300.2MB in the end (delta: 17.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 11591.92ms. Allocated memory was 377.5MB in the beginning and 572.5MB in the end (delta: 195.0MB). Free memory was 299.2MB in the beginning and 383.8MB in the end (delta: -84.6MB). Peak memory consumption was 113.1MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 261]: Unsoundness Warning unspecified type, defaulting to int C: short [261] - GenericResultAtLocation [Line: 261]: Unsoundness Warning unspecified type, defaulting to int C: short [261] - GenericResultAtLocation [Line: 753]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [753] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 148 PlacesBefore, 35 PlacesAfterwards, 151 TransitionsBefore, 33 TransitionsAfterwards, 7334 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 84 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 22 ConcurrentYvCompositions, 5 ChoiceCompositions, 141 TotalNumberOfCompositions, 9688 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6870, independent: 6685, independent conditional: 0, independent unconditional: 6685, dependent: 185, dependent conditional: 0, dependent unconditional: 185, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4087, independent: 4036, independent conditional: 0, independent unconditional: 4036, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6870, independent: 2649, independent conditional: 0, independent unconditional: 2649, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 4087, unknown conditional: 0, unknown unconditional: 4087] , Statistics on independence cache: Total cache size (in pairs): 168, Positive cache size: 151, Positive conditional cache size: 0, Positive unconditional cache size: 151, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 941]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(5)]; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1021] 0 pthread_t id1, id2; [L1023] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1={9:0}, id2={6:0}, m={4:0}, pthread_create(&id1, ((void *)0), t1, ((void *)0))=13, top=0] [L990] 1 int i; [L991] 1 unsigned int tmp; [L992] 1 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1024] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1={9:0}, id2={6:0}, m={4:0}, pthread_create(&id2, ((void *)0), t2, ((void *)0))=14, top=0] [L1006] 2 int i; [L1007] 2 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) [L995] 1 tmp = __VERIFIER_nondet_uint() [L996] CALL 1 assume_abort_if_not(tmp < (5)) [L23] COND FALSE 1 !(!cond) [L996] RET 1 assume_abort_if_not(tmp < (5)) [L997] CALL, EXPR 1 push(arr,tmp) [L962] COND FALSE 1 !(top==(5)) [L969] CALL, EXPR 1 get_top() [L954] 1 return top; [L969] RET, EXPR 1 get_top() [L969] 1 stack[get_top()] = x [L970] CALL 1 inc_top() [L946] 1 top++ [L970] RET 1 inc_top() [L972] 1 return 0; [L997] RET, EXPR 1 push(arr,tmp) [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) [L999] 1 flag=(1) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=4, top=1] [L992] 1 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, tmp=4, top=1] [L1007] COND TRUE 2 i<(5) [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; VAL [\result=0, \result=1, arr={3:0}, flag=1, m={4:0}, top=1] [L976] RET, EXPR 2 get_top() [L976] COND FALSE 2 !(get_top()==0) [L983] CALL 2 dec_top() [L950] 2 top-- VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L983] RET 2 dec_top() [L984] CALL, EXPR 2 get_top() [L954] 2 return top; [L984] RET, EXPR 2 get_top() [L984] EXPR 2 stack[get_top()] [L984] 2 return stack[get_top()]; [L1012] RET, EXPR 2 pop(arr) [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1007] 2 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1007] COND TRUE 2 i<(5) [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND TRUE 2 get_top()==0 [L979] 2 return (-2); [L1012] RET, EXPR 2 pop(arr) [L1012] COND TRUE 2 !(pop(arr)!=(-2)) [L1013] CALL 2 error() [L941] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1023]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 941]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 254 locations, 6 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: 11.4s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 521 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 521 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3262 IncrementalHoareTripleChecker+Invalid, 3288 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 0 mSDtfsCounter, 3262 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=730occurred in iteration=8, InterpolantAutomatonStates: 56, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 1281 SizeOfPredicates, 1 NumberOfNonLiveVariables, 193 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 3/9 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 proved your program to be incorrect! [2023-08-24 04:42:34,321 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 Received shutdown request...