/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/weaver/bench-exp1x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:43:50,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:43:50,691 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:43:50,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:43:50,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:43:50,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:43:50,726 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:43:50,726 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:43:50,727 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:43:50,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:43:50,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:43:50,732 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:43:50,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:43:50,733 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:43:50,734 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:43:50,734 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:43:50,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:43:50,734 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:43:50,735 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:43:50,735 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:43:50,735 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:43:50,736 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:43:50,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:43:50,736 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:43:50,737 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:43:50,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:43:50,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:43:50,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:43:50,738 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:43:50,738 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:43:50,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:43:50,739 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:43:50,739 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:43:50,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:43:51,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:43:51,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:43:51,026 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:43:51,026 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:43:51,028 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2023-11-17 11:43:52,326 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:43:52,535 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:43:52,538 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2023-11-17 11:43:52,546 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/312b4ff5c/f9d819b88eb4492e991296e4e49c41df/FLAG07f752205 [2023-11-17 11:43:52,566 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/312b4ff5c/f9d819b88eb4492e991296e4e49c41df [2023-11-17 11:43:52,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:43:52,570 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:43:52,573 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:43:52,574 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:43:52,577 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:43:52,578 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:43:52" (1/1) ... [2023-11-17 11:43:52,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7070716f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:52, skipping insertion in model container [2023-11-17 11:43:52,580 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:43:52" (1/1) ... [2023-11-17 11:43:52,603 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:43:52,767 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c[1875,1888] [2023-11-17 11:43:52,771 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:43:52,779 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:43:52,795 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c[1875,1888] [2023-11-17 11:43:52,796 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:43:52,809 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:43:52,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:52 WrapperNode [2023-11-17 11:43:52,810 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:43:52,811 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:43:52,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:43:52,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:43:52,817 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:43:52" (1/1) ... [2023-11-17 11:43:52,823 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:43:52" (1/1) ... [2023-11-17 11:43:52,838 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 59 [2023-11-17 11:43:52,839 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:43:52,840 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:43:52,840 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:43:52,840 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:43:52,851 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:52" (1/1) ... [2023-11-17 11:43:52,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:52" (1/1) ... [2023-11-17 11:43:52,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:52" (1/1) ... [2023-11-17 11:43:52,854 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:52" (1/1) ... [2023-11-17 11:43:52,859 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:52" (1/1) ... [2023-11-17 11:43:52,862 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:52" (1/1) ... [2023-11-17 11:43:52,863 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:52" (1/1) ... [2023-11-17 11:43:52,864 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:52" (1/1) ... [2023-11-17 11:43:52,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:43:52,867 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:43:52,867 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:43:52,867 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:43:52,868 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:52" (1/1) ... [2023-11-17 11:43:52,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:43:52,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:43:52,909 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:43:52,916 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:43:52,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:43:52,933 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 11:43:52,933 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 11:43:52,933 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 11:43:52,933 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 11:43:52,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:43:52,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:43:52,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:43:52,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:43:52,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:43:52,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 11:43:52,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:43:52,935 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:43:53,005 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:43:53,007 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:43:53,238 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:43:53,400 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:43:53,400 INFO L307 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-17 11:43:53,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:43:53 BoogieIcfgContainer [2023-11-17 11:43:53,402 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:43:53,404 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:43:53,404 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:43:53,407 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:43:53,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:43:52" (1/3) ... [2023-11-17 11:43:53,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e31a3af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:43:53, skipping insertion in model container [2023-11-17 11:43:53,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:43:52" (2/3) ... [2023-11-17 11:43:53,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e31a3af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:43:53, skipping insertion in model container [2023-11-17 11:43:53,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:43:53" (3/3) ... [2023-11-17 11:43:53,410 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp1x3.wvr.c [2023-11-17 11:43:53,426 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:43:53,427 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 11:43:53,427 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:43:53,488 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-17 11:43:53,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 19 transitions, 52 flow [2023-11-17 11:43:53,551 INFO L124 PetriNetUnfolderBase]: 2/17 cut-off events. [2023-11-17 11:43:53,551 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 11:43:53,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26 conditions, 17 events. 2/17 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2023-11-17 11:43:53,555 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 19 transitions, 52 flow [2023-11-17 11:43:53,559 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 16 transitions, 44 flow [2023-11-17 11:43:53,562 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:43:53,578 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 16 transitions, 44 flow [2023-11-17 11:43:53,581 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 16 transitions, 44 flow [2023-11-17 11:43:53,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 16 transitions, 44 flow [2023-11-17 11:43:53,593 INFO L124 PetriNetUnfolderBase]: 2/16 cut-off events. [2023-11-17 11:43:53,594 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 11:43:53,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25 conditions, 16 events. 2/16 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 8 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2023-11-17 11:43:53,595 INFO L119 LiptonReduction]: Number of co-enabled transitions 54 [2023-11-17 11:43:53,654 INFO L134 LiptonReduction]: Checked pairs total: 48 [2023-11-17 11:43:53,654 INFO L136 LiptonReduction]: Total number of compositions: 1 [2023-11-17 11:43:53,668 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:43:53,680 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;@727a6f95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:43:53,681 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-17 11:43:53,695 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:43:53,696 INFO L124 PetriNetUnfolderBase]: 2/14 cut-off events. [2023-11-17 11:43:53,696 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 11:43:53,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:43:53,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:43:53,697 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 11:43:53,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:43:53,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1423793746, now seen corresponding path program 1 times [2023-11-17 11:43:53,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:43:53,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387179649] [2023-11-17 11:43:53,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:43:53,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:43:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:43:54,094 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:43:54,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:43:54,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387179649] [2023-11-17 11:43:54,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387179649] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:43:54,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:43:54,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:43:54,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204674714] [2023-11-17 11:43:54,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:43:54,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:43:54,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:43:54,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:43:54,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:43:54,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2023-11-17 11:43:54,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:43:54,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:43:54,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2023-11-17 11:43:54,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:43:54,202 INFO L124 PetriNetUnfolderBase]: 65/114 cut-off events. [2023-11-17 11:43:54,202 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-17 11:43:54,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 114 events. 65/114 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 314 event pairs, 9 based on Foata normal form. 1/76 useless extension candidates. Maximal degree in co-relation 179. Up to 85 conditions per place. [2023-11-17 11:43:54,205 INFO L140 encePairwiseOnDemand]: 16/20 looper letters, 19 selfloop transitions, 3 changer transitions 1/25 dead transitions. [2023-11-17 11:43:54,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 25 transitions, 117 flow [2023-11-17 11:43:54,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:43:54,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:43:54,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2023-11-17 11:43:54,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65 [2023-11-17 11:43:54,215 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 39 transitions. [2023-11-17 11:43:54,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 39 transitions. [2023-11-17 11:43:54,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:43:54,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 39 transitions. [2023-11-17 11:43:54,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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:43:54,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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:43:54,221 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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:43:54,223 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 42 flow. Second operand 3 states and 39 transitions. [2023-11-17 11:43:54,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 25 transitions, 117 flow [2023-11-17 11:43:54,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 25 transitions, 103 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 11:43:54,227 INFO L231 Difference]: Finished difference. Result has 19 places, 17 transitions, 53 flow [2023-11-17 11:43:54,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=19, PETRI_TRANSITIONS=17} [2023-11-17 11:43:54,231 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, -1 predicate places. [2023-11-17 11:43:54,231 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 53 flow [2023-11-17 11:43:54,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:43:54,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:43:54,231 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:43:54,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:43:54,232 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 11:43:54,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:43:54,233 INFO L85 PathProgramCache]: Analyzing trace with hash 358433539, now seen corresponding path program 1 times [2023-11-17 11:43:54,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:43:54,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990434556] [2023-11-17 11:43:54,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:43:54,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:43:54,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:43:54,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:43:54,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:43:54,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990434556] [2023-11-17 11:43:54,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990434556] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:43:54,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:43:54,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:43:54,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813604345] [2023-11-17 11:43:54,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:43:54,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:43:54,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:43:54,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:43:54,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:43:54,413 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2023-11-17 11:43:54,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 53 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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:43:54,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:43:54,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2023-11-17 11:43:54,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:43:54,558 INFO L124 PetriNetUnfolderBase]: 63/111 cut-off events. [2023-11-17 11:43:54,559 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-17 11:43:54,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 111 events. 63/111 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 279 event pairs, 2 based on Foata normal form. 2/111 useless extension candidates. Maximal degree in co-relation 72. Up to 45 conditions per place. [2023-11-17 11:43:54,566 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 24 selfloop transitions, 6 changer transitions 4/36 dead transitions. [2023-11-17 11:43:54,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 36 transitions, 169 flow [2023-11-17 11:43:54,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:43:54,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:43:54,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2023-11-17 11:43:54,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2023-11-17 11:43:54,570 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 60 transitions. [2023-11-17 11:43:54,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 60 transitions. [2023-11-17 11:43:54,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:43:54,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 60 transitions. [2023-11-17 11:43:54,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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:43:54,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 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:43:54,577 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 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:43:54,577 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 53 flow. Second operand 5 states and 60 transitions. [2023-11-17 11:43:54,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 36 transitions, 169 flow [2023-11-17 11:43:54,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 36 transitions, 165 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:43:54,583 INFO L231 Difference]: Finished difference. Result has 23 places, 19 transitions, 74 flow [2023-11-17 11:43:54,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=23, PETRI_TRANSITIONS=19} [2023-11-17 11:43:54,584 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places. [2023-11-17 11:43:54,585 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 74 flow [2023-11-17 11:43:54,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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:43:54,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:43:54,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:43:54,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:43:54,587 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 11:43:54,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:43:54,590 INFO L85 PathProgramCache]: Analyzing trace with hash -834327190, now seen corresponding path program 1 times [2023-11-17 11:43:54,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:43:54,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852101438] [2023-11-17 11:43:54,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:43:54,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:43:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:43:54,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:43:54,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:43:54,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852101438] [2023-11-17 11:43:54,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852101438] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:43:54,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:43:54,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:43:54,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264695631] [2023-11-17 11:43:54,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:43:54,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:43:54,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:43:54,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:43:54,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:43:54,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2023-11-17 11:43:54,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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:43:54,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:43:54,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2023-11-17 11:43:54,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:43:54,851 INFO L124 PetriNetUnfolderBase]: 56/102 cut-off events. [2023-11-17 11:43:54,852 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-17 11:43:54,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 102 events. 56/102 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 261 event pairs, 2 based on Foata normal form. 4/104 useless extension candidates. Maximal degree in co-relation 79. Up to 50 conditions per place. [2023-11-17 11:43:54,853 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 19 selfloop transitions, 4 changer transitions 8/33 dead transitions. [2023-11-17 11:43:54,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 33 transitions, 171 flow [2023-11-17 11:43:54,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:43:54,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:43:54,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2023-11-17 11:43:54,857 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.57 [2023-11-17 11:43:54,857 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 57 transitions. [2023-11-17 11:43:54,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 57 transitions. [2023-11-17 11:43:54,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:43:54,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 57 transitions. [2023-11-17 11:43:54,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 11.4) internal successors, (57), 5 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:43:54,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 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:43:54,860 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 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:43:54,861 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 74 flow. Second operand 5 states and 57 transitions. [2023-11-17 11:43:54,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 33 transitions, 171 flow [2023-11-17 11:43:54,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 33 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:43:54,864 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 68 flow [2023-11-17 11:43:54,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=68, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2023-11-17 11:43:54,866 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 6 predicate places. [2023-11-17 11:43:54,866 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 68 flow [2023-11-17 11:43:54,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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:43:54,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:43:54,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:43:54,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:43:54,867 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 11:43:54,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:43:54,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1974882535, now seen corresponding path program 2 times [2023-11-17 11:43:54,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:43:54,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550464641] [2023-11-17 11:43:54,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:43:54,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:43:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:43:54,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:43:54,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:43:54,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550464641] [2023-11-17 11:43:54,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550464641] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:43:54,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703491685] [2023-11-17 11:43:54,975 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 11:43:54,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:43:54,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:43:54,981 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:43:55,005 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:43:55,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 11:43:55,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:43:55,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-17 11:43:55,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:43:55,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:43:55,239 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:43:55,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:43:55,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703491685] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:43:55,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:43:55,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-11-17 11:43:55,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402537556] [2023-11-17 11:43:55,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:43:55,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:43:55,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:43:55,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:43:55,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:43:55,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2023-11-17 11:43:55,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 68 flow. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:43:55,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:43:55,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2023-11-17 11:43:55,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:43:55,444 INFO L124 PetriNetUnfolderBase]: 44/79 cut-off events. [2023-11-17 11:43:55,445 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-11-17 11:43:55,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 79 events. 44/79 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 151 event pairs, 4 based on Foata normal form. 6/84 useless extension candidates. Maximal degree in co-relation 71. Up to 53 conditions per place. [2023-11-17 11:43:55,450 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 22 selfloop transitions, 6 changer transitions 0/30 dead transitions. [2023-11-17 11:43:55,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 30 transitions, 161 flow [2023-11-17 11:43:55,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:43:55,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:43:55,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2023-11-17 11:43:55,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.55 [2023-11-17 11:43:55,452 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 55 transitions. [2023-11-17 11:43:55,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 55 transitions. [2023-11-17 11:43:55,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:43:55,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 55 transitions. [2023-11-17 11:43:55,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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:43:55,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 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:43:55,454 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 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:43:55,454 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 68 flow. Second operand 5 states and 55 transitions. [2023-11-17 11:43:55,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 30 transitions, 161 flow [2023-11-17 11:43:55,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 30 transitions, 151 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-17 11:43:55,457 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 95 flow [2023-11-17 11:43:55,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=95, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2023-11-17 11:43:55,458 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 8 predicate places. [2023-11-17 11:43:55,458 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 20 transitions, 95 flow [2023-11-17 11:43:55,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 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:43:55,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:43:55,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:43:55,472 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:43:55,665 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-11-17 11:43:55,666 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 11:43:55,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:43:55,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1666878598, now seen corresponding path program 2 times [2023-11-17 11:43:55,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:43:55,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915509842] [2023-11-17 11:43:55,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:43:55,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:43:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:43:55,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:43:55,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:43:55,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915509842] [2023-11-17 11:43:55,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915509842] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:43:55,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644741655] [2023-11-17 11:43:55,755 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 11:43:55,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:43:55,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:43:55,760 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:43:55,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-17 11:43:55,824 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 11:43:55,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:43:55,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-17 11:43:55,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:43:55,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:43:55,920 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:43:55,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:43:55,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644741655] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:43:55,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:43:55,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-11-17 11:43:55,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196422589] [2023-11-17 11:43:55,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:43:55,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:43:55,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:43:55,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:43:55,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:43:55,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2023-11-17 11:43:55,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 20 transitions, 95 flow. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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:43:55,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:43:55,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2023-11-17 11:43:55,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:43:56,066 INFO L124 PetriNetUnfolderBase]: 40/75 cut-off events. [2023-11-17 11:43:56,067 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2023-11-17 11:43:56,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 75 events. 40/75 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 145 event pairs, 4 based on Foata normal form. 4/78 useless extension candidates. Maximal degree in co-relation 121. Up to 61 conditions per place. [2023-11-17 11:43:56,068 INFO L140 encePairwiseOnDemand]: 15/20 looper letters, 21 selfloop transitions, 6 changer transitions 0/29 dead transitions. [2023-11-17 11:43:56,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 29 transitions, 182 flow [2023-11-17 11:43:56,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:43:56,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:43:56,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2023-11-17 11:43:56,069 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.51 [2023-11-17 11:43:56,069 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 51 transitions. [2023-11-17 11:43:56,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 51 transitions. [2023-11-17 11:43:56,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:43:56,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 51 transitions. [2023-11-17 11:43:56,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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:43:56,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 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:43:56,070 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 20.0) internal successors, (120), 6 states have internal predecessors, (120), 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:43:56,071 INFO L175 Difference]: Start difference. First operand has 28 places, 20 transitions, 95 flow. Second operand 5 states and 51 transitions. [2023-11-17 11:43:56,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 29 transitions, 182 flow [2023-11-17 11:43:56,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 177 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-17 11:43:56,073 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 131 flow [2023-11-17 11:43:56,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2023-11-17 11:43:56,073 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 13 predicate places. [2023-11-17 11:43:56,074 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 131 flow [2023-11-17 11:43:56,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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:43:56,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:43:56,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:43:56,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-17 11:43:56,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:43:56,288 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 11:43:56,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:43:56,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1688376483, now seen corresponding path program 1 times [2023-11-17 11:43:56,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:43:56,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660817840] [2023-11-17 11:43:56,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:43:56,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:43:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:43:56,678 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:43:56,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:43:56,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660817840] [2023-11-17 11:43:56,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660817840] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:43:56,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361127873] [2023-11-17 11:43:56,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:43:56,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:43:56,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:43:56,680 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:43:56,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-17 11:43:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:43:56,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-17 11:43:56,909 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:44:02,149 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:44:02,150 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:44:05,995 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:44:05,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361127873] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:44:05,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:44:05,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-11-17 11:44:05,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073471391] [2023-11-17 11:44:05,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:44:05,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-17 11:44:05,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:44:05,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-17 11:44:05,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2023-11-17 11:44:05,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2023-11-17 11:44:06,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 131 flow. Second operand has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 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:44:06,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:44:06,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2023-11-17 11:44:06,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:44:08,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:44:11,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:44:13,829 INFO L124 PetriNetUnfolderBase]: 145/279 cut-off events. [2023-11-17 11:44:13,830 INFO L125 PetriNetUnfolderBase]: For 515/515 co-relation queries the response was YES. [2023-11-17 11:44:13,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1113 conditions, 279 events. 145/279 cut-off events. For 515/515 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1030 event pairs, 4 based on Foata normal form. 7/285 useless extension candidates. Maximal degree in co-relation 622. Up to 93 conditions per place. [2023-11-17 11:44:13,832 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 59 selfloop transitions, 27 changer transitions 18/106 dead transitions. [2023-11-17 11:44:13,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 106 transitions, 732 flow [2023-11-17 11:44:13,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-17 11:44:13,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-17 11:44:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 168 transitions. [2023-11-17 11:44:13,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2023-11-17 11:44:13,835 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 168 transitions. [2023-11-17 11:44:13,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 168 transitions. [2023-11-17 11:44:13,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:44:13,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 168 transitions. [2023-11-17 11:44:13,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 12.0) internal successors, (168), 14 states have internal predecessors, (168), 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:44:13,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 20.0) internal successors, (300), 15 states have internal predecessors, (300), 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:44:13,838 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 20.0) internal successors, (300), 15 states have internal predecessors, (300), 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:44:13,838 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 131 flow. Second operand 14 states and 168 transitions. [2023-11-17 11:44:13,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 106 transitions, 732 flow [2023-11-17 11:44:13,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 106 transitions, 717 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-11-17 11:44:13,844 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 411 flow [2023-11-17 11:44:13,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=411, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2023-11-17 11:44:13,845 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 34 predicate places. [2023-11-17 11:44:13,845 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 411 flow [2023-11-17 11:44:13,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 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:44:13,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:44:13,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:44:13,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-17 11:44:14,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:44:14,059 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 11:44:14,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:44:14,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1845798533, now seen corresponding path program 2 times [2023-11-17 11:44:14,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:44:14,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884257659] [2023-11-17 11:44:14,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:44:14,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:44:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:44:14,415 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:44:14,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:44:14,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884257659] [2023-11-17 11:44:14,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884257659] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:44:14,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058841452] [2023-11-17 11:44:14,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 11:44:14,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:44:14,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:44:14,420 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:44:14,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-17 11:44:14,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 11:44:14,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:44:14,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 11:44:14,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:44:36,683 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:44:36,683 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:44:47,941 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:44:47,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058841452] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:44:47,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:44:47,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-11-17 11:44:47,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428280036] [2023-11-17 11:44:47,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:44:47,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-17 11:44:47,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:44:47,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-17 11:44:47,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=142, Unknown=10, NotChecked=0, Total=210 [2023-11-17 11:44:47,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2023-11-17 11:44:47,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 411 flow. Second operand has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 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:44:47,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:44:47,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2023-11-17 11:44:47,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:45:04,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:45:06,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:45:09,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:45:11,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:45:23,493 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification. DAG size of input: 61 DAG size of output: 47 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-17 11:45:25,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:45:28,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:45:30,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:45:32,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:45:34,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:45:36,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:45:38,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:45:40,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:45:42,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:45:44,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:45:46,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:46:01,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:46:06,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:46:07,060 INFO L124 PetriNetUnfolderBase]: 172/338 cut-off events. [2023-11-17 11:46:07,060 INFO L125 PetriNetUnfolderBase]: For 1584/1584 co-relation queries the response was YES. [2023-11-17 11:46:07,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1749 conditions, 338 events. 172/338 cut-off events. For 1584/1584 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1364 event pairs, 6 based on Foata normal form. 5/342 useless extension candidates. Maximal degree in co-relation 1703. Up to 146 conditions per place. [2023-11-17 11:46:07,063 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 64 selfloop transitions, 27 changer transitions 14/107 dead transitions. [2023-11-17 11:46:07,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 107 transitions, 1030 flow [2023-11-17 11:46:07,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-17 11:46:07,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-17 11:46:07,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 143 transitions. [2023-11-17 11:46:07,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5107142857142857 [2023-11-17 11:46:07,066 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 143 transitions. [2023-11-17 11:46:07,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 143 transitions. [2023-11-17 11:46:07,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:46:07,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 143 transitions. [2023-11-17 11:46:07,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 10.214285714285714) internal successors, (143), 14 states have internal predecessors, (143), 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:46:07,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 20.0) internal successors, (300), 15 states have internal predecessors, (300), 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:46:07,069 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 20.0) internal successors, (300), 15 states have internal predecessors, (300), 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:46:07,069 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 411 flow. Second operand 14 states and 143 transitions. [2023-11-17 11:46:07,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 107 transitions, 1030 flow [2023-11-17 11:46:07,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 107 transitions, 899 flow, removed 64 selfloop flow, removed 2 redundant places. [2023-11-17 11:46:07,079 INFO L231 Difference]: Finished difference. Result has 72 places, 62 transitions, 578 flow [2023-11-17 11:46:07,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=578, PETRI_PLACES=72, PETRI_TRANSITIONS=62} [2023-11-17 11:46:07,080 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 52 predicate places. [2023-11-17 11:46:07,080 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 62 transitions, 578 flow [2023-11-17 11:46:07,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.0) internal successors, (105), 15 states have internal predecessors, (105), 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:46:07,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:46:07,080 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:46:07,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-17 11:46:07,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:46:07,286 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 11:46:07,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:46:07,286 INFO L85 PathProgramCache]: Analyzing trace with hash -56357470, now seen corresponding path program 3 times [2023-11-17 11:46:07,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:46:07,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845277145] [2023-11-17 11:46:07,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:46:07,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:46:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:46:07,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:46:07,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:46:07,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845277145] [2023-11-17 11:46:07,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845277145] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:46:07,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686097983] [2023-11-17 11:46:07,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 11:46:07,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:46:07,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:46:07,413 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:46:07,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-17 11:46:27,020 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-17 11:46:27,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:46:27,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-17 11:46:27,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:47:00,932 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* (- 1) c_~x1~0))) (let ((.cse0 (div .cse3 2)) (.cse1 (mod (* 4294967295 (div .cse3 4)) 4294967296)) (.cse2 (mod c_~n~0 4294967296))) (and (= (mod c_~x2~0 2) 0) (= (mod .cse0 2) 0) (= (mod c_~x1~0 2) 0) (<= 1 .cse1) (<= (+ (mod (* 4294967295 .cse0) 4294967296) 1) .cse2) (<= .cse2 (mod c_~x2~0 4294967296)) (= (mod (* (div (* (- 1) c_~x2~0) 2) 4294967295) 4294967296) .cse1) (<= (+ .cse1 1) .cse2)))) is different from false [2023-11-17 11:47:14,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-17 11:47:14,872 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:47:30,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:47:30,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686097983] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:47:30,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:47:30,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2023-11-17 11:47:30,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205922385] [2023-11-17 11:47:30,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:47:30,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-17 11:47:30,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:47:30,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-17 11:47:30,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=150, Unknown=11, NotChecked=26, Total=240 [2023-11-17 11:47:30,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2023-11-17 11:47:30,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 62 transitions, 578 flow. Second operand has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 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:47:30,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:47:30,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2023-11-17 11:47:30,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:47:33,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:47:42,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:47:44,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:47:48,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:17,041 WARN L293 SmtUtils]: Spent 21.42s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-17 11:48:19,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:21,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:23,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:25,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:27,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:29,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:34,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:36,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:38,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:40,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:42,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:48:44,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:04,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:06,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:14,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:16,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:18,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:20,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:22,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:24,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:27,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:29,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:31,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:33,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:35,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:37,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:39,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:41,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:44,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:49:45,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:50:19,333 WARN L293 SmtUtils]: Spent 22.76s on a formula simplification. DAG size of input: 60 DAG size of output: 60 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-17 11:50:21,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:50:23,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:50:25,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:50:29,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:50:31,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:50:33,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:50:35,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:50:37,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:50:39,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:50:41,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:50:43,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:50:45,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:50:48,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:50:50,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:01,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:03,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:05,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:07,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:10,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:12,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:14,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:16,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:18,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:20,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:22,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:24,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:26,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:29,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:32,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:34,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:56,109 WARN L293 SmtUtils]: Spent 6.62s on a formula simplification. DAG size of input: 50 DAG size of output: 46 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-17 11:51:58,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:51:59,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:02,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:04,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:06,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:09,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:14,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 11:52:17,061 INFO L124 PetriNetUnfolderBase]: 255/513 cut-off events. [2023-11-17 11:52:17,061 INFO L125 PetriNetUnfolderBase]: For 4508/4508 co-relation queries the response was YES. [2023-11-17 11:52:17,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2893 conditions, 513 events. 255/513 cut-off events. For 4508/4508 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2454 event pairs, 8 based on Foata normal form. 23/535 useless extension candidates. Maximal degree in co-relation 2797. Up to 210 conditions per place. [2023-11-17 11:52:17,066 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 102 selfloop transitions, 61 changer transitions 6/171 dead transitions. [2023-11-17 11:52:17,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 171 transitions, 1660 flow [2023-11-17 11:52:17,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-17 11:52:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-11-17 11:52:17,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 257 transitions. [2023-11-17 11:52:17,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5354166666666667 [2023-11-17 11:52:17,068 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 257 transitions. [2023-11-17 11:52:17,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 257 transitions. [2023-11-17 11:52:17,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:52:17,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 257 transitions. [2023-11-17 11:52:17,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 10.708333333333334) internal successors, (257), 24 states have internal predecessors, (257), 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:52:17,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 20.0) internal successors, (500), 25 states have internal predecessors, (500), 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:52:17,072 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 20.0) internal successors, (500), 25 states have internal predecessors, (500), 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:52:17,072 INFO L175 Difference]: Start difference. First operand has 72 places, 62 transitions, 578 flow. Second operand 24 states and 257 transitions. [2023-11-17 11:52:17,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 171 transitions, 1660 flow [2023-11-17 11:52:17,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 171 transitions, 1535 flow, removed 50 selfloop flow, removed 6 redundant places. [2023-11-17 11:52:17,088 INFO L231 Difference]: Finished difference. Result has 98 places, 95 transitions, 1112 flow [2023-11-17 11:52:17,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1112, PETRI_PLACES=98, PETRI_TRANSITIONS=95} [2023-11-17 11:52:17,091 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 78 predicate places. [2023-11-17 11:52:17,092 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 95 transitions, 1112 flow [2023-11-17 11:52:17,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.375) internal successors, (118), 16 states have internal predecessors, (118), 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:52:17,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:52:17,093 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:52:17,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-17 11:52:17,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:52:17,294 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 11:52:17,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:52:17,294 INFO L85 PathProgramCache]: Analyzing trace with hash 645490043, now seen corresponding path program 4 times [2023-11-17 11:52:17,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:52:17,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813208272] [2023-11-17 11:52:17,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:52:17,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:52:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:52:17,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:52:17,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:52:17,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813208272] [2023-11-17 11:52:17,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813208272] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 11:52:17,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861503222] [2023-11-17 11:52:17,431 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 11:52:17,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 11:52:17,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:52:17,432 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 11:52:17,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-17 11:52:21,506 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 11:52:21,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 11:52:21,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-17 11:52:21,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 11:52:38,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:52:38,706 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 11:53:06,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:53:06,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861503222] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 11:53:06,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 11:53:06,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 14 [2023-11-17 11:53:06,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362674727] [2023-11-17 11:53:06,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 11:53:06,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-17 11:53:06,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:53:06,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-17 11:53:06,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=147, Unknown=17, NotChecked=0, Total=210 [2023-11-17 11:53:06,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 20 [2023-11-17 11:53:06,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 95 transitions, 1112 flow. Second operand has 15 states, 15 states have (on average 7.466666666666667) internal successors, (112), 15 states have internal predecessors, (112), 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:53:06,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:53:06,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 20 [2023-11-17 11:53:06,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:53:14,032 WARN L293 SmtUtils]: Spent 7.25s on a formula simplification. DAG size of input: 34 DAG size of output: 9 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-17 11:53:16,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:53:18,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:53:20,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 11:53:23,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-11-17 11:53:29,973 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 11:53:30,008 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 11:53:31,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-17 11:53:31,174 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-11-17 11:53:31,179 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 137 [2023-11-17 11:53:31,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:53:31,181 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-11-17 11:53:31,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:53:31,181 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while executing Executor. [2023-11-17 11:53:31,183 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-11-17 11:53:31,183 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-11-17 11:53:31,183 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1] [2023-11-17 11:53:31,186 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:53:31,186 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:53:31,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:53:31 BasicIcfg [2023-11-17 11:53:31,188 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:53:31,189 INFO L158 Benchmark]: Toolchain (without parser) took 578619.10ms. Allocated memory was 326.1MB in the beginning and 392.2MB in the end (delta: 66.1MB). Free memory was 272.7MB in the beginning and 253.6MB in the end (delta: 19.1MB). Peak memory consumption was 86.2MB. Max. memory is 8.0GB. [2023-11-17 11:53:31,189 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 187.7MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:53:31,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.50ms. Allocated memory is still 326.1MB. Free memory was 272.3MB in the beginning and 261.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-11-17 11:53:31,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.49ms. Allocated memory is still 326.1MB. Free memory was 261.4MB in the beginning and 260.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 11:53:31,189 INFO L158 Benchmark]: Boogie Preprocessor took 26.60ms. Allocated memory is still 326.1MB. Free memory was 260.2MB in the beginning and 258.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:53:31,190 INFO L158 Benchmark]: RCFGBuilder took 535.18ms. Allocated memory is still 326.1MB. Free memory was 258.7MB in the beginning and 236.3MB in the end (delta: 22.4MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-11-17 11:53:31,190 INFO L158 Benchmark]: TraceAbstraction took 577784.04ms. Allocated memory was 326.1MB in the beginning and 392.2MB in the end (delta: 66.1MB). Free memory was 235.6MB in the beginning and 253.6MB in the end (delta: -18.0MB). Peak memory consumption was 48.5MB. Max. memory is 8.0GB. [2023-11-17 11:53:31,191 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.17ms. Allocated memory is still 187.7MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 236.50ms. Allocated memory is still 326.1MB. Free memory was 272.3MB in the beginning and 261.4MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.49ms. Allocated memory is still 326.1MB. Free memory was 261.4MB in the beginning and 260.2MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.60ms. Allocated memory is still 326.1MB. Free memory was 260.2MB in the beginning and 258.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 535.18ms. Allocated memory is still 326.1MB. Free memory was 258.7MB in the beginning and 236.3MB in the end (delta: 22.4MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 577784.04ms. Allocated memory was 326.1MB in the beginning and 392.2MB in the end (delta: 66.1MB). Free memory was 235.6MB in the beginning and 253.6MB in the end (delta: -18.0MB). Peak memory consumption was 48.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 21 PlacesBefore, 20 PlacesAfterwards, 16 TransitionsBefore, 15 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 1 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 48 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 48, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 24, unknown conditional: 0, unknown unconditional: 24] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 26 locations, 3 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: 577.7s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 398.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 83 mSolverCounterUnknown, 319 SdHoareTripleChecker+Valid, 217.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 319 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 216.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 131 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1283 IncrementalHoareTripleChecker+Invalid, 1557 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 0 mSDtfsCounter, 1283 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 235 GetRequests, 125 SyntacticMatches, 11 SemanticMatches, 98 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 275.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1112occurred in iteration=8, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 24.1s SatisfiabilityAnalysisTime, 153.0s InterpolantComputationTime, 221 NumberOfCodeBlocks, 221 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 290 ConstructedInterpolants, 0 QuantifiedInterpolants, 6575 SizeOfPredicates, 9 NumberOfNonLiveVariables, 678 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 8/44 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown