/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack_longest-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:15:03,371 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:15:03,459 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 11:15:03,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:15:03,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:15:03,495 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:15:03,495 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:15:03,495 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:15:03,496 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:15:03,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:15:03,500 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:15:03,500 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:15:03,500 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:15:03,501 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:15:03,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:15:03,502 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:15:03,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:15:03,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:15:03,502 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:15:03,503 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:15:03,503 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:15:03,504 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:15:03,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:15:03,504 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:15:03,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:15:03,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:15:03,506 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:15:03,506 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:15:03,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:15:03,506 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:15:03,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:15:03,507 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:15:03,508 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:15:03,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:15:03,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:15:03,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:15:03,790 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:15:03,790 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:15:03,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longest-1.i [2023-11-17 11:15:04,847 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:15:05,123 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:15:05,124 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-1.i [2023-11-17 11:15:05,141 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a80a226a7/ee108a7bd84444e19252b53a205a0b0c/FLAG3f7a2d350 [2023-11-17 11:15:05,157 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a80a226a7/ee108a7bd84444e19252b53a205a0b0c [2023-11-17 11:15:05,159 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:15:05,160 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:15:05,165 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:15:05,165 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:15:05,169 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:15:05,169 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:15:05" (1/1) ... [2023-11-17 11:15:05,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b91b76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:15:05, skipping insertion in model container [2023-11-17 11:15:05,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:15:05" (1/1) ... [2023-11-17 11:15:05,224 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:15:05,653 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_longest-1.i[41530,41543] [2023-11-17 11:15:05,689 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:15:05,700 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:15:05,738 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_longest-1.i[41530,41543] [2023-11-17 11:15:05,753 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:15:05,817 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:15:05,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:15:05 WrapperNode [2023-11-17 11:15:05,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:15:05,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:15:05,821 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:15:05,821 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:15:05,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:15:05" (1/1) ... [2023-11-17 11:15:05,857 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:15:05" (1/1) ... [2023-11-17 11:15:05,891 INFO L138 Inliner]: procedures = 278, calls = 41, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 161 [2023-11-17 11:15:05,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:15:05,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:15:05,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:15:05,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:15:05,900 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:15:05" (1/1) ... [2023-11-17 11:15:05,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:15:05" (1/1) ... [2023-11-17 11:15:05,917 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:15:05" (1/1) ... [2023-11-17 11:15:05,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:15:05" (1/1) ... [2023-11-17 11:15:05,924 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:15:05" (1/1) ... [2023-11-17 11:15:05,926 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:15:05" (1/1) ... [2023-11-17 11:15:05,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:15:05" (1/1) ... [2023-11-17 11:15:05,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:15:05" (1/1) ... [2023-11-17 11:15:05,932 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:15:05,946 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:15:05,946 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:15:05,946 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:15:05,947 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:15:05" (1/1) ... [2023-11-17 11:15:05,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:15:05,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:15:05,982 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 11:15:06,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 11:15:06,019 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-17 11:15:06,020 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-17 11:15:06,020 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-17 11:15:06,020 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-17 11:15:06,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:15:06,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:15:06,021 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-17 11:15:06,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 11:15:06,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:15:06,021 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-17 11:15:06,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:15:06,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:15:06,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:15:06,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:15:06,023 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 11:15:06,201 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:15:06,203 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:15:06,446 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:15:06,690 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:15:06,690 INFO L307 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-17 11:15:06,691 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:15:06 BoogieIcfgContainer [2023-11-17 11:15:06,693 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:15:06,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:15:06,695 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:15:06,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:15:06,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:15:05" (1/3) ... [2023-11-17 11:15:06,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe02e94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:15:06, skipping insertion in model container [2023-11-17 11:15:06,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:15:05" (2/3) ... [2023-11-17 11:15:06,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe02e94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:15:06, skipping insertion in model container [2023-11-17 11:15:06,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:15:06" (3/3) ... [2023-11-17 11:15:06,701 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longest-1.i [2023-11-17 11:15:06,717 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:15:06,717 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 11:15:06,717 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:15:06,784 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-17 11:15:06,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 36 transitions, 86 flow [2023-11-17 11:15:06,852 INFO L124 PetriNetUnfolderBase]: 5/34 cut-off events. [2023-11-17 11:15:06,853 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 11:15:06,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 34 events. 5/34 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 68 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 30. Up to 3 conditions per place. [2023-11-17 11:15:06,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 36 transitions, 86 flow [2023-11-17 11:15:06,863 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 32 transitions, 73 flow [2023-11-17 11:15:06,866 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:15:06,881 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 32 transitions, 73 flow [2023-11-17 11:15:06,885 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 32 transitions, 73 flow [2023-11-17 11:15:06,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 32 transitions, 73 flow [2023-11-17 11:15:06,900 INFO L124 PetriNetUnfolderBase]: 5/32 cut-off events. [2023-11-17 11:15:06,900 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-17 11:15:06,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 32 events. 5/32 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 65 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 30. Up to 3 conditions per place. [2023-11-17 11:15:06,902 INFO L119 LiptonReduction]: Number of co-enabled transitions 462 [2023-11-17 11:15:08,274 INFO L134 LiptonReduction]: Checked pairs total: 1167 [2023-11-17 11:15:08,274 INFO L136 LiptonReduction]: Total number of compositions: 19 [2023-11-17 11:15:08,293 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:15:08,300 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@70bb1af1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:15:08,301 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-17 11:15:08,305 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:15:08,305 INFO L124 PetriNetUnfolderBase]: 1/9 cut-off events. [2023-11-17 11:15:08,305 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:15:08,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:08,306 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-17 11:15:08,306 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:08,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:08,311 INFO L85 PathProgramCache]: Analyzing trace with hash 408446649, now seen corresponding path program 1 times [2023-11-17 11:15:08,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:08,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398817389] [2023-11-17 11:15:08,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:08,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:08,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:08,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:08,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398817389] [2023-11-17 11:15:08,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398817389] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:15:08,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:15:08,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:15:08,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020500959] [2023-11-17 11:15:08,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:15:08,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:15:08,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:08,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:15:08,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:15:08,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 55 [2023-11-17 11:15:08,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 51 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:08,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:08,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 55 [2023-11-17 11:15:08,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:08,771 INFO L124 PetriNetUnfolderBase]: 205/370 cut-off events. [2023-11-17 11:15:08,771 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-17 11:15:08,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 370 events. 205/370 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1333 event pairs, 69 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 644. Up to 209 conditions per place. [2023-11-17 11:15:08,777 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 31 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2023-11-17 11:15:08,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 34 transitions, 149 flow [2023-11-17 11:15:08,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:15:08,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:15:08,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2023-11-17 11:15:08,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38181818181818183 [2023-11-17 11:15:08,790 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 63 transitions. [2023-11-17 11:15:08,790 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 63 transitions. [2023-11-17 11:15:08,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:15:08,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 63 transitions. [2023-11-17 11:15:08,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:08,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:08,801 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:08,802 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 51 flow. Second operand 3 states and 63 transitions. [2023-11-17 11:15:08,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 34 transitions, 149 flow [2023-11-17 11:15:08,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 34 transitions, 141 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 11:15:08,809 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 56 flow [2023-11-17 11:15:08,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2023-11-17 11:15:08,814 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2023-11-17 11:15:08,815 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 56 flow [2023-11-17 11:15:08,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:08,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:08,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:15:08,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:15:08,816 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:08,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:08,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1653680172, now seen corresponding path program 1 times [2023-11-17 11:15:08,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:08,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931137048] [2023-11-17 11:15:08,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:08,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:08,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:08,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:08,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931137048] [2023-11-17 11:15:08,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931137048] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:15:08,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:15:08,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:15:08,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433409764] [2023-11-17 11:15:08,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:15:08,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:15:08,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:08,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:15:08,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:15:08,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 55 [2023-11-17 11:15:08,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:08,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:08,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 55 [2023-11-17 11:15:08,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:09,048 INFO L124 PetriNetUnfolderBase]: 228/395 cut-off events. [2023-11-17 11:15:09,048 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-17 11:15:09,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 870 conditions, 395 events. 228/395 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1348 event pairs, 84 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 692. Up to 241 conditions per place. [2023-11-17 11:15:09,051 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 29 selfloop transitions, 2 changer transitions 3/34 dead transitions. [2023-11-17 11:15:09,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 34 transitions, 153 flow [2023-11-17 11:15:09,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:15:09,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:15:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2023-11-17 11:15:09,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3393939393939394 [2023-11-17 11:15:09,055 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 56 transitions. [2023-11-17 11:15:09,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 56 transitions. [2023-11-17 11:15:09,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:15:09,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 56 transitions. [2023-11-17 11:15:09,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:09,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:09,060 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:09,060 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 56 flow. Second operand 3 states and 56 transitions. [2023-11-17 11:15:09,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 34 transitions, 153 flow [2023-11-17 11:15:09,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 34 transitions, 151 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:15:09,064 INFO L231 Difference]: Finished difference. Result has 27 places, 22 transitions, 66 flow [2023-11-17 11:15:09,064 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=27, PETRI_TRANSITIONS=22} [2023-11-17 11:15:09,065 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 2 predicate places. [2023-11-17 11:15:09,065 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 22 transitions, 66 flow [2023-11-17 11:15:09,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:09,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:09,066 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:15:09,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:15:09,066 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:09,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:09,067 INFO L85 PathProgramCache]: Analyzing trace with hash -724585693, now seen corresponding path program 1 times [2023-11-17 11:15:09,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:09,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237537330] [2023-11-17 11:15:09,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:09,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:09,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:09,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:09,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:09,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237537330] [2023-11-17 11:15:09,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237537330] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:15:09,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374940544] [2023-11-17 11:15:09,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:09,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:15:09,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:15:09,157 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:15:09,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-17 11:15:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:09,297 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-17 11:15:09,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:15:09,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:09,350 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:15:09,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:09,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374940544] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:15:09,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:15:09,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 5 [2023-11-17 11:15:09,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422951857] [2023-11-17 11:15:09,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:15:09,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:15:09,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:09,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:15:09,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:15:09,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 55 [2023-11-17 11:15:09,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 22 transitions, 66 flow. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:09,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:09,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 55 [2023-11-17 11:15:09,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:09,587 INFO L124 PetriNetUnfolderBase]: 478/889 cut-off events. [2023-11-17 11:15:09,587 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-11-17 11:15:09,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1972 conditions, 889 events. 478/889 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3544 event pairs, 67 based on Foata normal form. 0/753 useless extension candidates. Maximal degree in co-relation 1670. Up to 211 conditions per place. [2023-11-17 11:15:09,594 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 73 selfloop transitions, 8 changer transitions 3/86 dead transitions. [2023-11-17 11:15:09,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 86 transitions, 389 flow [2023-11-17 11:15:09,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:15:09,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:15:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 151 transitions. [2023-11-17 11:15:09,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3922077922077922 [2023-11-17 11:15:09,596 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 151 transitions. [2023-11-17 11:15:09,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 151 transitions. [2023-11-17 11:15:09,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:15:09,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 151 transitions. [2023-11-17 11:15:09,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 21.571428571428573) internal successors, (151), 7 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:09,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 55.0) internal successors, (440), 8 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:09,599 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 55.0) internal successors, (440), 8 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:09,600 INFO L175 Difference]: Start difference. First operand has 27 places, 22 transitions, 66 flow. Second operand 7 states and 151 transitions. [2023-11-17 11:15:09,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 86 transitions, 389 flow [2023-11-17 11:15:09,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 86 transitions, 387 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:15:09,602 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 130 flow [2023-11-17 11:15:09,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=130, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-11-17 11:15:09,603 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 11 predicate places. [2023-11-17 11:15:09,603 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 130 flow [2023-11-17 11:15:09,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 7 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:09,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:09,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:15:09,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-17 11:15:09,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:15:09,813 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:09,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:09,814 INFO L85 PathProgramCache]: Analyzing trace with hash 767807075, now seen corresponding path program 1 times [2023-11-17 11:15:09,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:09,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460630763] [2023-11-17 11:15:09,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:09,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:09,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:09,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460630763] [2023-11-17 11:15:09,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460630763] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:15:09,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:15:09,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:15:09,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694499456] [2023-11-17 11:15:09,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:15:09,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:15:09,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:09,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:15:09,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:15:09,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 55 [2023-11-17 11:15:09,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:09,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:09,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 55 [2023-11-17 11:15:09,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:10,037 INFO L124 PetriNetUnfolderBase]: 332/645 cut-off events. [2023-11-17 11:15:10,038 INFO L125 PetriNetUnfolderBase]: For 263/263 co-relation queries the response was YES. [2023-11-17 11:15:10,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1561 conditions, 645 events. 332/645 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2553 event pairs, 112 based on Foata normal form. 0/573 useless extension candidates. Maximal degree in co-relation 1434. Up to 350 conditions per place. [2023-11-17 11:15:10,042 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 30 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2023-11-17 11:15:10,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 36 transitions, 211 flow [2023-11-17 11:15:10,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:15:10,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:15:10,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2023-11-17 11:15:10,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34545454545454546 [2023-11-17 11:15:10,045 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 57 transitions. [2023-11-17 11:15:10,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 57 transitions. [2023-11-17 11:15:10,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:15:10,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 57 transitions. [2023-11-17 11:15:10,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:10,047 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:10,047 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:10,047 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 130 flow. Second operand 3 states and 57 transitions. [2023-11-17 11:15:10,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 36 transitions, 211 flow [2023-11-17 11:15:10,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 36 transitions, 200 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-17 11:15:10,054 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 119 flow [2023-11-17 11:15:10,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2023-11-17 11:15:10,055 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 11 predicate places. [2023-11-17 11:15:10,055 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 119 flow [2023-11-17 11:15:10,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:10,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:10,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:15:10,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:15:10,056 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:10,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:10,056 INFO L85 PathProgramCache]: Analyzing trace with hash -999245951, now seen corresponding path program 1 times [2023-11-17 11:15:10,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:10,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885492783] [2023-11-17 11:15:10,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:10,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:10,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:10,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:10,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885492783] [2023-11-17 11:15:10,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885492783] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:15:10,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:15:10,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:15:10,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313826409] [2023-11-17 11:15:10,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:15:10,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:15:10,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:10,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:15:10,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:15:10,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 55 [2023-11-17 11:15:10,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 119 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:10,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:10,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 55 [2023-11-17 11:15:10,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:10,550 INFO L124 PetriNetUnfolderBase]: 532/1033 cut-off events. [2023-11-17 11:15:10,550 INFO L125 PetriNetUnfolderBase]: For 448/448 co-relation queries the response was YES. [2023-11-17 11:15:10,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2638 conditions, 1033 events. 532/1033 cut-off events. For 448/448 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4671 event pairs, 255 based on Foata normal form. 24/1057 useless extension candidates. Maximal degree in co-relation 1295. Up to 499 conditions per place. [2023-11-17 11:15:10,555 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 46 selfloop transitions, 4 changer transitions 3/55 dead transitions. [2023-11-17 11:15:10,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 55 transitions, 322 flow [2023-11-17 11:15:10,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:15:10,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:15:10,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2023-11-17 11:15:10,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37272727272727274 [2023-11-17 11:15:10,558 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 82 transitions. [2023-11-17 11:15:10,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 82 transitions. [2023-11-17 11:15:10,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:15:10,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 82 transitions. [2023-11-17 11:15:10,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:10,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:10,561 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:10,561 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 119 flow. Second operand 4 states and 82 transitions. [2023-11-17 11:15:10,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 55 transitions, 322 flow [2023-11-17 11:15:10,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 55 transitions, 312 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:15:10,564 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 140 flow [2023-11-17 11:15:10,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2023-11-17 11:15:10,566 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 14 predicate places. [2023-11-17 11:15:10,567 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 140 flow [2023-11-17 11:15:10,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:10,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:10,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:15:10,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:15:10,571 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:10,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:10,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1641974515, now seen corresponding path program 2 times [2023-11-17 11:15:10,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:10,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112685348] [2023-11-17 11:15:10,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:10,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:15:10,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:15:10,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:15:10,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112685348] [2023-11-17 11:15:10,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112685348] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:15:10,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:15:10,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:15:10,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898454571] [2023-11-17 11:15:10,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:15:10,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:15:10,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:15:10,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:15:10,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:15:10,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 55 [2023-11-17 11:15:10,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:10,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:15:10,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 55 [2023-11-17 11:15:10,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:15:11,125 INFO L124 PetriNetUnfolderBase]: 558/1081 cut-off events. [2023-11-17 11:15:11,126 INFO L125 PetriNetUnfolderBase]: For 503/503 co-relation queries the response was YES. [2023-11-17 11:15:11,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2777 conditions, 1081 events. 558/1081 cut-off events. For 503/503 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4883 event pairs, 140 based on Foata normal form. 6/1087 useless extension candidates. Maximal degree in co-relation 1414. Up to 750 conditions per place. [2023-11-17 11:15:11,133 INFO L140 encePairwiseOnDemand]: 51/55 looper letters, 44 selfloop transitions, 5 changer transitions 3/54 dead transitions. [2023-11-17 11:15:11,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 320 flow [2023-11-17 11:15:11,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:15:11,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:15:11,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2023-11-17 11:15:11,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37272727272727274 [2023-11-17 11:15:11,134 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 82 transitions. [2023-11-17 11:15:11,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 82 transitions. [2023-11-17 11:15:11,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:15:11,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 82 transitions. [2023-11-17 11:15:11,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 20.5) internal successors, (82), 4 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:11,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:11,136 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:11,136 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 140 flow. Second operand 4 states and 82 transitions. [2023-11-17 11:15:11,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 54 transitions, 320 flow [2023-11-17 11:15:11,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 54 transitions, 313 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:15:11,139 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 171 flow [2023-11-17 11:15:11,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2023-11-17 11:15:11,140 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 16 predicate places. [2023-11-17 11:15:11,140 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 171 flow [2023-11-17 11:15:11,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 11:15:11,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:15:11,140 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:15:11,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:15:11,141 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:15:11,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:15:11,141 INFO L85 PathProgramCache]: Analyzing trace with hash 2087515455, now seen corresponding path program 1 times [2023-11-17 11:15:11,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:15:11,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402387297] [2023-11-17 11:15:11,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:15:11,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:15:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:15:11,205 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:15:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:15:11,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:15:11,249 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:15:11,250 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-11-17 11:15:11,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2023-11-17 11:15:11,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-11-17 11:15:11,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2023-11-17 11:15:11,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2023-11-17 11:15:11,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-11-17 11:15:11,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:15:11,252 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-11-17 11:15:11,257 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:15:11,257 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:15:11,281 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre48 could not be translated [2023-11-17 11:15:11,283 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre50 could not be translated [2023-11-17 11:15:11,284 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret46 could not be translated [2023-11-17 11:15:11,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:15:11 BasicIcfg [2023-11-17 11:15:11,292 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:15:11,292 INFO L158 Benchmark]: Toolchain (without parser) took 6131.92ms. Allocated memory was 207.6MB in the beginning and 392.2MB in the end (delta: 184.5MB). Free memory was 156.5MB in the beginning and 334.3MB in the end (delta: -177.9MB). Peak memory consumption was 6.9MB. Max. memory is 8.0GB. [2023-11-17 11:15:11,293 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 207.6MB. Free memory is still 160.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:15:11,293 INFO L158 Benchmark]: CACSL2BoogieTranslator took 655.03ms. Allocated memory is still 207.6MB. Free memory was 156.3MB in the beginning and 126.7MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2023-11-17 11:15:11,293 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.06ms. Allocated memory is still 207.6MB. Free memory was 126.7MB in the beginning and 124.0MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-17 11:15:11,294 INFO L158 Benchmark]: Boogie Preprocessor took 39.70ms. Allocated memory is still 207.6MB. Free memory was 124.0MB in the beginning and 122.2MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 11:15:11,294 INFO L158 Benchmark]: RCFGBuilder took 746.86ms. Allocated memory was 207.6MB in the beginning and 314.6MB in the end (delta: 107.0MB). Free memory was 122.0MB in the beginning and 244.4MB in the end (delta: -122.3MB). Peak memory consumption was 15.5MB. Max. memory is 8.0GB. [2023-11-17 11:15:11,294 INFO L158 Benchmark]: TraceAbstraction took 4596.67ms. Allocated memory was 314.6MB in the beginning and 392.2MB in the end (delta: 77.6MB). Free memory was 243.3MB in the beginning and 334.3MB in the end (delta: -91.0MB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:15:11,296 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.13ms. Allocated memory is still 207.6MB. Free memory is still 160.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 655.03ms. Allocated memory is still 207.6MB. Free memory was 156.3MB in the beginning and 126.7MB in the end (delta: 29.6MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 71.06ms. Allocated memory is still 207.6MB. Free memory was 126.7MB in the beginning and 124.0MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.70ms. Allocated memory is still 207.6MB. Free memory was 124.0MB in the beginning and 122.2MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 746.86ms. Allocated memory was 207.6MB in the beginning and 314.6MB in the end (delta: 107.0MB). Free memory was 122.0MB in the beginning and 244.4MB in the end (delta: -122.3MB). Peak memory consumption was 15.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4596.67ms. Allocated memory was 314.6MB in the beginning and 392.2MB in the end (delta: 77.6MB). Free memory was 243.3MB in the beginning and 334.3MB in the end (delta: -91.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre48 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre50 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret46 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.4s, 34 PlacesBefore, 25 PlacesAfterwards, 32 TransitionsBefore, 21 TransitionsAfterwards, 462 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 14 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 19 TotalNumberOfCompositions, 1167 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 676, independent: 607, independent conditional: 0, independent unconditional: 607, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 341, independent: 314, independent conditional: 0, independent unconditional: 314, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 341, independent: 297, independent conditional: 0, independent unconditional: 297, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 44, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 185, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 8, unknown conditional: 0, unknown unconditional: 8] ], Cache Queries: [ total: 676, independent: 293, independent conditional: 0, independent unconditional: 293, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 342, unknown conditional: 0, unknown unconditional: 342] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 63, Positive conditional cache size: 0, Positive unconditional cache size: 63, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 941]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(800)]; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1020] 0 pthread_t id1, id2; [L1022] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1={5:0}, id2={6:0}, m={4:0}, top=0] [L989] 1 int i; [L990] 1 unsigned int tmp; [L991] 1 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L991] COND TRUE 1 i<(800) [L1023] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1={5:0}, id2={6:0}, m={4:0}, top=0] [L1005] 2 int i; [L1006] 2 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L994] 1 tmp = __VERIFIER_nondet_uint() [L995] CALL 1 assume_abort_if_not(tmp < (800)) [L23] COND FALSE 1 !(!cond) [L995] RET 1 assume_abort_if_not(tmp < (800)) [L996] CALL, EXPR 1 push(arr,tmp) [L961] COND FALSE 1 !(top==(800)) [L968] CALL, EXPR 1 get_top() [L953] 1 return top; [L968] RET, EXPR 1 get_top() [L968] 1 stack[get_top()] = x [L969] CALL 1 inc_top() [L945] 1 top++ [L969] RET 1 inc_top() [L971] 1 return 0; [L996] RET, EXPR 1 push(arr,tmp) [L996] COND FALSE 1 !(push(arr,tmp)==(-1)) [L998] 1 flag=(1) VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=799, top=1] [L991] 1 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, tmp=799, top=1] [L1006] COND TRUE 2 i<(800) [L1009] COND TRUE 2 \read(flag) [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; [L975] RET, EXPR 2 get_top() [L975] COND FALSE 2 !(get_top()==0) [L982] CALL 2 dec_top() [L949] 2 top-- [L982] RET 2 dec_top() [L983] CALL, EXPR 2 get_top() [L953] 2 return top; [L983] RET, EXPR 2 get_top() [L983] EXPR 2 stack[get_top()] [L983] 2 return stack[get_top()]; [L1011] RET, EXPR 2 pop(arr) [L1011] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1006] 2 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1006] COND TRUE 2 i<(800) [L1009] COND TRUE 2 \read(flag) [L1011] CALL, EXPR 2 pop(arr) [L975] CALL, EXPR 2 get_top() [L953] 2 return top; [L975] RET, EXPR 2 get_top() [L975] COND TRUE 2 get_top()==0 [L978] 2 return (-2); [L1011] RET, EXPR 2 pop(arr) [L1011] COND TRUE 2 !(pop(arr)!=(-2)) [L1012] CALL 2 error() [L941] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1023]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 941]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 56 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: 4.4s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 162 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 162 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 372 IncrementalHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 1 mSDtfsCounter, 372 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=6, InterpolantAutomatonStates: 24, 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, 1.0s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 636 SizeOfPredicates, 0 NumberOfNonLiveVariables, 148 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 0/6 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-11-17 11:15:11,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...