/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 PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack_longer-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 11:12:35,571 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 11:12:35,620 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 11:12:35,624 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 11:12:35,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 11:12:35,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 11:12:35,648 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 11:12:35,649 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 11:12:35,649 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 11:12:35,650 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 11:12:35,650 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 11:12:35,650 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 11:12:35,651 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 11:12:35,651 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 11:12:35,651 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 11:12:35,652 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 11:12:35,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 11:12:35,652 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 11:12:35,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 11:12:35,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 11:12:35,653 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 11:12:35,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 11:12:35,654 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 11:12:35,654 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 11:12:35,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 11:12:35,655 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 11:12:35,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 11:12:35,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:12:35,655 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 11:12:35,656 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 11:12:35,656 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 11:12:35,656 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 11:12:35,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 11:12:35,656 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 11:12:35,657 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 11:12:35,657 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 -> PROGRAM_FIRST [2023-08-24 11:12:35,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 11:12:35,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 11:12:35,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 11:12:35,978 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 11:12:35,978 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 11:12:35,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longer-1.i [2023-08-24 11:12:37,235 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 11:12:37,489 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 11:12:37,493 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-1.i [2023-08-24 11:12:37,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67f0ab7b0/f99bbe18b716417297c2de75d88c9cda/FLAGef216d037 [2023-08-24 11:12:37,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67f0ab7b0/f99bbe18b716417297c2de75d88c9cda [2023-08-24 11:12:37,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 11:12:37,522 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 11:12:37,525 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 11:12:37,525 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 11:12:37,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 11:12:37,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:12:37" (1/1) ... [2023-08-24 11:12:37,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@266123a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:12:37, skipping insertion in model container [2023-08-24 11:12:37,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:12:37" (1/1) ... [2023-08-24 11:12:37,565 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 11:12:37,888 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_longer-1.i[41527,41540] [2023-08-24 11:12:37,918 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:12:37,927 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 11:12:37,955 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [261] [2023-08-24 11:12:37,957 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [261] [2023-08-24 11:12:37,964 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [753] [2023-08-24 11:12:37,969 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_longer-1.i[41527,41540] [2023-08-24 11:12:37,977 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:12:38,048 INFO L206 MainTranslator]: Completed translation [2023-08-24 11:12:38,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:12:38 WrapperNode [2023-08-24 11:12:38,049 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 11:12:38,049 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 11:12:38,050 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 11:12:38,050 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 11:12:38,054 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:12:38" (1/1) ... [2023-08-24 11:12:38,068 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:12:38" (1/1) ... [2023-08-24 11:12:38,093 INFO L138 Inliner]: procedures = 277, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 156 [2023-08-24 11:12:38,093 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 11:12:38,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 11:12:38,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 11:12:38,094 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 11:12:38,101 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:12:38" (1/1) ... [2023-08-24 11:12:38,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:12:38" (1/1) ... [2023-08-24 11:12:38,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:12:38" (1/1) ... [2023-08-24 11:12:38,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:12:38" (1/1) ... [2023-08-24 11:12:38,111 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:12:38" (1/1) ... [2023-08-24 11:12:38,113 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:12:38" (1/1) ... [2023-08-24 11:12:38,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:12:38" (1/1) ... [2023-08-24 11:12:38,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:12:38" (1/1) ... [2023-08-24 11:12:38,119 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 11:12:38,120 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 11:12:38,120 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 11:12:38,120 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 11:12:38,121 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:12:38" (1/1) ... [2023-08-24 11:12:38,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:12:38,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:12:38,169 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 11:12:38,185 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 11:12:38,210 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-24 11:12:38,210 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-24 11:12:38,210 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-24 11:12:38,210 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-24 11:12:38,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 11:12:38,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 11:12:38,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 11:12:38,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 11:12:38,210 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-24 11:12:38,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 11:12:38,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 11:12:38,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 11:12:38,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 11:12:38,212 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 11:12:38,322 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 11:12:38,324 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 11:12:38,501 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 11:12:38,508 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 11:12:38,509 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-24 11:12:38,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:12:38 BoogieIcfgContainer [2023-08-24 11:12:38,513 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 11:12:38,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 11:12:38,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 11:12:38,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 11:12:38,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 11:12:37" (1/3) ... [2023-08-24 11:12:38,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ece5091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:12:38, skipping insertion in model container [2023-08-24 11:12:38,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:12:38" (2/3) ... [2023-08-24 11:12:38,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ece5091 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:12:38, skipping insertion in model container [2023-08-24 11:12:38,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:12:38" (3/3) ... [2023-08-24 11:12:38,519 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longer-1.i [2023-08-24 11:12:38,536 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 11:12:38,536 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 11:12:38,536 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 11:12:38,656 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-24 11:12:38,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 158 transitions, 332 flow [2023-08-24 11:12:38,747 INFO L124 PetriNetUnfolderBase]: 10/156 cut-off events. [2023-08-24 11:12:38,748 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 11:12:38,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 156 events. 10/156 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 373 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 118. Up to 3 conditions per place. [2023-08-24 11:12:38,755 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 158 transitions, 332 flow [2023-08-24 11:12:38,759 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 147 transitions, 303 flow [2023-08-24 11:12:38,762 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:12:38,770 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 147 transitions, 303 flow [2023-08-24 11:12:38,772 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 147 transitions, 303 flow [2023-08-24 11:12:38,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 147 transitions, 303 flow [2023-08-24 11:12:38,808 INFO L124 PetriNetUnfolderBase]: 10/147 cut-off events. [2023-08-24 11:12:38,808 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-24 11:12:38,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 147 events. 10/147 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 302 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 118. Up to 3 conditions per place. [2023-08-24 11:12:38,817 INFO L119 LiptonReduction]: Number of co-enabled transitions 7334 [2023-08-24 11:12:42,260 INFO L134 LiptonReduction]: Checked pairs total: 10082 [2023-08-24 11:12:42,261 INFO L136 LiptonReduction]: Total number of compositions: 135 [2023-08-24 11:12:42,272 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 11:12:42,277 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;@37f0977c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:12:42,277 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-24 11:12:42,281 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:12:42,281 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-08-24 11:12:42,281 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-24 11:12:42,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:12:42,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-24 11:12:42,282 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 11:12:42,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:12:42,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1684934246, now seen corresponding path program 1 times [2023-08-24 11:12:42,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:12:42,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117163708] [2023-08-24 11:12:42,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:12:42,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:12:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:12:42,552 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 11:12:42,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:12:42,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117163708] [2023-08-24 11:12:42,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117163708] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:12:42,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:12:42,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:12:42,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966849583] [2023-08-24 11:12:42,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:12:42,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:12:42,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:12:42,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:12:42,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:12:42,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 293 [2023-08-24 11:12:42,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 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 11:12:42,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:12:42,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 293 [2023-08-24 11:12:42,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:12:42,848 INFO L124 PetriNetUnfolderBase]: 845/1382 cut-off events. [2023-08-24 11:12:42,849 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2023-08-24 11:12:42,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2798 conditions, 1382 events. 845/1382 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5801 event pairs, 243 based on Foata normal form. 0/1128 useless extension candidates. Maximal degree in co-relation 2590. Up to 777 conditions per place. [2023-08-24 11:12:42,862 INFO L140 encePairwiseOnDemand]: 288/293 looper letters, 55 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2023-08-24 11:12:42,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 60 transitions, 253 flow [2023-08-24 11:12:42,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:12:42,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:12:42,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2023-08-24 11:12:42,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5358361774744027 [2023-08-24 11:12:42,877 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 471 transitions. [2023-08-24 11:12:42,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 471 transitions. [2023-08-24 11:12:42,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:12:42,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 471 transitions. [2023-08-24 11:12:42,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 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 11:12:42,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 0 states have call successors, (0), 0 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 11:12:42,890 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 0 states have call successors, (0), 0 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 11:12:42,892 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 75 flow. Second operand 3 states and 471 transitions. [2023-08-24 11:12:42,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 60 transitions, 253 flow [2023-08-24 11:12:42,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 60 transitions, 245 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-24 11:12:42,897 INFO L231 Difference]: Finished difference. Result has 36 places, 36 transitions, 100 flow [2023-08-24 11:12:42,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, 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 11:12:42,902 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2023-08-24 11:12:42,902 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 36 transitions, 100 flow [2023-08-24 11:12:42,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 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 11:12:42,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:12:42,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:12:42,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 11:12:42,903 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 11:12:42,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:12:42,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1024065199, now seen corresponding path program 1 times [2023-08-24 11:12:42,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:12:42,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6269113] [2023-08-24 11:12:42,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:12:42,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:12:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:12:43,064 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 11:12:43,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:12:43,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6269113] [2023-08-24 11:12:43,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6269113] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:12:43,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:12:43,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:12:43,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731009414] [2023-08-24 11:12:43,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:12:43,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:12:43,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:12:43,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:12:43,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:12:43,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 293 [2023-08-24 11:12:43,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 36 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 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 11:12:43,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:12:43,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 293 [2023-08-24 11:12:43,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:12:43,231 INFO L124 PetriNetUnfolderBase]: 987/1600 cut-off events. [2023-08-24 11:12:43,232 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2023-08-24 11:12:43,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3491 conditions, 1600 events. 987/1600 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 6550 event pairs, 449 based on Foata normal form. 0/1334 useless extension candidates. Maximal degree in co-relation 3078. Up to 1301 conditions per place. [2023-08-24 11:12:43,240 INFO L140 encePairwiseOnDemand]: 290/293 looper letters, 50 selfloop transitions, 2 changer transitions 3/55 dead transitions. [2023-08-24 11:12:43,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 55 transitions, 255 flow [2023-08-24 11:12:43,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:12:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:12:43,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 482 transitions. [2023-08-24 11:12:43,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5483503981797497 [2023-08-24 11:12:43,247 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 482 transitions. [2023-08-24 11:12:43,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 482 transitions. [2023-08-24 11:12:43,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:12:43,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 482 transitions. [2023-08-24 11:12:43,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 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 11:12:43,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 0 states have call successors, (0), 0 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 11:12:43,253 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 0 states have call successors, (0), 0 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 11:12:43,253 INFO L175 Difference]: Start difference. First operand has 36 places, 36 transitions, 100 flow. Second operand 3 states and 482 transitions. [2023-08-24 11:12:43,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 55 transitions, 255 flow [2023-08-24 11:12:43,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 55 transitions, 245 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:12:43,257 INFO L231 Difference]: Finished difference. Result has 37 places, 37 transitions, 104 flow [2023-08-24 11:12:43,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, 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 11:12:43,258 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2023-08-24 11:12:43,258 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 37 transitions, 104 flow [2023-08-24 11:12:43,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 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 11:12:43,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:12:43,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:12:43,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 11:12:43,263 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 11:12:43,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:12:43,268 INFO L85 PathProgramCache]: Analyzing trace with hash 794946535, now seen corresponding path program 1 times [2023-08-24 11:12:43,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:12:43,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406947612] [2023-08-24 11:12:43,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:12:43,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:12:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:12:43,379 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 11:12:43,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:12:43,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406947612] [2023-08-24 11:12:43,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406947612] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:12:43,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:12:43,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:12:43,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157523130] [2023-08-24 11:12:43,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:12:43,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:12:43,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:12:43,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:12:43,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:12:43,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 293 [2023-08-24 11:12:43,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 37 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 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 11:12:43,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:12:43,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 293 [2023-08-24 11:12:43,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:12:43,543 INFO L124 PetriNetUnfolderBase]: 942/1555 cut-off events. [2023-08-24 11:12:43,543 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2023-08-24 11:12:43,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3440 conditions, 1555 events. 942/1555 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6593 event pairs, 653 based on Foata normal form. 50/1437 useless extension candidates. Maximal degree in co-relation 3052. Up to 1389 conditions per place. [2023-08-24 11:12:43,552 INFO L140 encePairwiseOnDemand]: 290/293 looper letters, 51 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2023-08-24 11:12:43,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 56 transitions, 266 flow [2023-08-24 11:12:43,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:12:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:12:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2023-08-24 11:12:43,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5381114903299203 [2023-08-24 11:12:43,554 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 473 transitions. [2023-08-24 11:12:43,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 473 transitions. [2023-08-24 11:12:43,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:12:43,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 473 transitions. [2023-08-24 11:12:43,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 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 11:12:43,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 0 states have call successors, (0), 0 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 11:12:43,558 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 0 states have call successors, (0), 0 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 11:12:43,558 INFO L175 Difference]: Start difference. First operand has 37 places, 37 transitions, 104 flow. Second operand 3 states and 473 transitions. [2023-08-24 11:12:43,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 56 transitions, 266 flow [2023-08-24 11:12:43,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 56 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:12:43,560 INFO L231 Difference]: Finished difference. Result has 39 places, 38 transitions, 122 flow [2023-08-24 11:12:43,561 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, 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 11:12:43,562 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2023-08-24 11:12:43,562 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 38 transitions, 122 flow [2023-08-24 11:12:43,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 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 11:12:43,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:12:43,562 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:12:43,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 11:12:43,563 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 11:12:43,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:12:43,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1768410213, now seen corresponding path program 1 times [2023-08-24 11:12:43,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:12:43,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031337038] [2023-08-24 11:12:43,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:12:43,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:12:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:12:43,688 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 11:12:43,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:12:43,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031337038] [2023-08-24 11:12:43,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031337038] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 11:12:43,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660725878] [2023-08-24 11:12:43,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:12:43,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 11:12:43,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:12:43,697 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 11:12:43,722 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 11:12:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:12:43,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-24 11:12:43,812 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 11:12:43,896 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 11:12:43,896 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 11:12:43,944 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 11:12:43,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660725878] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 11:12:43,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 11:12:43,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2023-08-24 11:12:43,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936207611] [2023-08-24 11:12:43,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 11:12:43,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-24 11:12:43,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:12:43,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-24 11:12:43,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-24 11:12:43,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 293 [2023-08-24 11:12:43,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 38 transitions, 122 flow. Second operand has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 0 states have call successors, (0), 0 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 11:12:43,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:12:43,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 293 [2023-08-24 11:12:43,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:12:44,448 INFO L124 PetriNetUnfolderBase]: 1815/3000 cut-off events. [2023-08-24 11:12:44,449 INFO L125 PetriNetUnfolderBase]: For 1075/1075 co-relation queries the response was YES. [2023-08-24 11:12:44,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7073 conditions, 3000 events. 1815/3000 cut-off events. For 1075/1075 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 14146 event pairs, 349 based on Foata normal form. 48/2736 useless extension candidates. Maximal degree in co-relation 6486. Up to 844 conditions per place. [2023-08-24 11:12:44,465 INFO L140 encePairwiseOnDemand]: 287/293 looper letters, 164 selfloop transitions, 22 changer transitions 0/187 dead transitions. [2023-08-24 11:12:44,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 187 transitions, 900 flow [2023-08-24 11:12:44,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 11:12:44,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 11:12:44,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1535 transitions. [2023-08-24 11:12:44,469 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238907849829352 [2023-08-24 11:12:44,470 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1535 transitions. [2023-08-24 11:12:44,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1535 transitions. [2023-08-24 11:12:44,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:12:44,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1535 transitions. [2023-08-24 11:12:44,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 153.5) internal successors, (1535), 10 states have internal predecessors, (1535), 0 states have call successors, (0), 0 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 11:12:44,479 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 293.0) internal successors, (3223), 11 states have internal predecessors, (3223), 0 states have call successors, (0), 0 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 11:12:44,480 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 293.0) internal successors, (3223), 11 states have internal predecessors, (3223), 0 states have call successors, (0), 0 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 11:12:44,480 INFO L175 Difference]: Start difference. First operand has 39 places, 38 transitions, 122 flow. Second operand 10 states and 1535 transitions. [2023-08-24 11:12:44,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 187 transitions, 900 flow [2023-08-24 11:12:44,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 187 transitions, 887 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:12:44,491 INFO L231 Difference]: Finished difference. Result has 51 places, 56 transitions, 280 flow [2023-08-24 11:12:44,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, 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 11:12:44,492 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 16 predicate places. [2023-08-24 11:12:44,492 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 56 transitions, 280 flow [2023-08-24 11:12:44,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 138.6) internal successors, (1386), 10 states have internal predecessors, (1386), 0 states have call successors, (0), 0 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 11:12:44,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:12:44,493 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 11:12:44,502 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 11:12:44,699 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 11:12:44,700 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 11:12:44,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:12:44,701 INFO L85 PathProgramCache]: Analyzing trace with hash 362891190, now seen corresponding path program 1 times [2023-08-24 11:12:44,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:12:44,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391199330] [2023-08-24 11:12:44,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:12:44,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:12:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:12:44,812 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 11:12:44,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:12:44,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391199330] [2023-08-24 11:12:44,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391199330] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:12:44,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:12:44,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:12:44,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627362656] [2023-08-24 11:12:44,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:12:44,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:12:44,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:12:44,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:12:44,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:12:44,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 293 [2023-08-24 11:12:44,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 56 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 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 11:12:44,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:12:44,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 293 [2023-08-24 11:12:44,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:12:44,942 INFO L124 PetriNetUnfolderBase]: 613/1142 cut-off events. [2023-08-24 11:12:44,942 INFO L125 PetriNetUnfolderBase]: For 302/302 co-relation queries the response was YES. [2023-08-24 11:12:44,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2796 conditions, 1142 events. 613/1142 cut-off events. For 302/302 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4886 event pairs, 98 based on Foata normal form. 0/1062 useless extension candidates. Maximal degree in co-relation 1750. Up to 861 conditions per place. [2023-08-24 11:12:44,949 INFO L140 encePairwiseOnDemand]: 288/293 looper letters, 49 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2023-08-24 11:12:44,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 55 transitions, 335 flow [2023-08-24 11:12:44,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:12:44,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:12:44,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 451 transitions. [2023-08-24 11:12:44,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5130830489192264 [2023-08-24 11:12:44,951 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 451 transitions. [2023-08-24 11:12:44,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 451 transitions. [2023-08-24 11:12:44,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:12:44,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 451 transitions. [2023-08-24 11:12:44,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 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 11:12:44,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 0 states have call successors, (0), 0 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 11:12:44,954 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 0 states have call successors, (0), 0 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 11:12:44,954 INFO L175 Difference]: Start difference. First operand has 51 places, 56 transitions, 280 flow. Second operand 3 states and 451 transitions. [2023-08-24 11:12:44,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 55 transitions, 335 flow [2023-08-24 11:12:44,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 55 transitions, 323 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-24 11:12:44,959 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 204 flow [2023-08-24 11:12:44,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, 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 11:12:44,962 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2023-08-24 11:12:44,962 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 204 flow [2023-08-24 11:12:44,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 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 11:12:44,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:12:44,963 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 11:12:44,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 11:12:44,963 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 11:12:44,963 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:12:44,963 INFO L85 PathProgramCache]: Analyzing trace with hash 647657202, now seen corresponding path program 1 times [2023-08-24 11:12:44,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:12:44,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550872414] [2023-08-24 11:12:44,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:12:44,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:12:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:12:45,045 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 11:12:45,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:12:45,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550872414] [2023-08-24 11:12:45,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550872414] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:12:45,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:12:45,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:12:45,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072601976] [2023-08-24 11:12:45,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:12:45,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:12:45,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:12:45,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:12:45,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:12:45,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 293 [2023-08-24 11:12:45,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 204 flow. Second operand has 5 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 0 states have call successors, (0), 0 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 11:12:45,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:12:45,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 293 [2023-08-24 11:12:45,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:12:45,274 INFO L124 PetriNetUnfolderBase]: 727/1350 cut-off events. [2023-08-24 11:12:45,274 INFO L125 PetriNetUnfolderBase]: For 423/423 co-relation queries the response was YES. [2023-08-24 11:12:45,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3420 conditions, 1350 events. 727/1350 cut-off events. For 423/423 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5723 event pairs, 207 based on Foata normal form. 12/1362 useless extension candidates. Maximal degree in co-relation 2672. Up to 529 conditions per place. [2023-08-24 11:12:45,281 INFO L140 encePairwiseOnDemand]: 287/293 looper letters, 80 selfloop transitions, 11 changer transitions 0/92 dead transitions. [2023-08-24 11:12:45,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 92 transitions, 526 flow [2023-08-24 11:12:45,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:12:45,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:12:45,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 759 transitions. [2023-08-24 11:12:45,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5180887372013652 [2023-08-24 11:12:45,284 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 759 transitions. [2023-08-24 11:12:45,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 759 transitions. [2023-08-24 11:12:45,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:12:45,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 759 transitions. [2023-08-24 11:12:45,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.8) internal successors, (759), 5 states have internal predecessors, (759), 0 states have call successors, (0), 0 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 11:12:45,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 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 11:12:45,289 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 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 11:12:45,289 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 204 flow. Second operand 5 states and 759 transitions. [2023-08-24 11:12:45,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 92 transitions, 526 flow [2023-08-24 11:12:45,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 92 transitions, 513 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 11:12:45,294 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 258 flow [2023-08-24 11:12:45,295 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=258, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2023-08-24 11:12:45,297 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 19 predicate places. [2023-08-24 11:12:45,297 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 258 flow [2023-08-24 11:12:45,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 138.6) internal successors, (693), 5 states have internal predecessors, (693), 0 states have call successors, (0), 0 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 11:12:45,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:12:45,298 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 11:12:45,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 11:12:45,298 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 11:12:45,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:12:45,298 INFO L85 PathProgramCache]: Analyzing trace with hash 461657146, now seen corresponding path program 1 times [2023-08-24 11:12:45,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:12:45,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295683138] [2023-08-24 11:12:45,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:12:45,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:12:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:12:46,022 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 11:12:46,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:12:46,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295683138] [2023-08-24 11:12:46,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295683138] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:12:46,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:12:46,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-24 11:12:46,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956424352] [2023-08-24 11:12:46,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:12:46,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-24 11:12:46,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:12:46,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-24 11:12:46,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-08-24 11:12:46,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 293 [2023-08-24 11:12:46,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 258 flow. Second operand has 11 states, 11 states have (on average 111.0) internal successors, (1221), 11 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:12:46,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:12:46,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 293 [2023-08-24 11:12:46,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:12:46,745 INFO L124 PetriNetUnfolderBase]: 1075/1997 cut-off events. [2023-08-24 11:12:46,746 INFO L125 PetriNetUnfolderBase]: For 1232/1232 co-relation queries the response was YES. [2023-08-24 11:12:46,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5096 conditions, 1997 events. 1075/1997 cut-off events. For 1232/1232 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 9740 event pairs, 295 based on Foata normal form. 0/1979 useless extension candidates. Maximal degree in co-relation 3100. Up to 1191 conditions per place. [2023-08-24 11:12:46,758 INFO L140 encePairwiseOnDemand]: 283/293 looper letters, 115 selfloop transitions, 11 changer transitions 3/130 dead transitions. [2023-08-24 11:12:46,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 130 transitions, 796 flow [2023-08-24 11:12:46,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 11:12:46,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 11:12:46,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1091 transitions. [2023-08-24 11:12:46,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4137277208949564 [2023-08-24 11:12:46,762 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1091 transitions. [2023-08-24 11:12:46,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1091 transitions. [2023-08-24 11:12:46,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:12:46,763 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1091 transitions. [2023-08-24 11:12:46,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.22222222222223) internal successors, (1091), 9 states have internal predecessors, (1091), 0 states have call successors, (0), 0 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 11:12:46,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 293.0) internal successors, (2930), 10 states have internal predecessors, (2930), 0 states have call successors, (0), 0 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 11:12:46,771 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 293.0) internal successors, (2930), 10 states have internal predecessors, (2930), 0 states have call successors, (0), 0 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 11:12:46,772 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 258 flow. Second operand 9 states and 1091 transitions. [2023-08-24 11:12:46,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 130 transitions, 796 flow [2023-08-24 11:12:46,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 130 transitions, 776 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-24 11:12:46,777 INFO L231 Difference]: Finished difference. Result has 66 places, 58 transitions, 327 flow [2023-08-24 11:12:46,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=327, PETRI_PLACES=66, PETRI_TRANSITIONS=58} [2023-08-24 11:12:46,778 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 31 predicate places. [2023-08-24 11:12:46,778 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 58 transitions, 327 flow [2023-08-24 11:12:46,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 111.0) internal successors, (1221), 11 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:12:46,779 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:12:46,779 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 11:12:46,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 11:12:46,779 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 11:12:46,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:12:46,779 INFO L85 PathProgramCache]: Analyzing trace with hash -329150994, now seen corresponding path program 2 times [2023-08-24 11:12:46,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:12:46,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610520496] [2023-08-24 11:12:46,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:12:46,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:12:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:12:47,422 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 11:12:47,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:12:47,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610520496] [2023-08-24 11:12:47,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610520496] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:12:47,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:12:47,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-24 11:12:47,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422578374] [2023-08-24 11:12:47,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:12:47,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-24 11:12:47,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:12:47,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-24 11:12:47,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-08-24 11:12:47,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 293 [2023-08-24 11:12:47,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 58 transitions, 327 flow. Second operand has 11 states, 11 states have (on average 111.0) internal successors, (1221), 11 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:12:47,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:12:47,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 293 [2023-08-24 11:12:47,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:12:48,204 INFO L124 PetriNetUnfolderBase]: 1373/2553 cut-off events. [2023-08-24 11:12:48,204 INFO L125 PetriNetUnfolderBase]: For 1522/1522 co-relation queries the response was YES. [2023-08-24 11:12:48,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6951 conditions, 2553 events. 1373/2553 cut-off events. For 1522/1522 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 12875 event pairs, 355 based on Foata normal form. 0/2529 useless extension candidates. Maximal degree in co-relation 4514. Up to 1110 conditions per place. [2023-08-24 11:12:48,220 INFO L140 encePairwiseOnDemand]: 284/293 looper letters, 115 selfloop transitions, 16 changer transitions 3/135 dead transitions. [2023-08-24 11:12:48,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 135 transitions, 885 flow [2023-08-24 11:12:48,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 11:12:48,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 11:12:48,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1091 transitions. [2023-08-24 11:12:48,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4137277208949564 [2023-08-24 11:12:48,224 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1091 transitions. [2023-08-24 11:12:48,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1091 transitions. [2023-08-24 11:12:48,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:12:48,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1091 transitions. [2023-08-24 11:12:48,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 121.22222222222223) internal successors, (1091), 9 states have internal predecessors, (1091), 0 states have call successors, (0), 0 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 11:12:48,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 293.0) internal successors, (2930), 10 states have internal predecessors, (2930), 0 states have call successors, (0), 0 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 11:12:48,233 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 293.0) internal successors, (2930), 10 states have internal predecessors, (2930), 0 states have call successors, (0), 0 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 11:12:48,233 INFO L175 Difference]: Start difference. First operand has 66 places, 58 transitions, 327 flow. Second operand 9 states and 1091 transitions. [2023-08-24 11:12:48,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 135 transitions, 885 flow [2023-08-24 11:12:48,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 135 transitions, 885 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 11:12:48,241 INFO L231 Difference]: Finished difference. Result has 78 places, 64 transitions, 419 flow [2023-08-24 11:12:48,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=327, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=419, PETRI_PLACES=78, PETRI_TRANSITIONS=64} [2023-08-24 11:12:48,243 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 43 predicate places. [2023-08-24 11:12:48,243 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 64 transitions, 419 flow [2023-08-24 11:12:48,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 111.0) internal successors, (1221), 11 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:12:48,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:12:48,243 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:12:48,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 11:12:48,247 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:12:48,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:12:48,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1790252439, now seen corresponding path program 1 times [2023-08-24 11:12:48,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:12:48,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253587054] [2023-08-24 11:12:48,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:12:48,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:12:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:12:48,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 11:12:48,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:12:48,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253587054] [2023-08-24 11:12:48,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253587054] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:12:48,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:12:48,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 11:12:48,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85533273] [2023-08-24 11:12:48,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:12:48,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:12:48,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:12:48,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:12:48,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:12:48,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 293 [2023-08-24 11:12:48,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 64 transitions, 419 flow. Second operand has 7 states, 7 states have (on average 129.42857142857142) internal successors, (906), 7 states have internal predecessors, (906), 0 states have call successors, (0), 0 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 11:12:48,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:12:48,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 293 [2023-08-24 11:12:48,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:12:48,829 INFO L124 PetriNetUnfolderBase]: 1393/2595 cut-off events. [2023-08-24 11:12:48,829 INFO L125 PetriNetUnfolderBase]: For 2184/2184 co-relation queries the response was YES. [2023-08-24 11:12:48,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7489 conditions, 2595 events. 1393/2595 cut-off events. For 2184/2184 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 12907 event pairs, 474 based on Foata normal form. 16/2581 useless extension candidates. Maximal degree in co-relation 5306. Up to 926 conditions per place. [2023-08-24 11:12:48,844 INFO L140 encePairwiseOnDemand]: 285/293 looper letters, 113 selfloop transitions, 20 changer transitions 0/134 dead transitions. [2023-08-24 11:12:48,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 134 transitions, 961 flow [2023-08-24 11:12:48,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 11:12:48,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 11:12:48,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1237 transitions. [2023-08-24 11:12:48,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46909366704588545 [2023-08-24 11:12:48,848 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1237 transitions. [2023-08-24 11:12:48,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1237 transitions. [2023-08-24 11:12:48,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:12:48,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1237 transitions. [2023-08-24 11:12:48,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 137.44444444444446) internal successors, (1237), 9 states have internal predecessors, (1237), 0 states have call successors, (0), 0 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 11:12:48,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 293.0) internal successors, (2930), 10 states have internal predecessors, (2930), 0 states have call successors, (0), 0 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 11:12:48,856 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 293.0) internal successors, (2930), 10 states have internal predecessors, (2930), 0 states have call successors, (0), 0 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 11:12:48,857 INFO L175 Difference]: Start difference. First operand has 78 places, 64 transitions, 419 flow. Second operand 9 states and 1237 transitions. [2023-08-24 11:12:48,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 134 transitions, 961 flow [2023-08-24 11:12:48,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 134 transitions, 931 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-24 11:12:48,864 INFO L231 Difference]: Finished difference. Result has 85 places, 75 transitions, 554 flow [2023-08-24 11:12:48,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=554, PETRI_PLACES=85, PETRI_TRANSITIONS=75} [2023-08-24 11:12:48,865 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 50 predicate places. [2023-08-24 11:12:48,865 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 75 transitions, 554 flow [2023-08-24 11:12:48,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 129.42857142857142) internal successors, (906), 7 states have internal predecessors, (906), 0 states have call successors, (0), 0 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 11:12:48,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:12:48,866 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 11:12:48,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 11:12:48,866 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 11:12:48,866 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:12:48,867 INFO L85 PathProgramCache]: Analyzing trace with hash 566216759, now seen corresponding path program 1 times [2023-08-24 11:12:48,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:12:48,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287792600] [2023-08-24 11:12:48,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:12:48,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:12:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:12:48,887 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 11:12:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:12:48,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 11:12:48,931 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 11:12:48,932 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-24 11:12:48,933 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2023-08-24 11:12:48,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-24 11:12:48,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-08-24 11:12:48,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-08-24 11:12:48,934 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-24 11:12:48,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 11:12:48,935 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:12:48,940 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 11:12:48,940 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 11:12:48,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 11:12:48 BasicIcfg [2023-08-24 11:12:48,992 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 11:12:48,992 INFO L158 Benchmark]: Toolchain (without parser) took 11469.69ms. Allocated memory was 341.8MB in the beginning and 494.9MB in the end (delta: 153.1MB). Free memory was 299.6MB in the beginning and 397.6MB in the end (delta: -98.0MB). Peak memory consumption was 56.1MB. Max. memory is 16.0GB. [2023-08-24 11:12:48,992 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 341.8MB. Free memory is still 318.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 11:12:48,993 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.18ms. Allocated memory is still 341.8MB. Free memory was 299.1MB in the beginning and 313.4MB in the end (delta: -14.3MB). Peak memory consumption was 31.8MB. Max. memory is 16.0GB. [2023-08-24 11:12:48,993 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.92ms. Allocated memory is still 341.8MB. Free memory was 313.4MB in the beginning and 310.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:12:48,993 INFO L158 Benchmark]: Boogie Preprocessor took 25.34ms. Allocated memory is still 341.8MB. Free memory was 310.8MB in the beginning and 308.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:12:48,993 INFO L158 Benchmark]: RCFGBuilder took 393.12ms. Allocated memory is still 341.8MB. Free memory was 308.7MB in the beginning and 290.9MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-24 11:12:48,994 INFO L158 Benchmark]: TraceAbstraction took 10477.40ms. Allocated memory was 341.8MB in the beginning and 494.9MB in the end (delta: 153.1MB). Free memory was 290.1MB in the beginning and 397.6MB in the end (delta: -107.4MB). Peak memory consumption was 45.3MB. Max. memory is 16.0GB. [2023-08-24 11:12:48,995 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.26ms. Allocated memory is still 341.8MB. Free memory is still 318.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 524.18ms. Allocated memory is still 341.8MB. Free memory was 299.1MB in the beginning and 313.4MB in the end (delta: -14.3MB). Peak memory consumption was 31.8MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 43.92ms. Allocated memory is still 341.8MB. Free memory was 313.4MB in the beginning and 310.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 25.34ms. Allocated memory is still 341.8MB. Free memory was 310.8MB in the beginning and 308.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 393.12ms. Allocated memory is still 341.8MB. Free memory was 308.7MB in the beginning and 290.9MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 10477.40ms. Allocated memory was 341.8MB in the beginning and 494.9MB in the end (delta: 153.1MB). Free memory was 290.1MB in the beginning and 397.6MB in the end (delta: -107.4MB). Peak memory consumption was 45.3MB. 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.5s, 144 PlacesBefore, 35 PlacesAfterwards, 147 TransitionsBefore, 33 TransitionsAfterwards, 7334 CoEnabledTransitionPairs, 6 FixpointIterations, 26 TrivialSequentialCompositions, 83 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 21 ConcurrentYvCompositions, 5 ChoiceCompositions, 135 TotalNumberOfCompositions, 10082 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7371, independent: 7178, independent conditional: 0, independent unconditional: 7178, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4167, independent: 4119, independent conditional: 0, independent unconditional: 4119, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7371, independent: 3059, independent conditional: 0, independent unconditional: 3059, dependent: 145, dependent conditional: 0, dependent unconditional: 145, unknown: 4167, unknown conditional: 0, unknown unconditional: 4167] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 162, Positive conditional cache size: 0, Positive unconditional cache size: 162, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 940]: 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[(400)]; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1019] 0 pthread_t id1, id2; [L1021] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1={7:0}, id2={5:0}, m={4:0}, pthread_create(&id1, ((void *)0), t1, ((void *)0))=9, top=0] [L988] 1 int i; [L989] 1 unsigned int tmp; [L990] 1 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1022] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1={7:0}, id2={5:0}, m={4:0}, pthread_create(&id2, ((void *)0), t2, ((void *)0))=10, top=0] [L990] COND TRUE 1 i<(400) [L993] 1 tmp = __VERIFIER_nondet_uint() [L994] CALL 1 assume_abort_if_not(tmp < (400)) [L23] COND FALSE 1 !(!cond) [L994] RET 1 assume_abort_if_not(tmp < (400)) [L995] CALL, EXPR 1 push(arr,tmp) [L1004] 2 int i; [L1005] 2 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L960] COND FALSE 1 !(top==(400)) [L967] CALL, EXPR 1 get_top() [L952] 1 return top; [L967] RET, EXPR 1 get_top() [L967] 1 stack[get_top()] = x [L968] CALL 1 inc_top() [L944] 1 top++ [L968] RET 1 inc_top() [L970] 1 return 0; [L995] RET, EXPR 1 push(arr,tmp) [L995] COND FALSE 1 !(push(arr,tmp)==(-1)) [L997] 1 flag=(1) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=0, top=1] [L990] 1 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, tmp=0, top=1] [L1005] COND TRUE 2 i<(400) [L1008] COND TRUE 2 \read(flag) [L1010] CALL, EXPR 2 pop(arr) [L974] CALL, EXPR 2 get_top() [L952] 2 return top; [L974] RET, EXPR 2 get_top() [L974] COND FALSE 2 !(get_top()==0) [L981] CALL 2 dec_top() [L948] 2 top-- VAL [arr={3:0}, flag=1, m={4:0}, top=0] [L981] RET 2 dec_top() [L982] CALL, EXPR 2 get_top() [L952] 2 return top; VAL [\result=0, \result=0, arr={3:0}, flag=1, m={4:0}, top=0] [L982] RET, EXPR 2 get_top() [L982] EXPR 2 stack[get_top()] [L982] 2 return stack[get_top()]; [L1010] RET, EXPR 2 pop(arr) [L1010] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1005] 2 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1005] COND TRUE 2 i<(400) [L1008] COND TRUE 2 \read(flag) [L1010] CALL, EXPR 2 pop(arr) [L974] CALL, EXPR 2 get_top() [L952] 2 return top; [L974] RET, EXPR 2 get_top() [L974] COND TRUE 2 get_top()==0 [L977] 2 return (-2); [L1010] RET, EXPR 2 pop(arr) [L1010] COND TRUE 2 !(pop(arr)!=(-2)) [L1011] CALL 2 error() [L940] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1021]: 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: 1022]: 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: 940]: 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, 250 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: 10.3s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 504 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 504 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2054 IncrementalHoareTripleChecker+Invalid, 2077 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 0 mSDtfsCounter, 2054 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=554occurred in iteration=9, InterpolantAutomatonStates: 54, 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.1s InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 1523 SizeOfPredicates, 1 NumberOfNonLiveVariables, 188 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 6/12 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 11:12:49,008 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...