/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/popl20-two-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 12:35:56,063 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 12:35:56,144 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 12:35:56,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 12:35:56,177 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 12:35:56,177 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 12:35:56,178 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 12:35:56,178 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 12:35:56,179 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 12:35:56,182 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 12:35:56,183 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 12:35:56,183 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 12:35:56,183 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 12:35:56,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 12:35:56,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 12:35:56,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 12:35:56,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 12:35:56,185 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 12:35:56,185 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 12:35:56,186 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 12:35:56,186 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 12:35:56,187 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 12:35:56,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 12:35:56,187 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 12:35:56,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 12:35:56,188 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 12:35:56,188 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 12:35:56,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 12:35:56,188 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 12:35:56,189 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 12:35:56,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 12:35:56,190 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 12:35:56,190 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 12:35:56,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 12:35:56,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 12:35:56,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 12:35:56,460 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 12:35:56,460 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 12:35:56,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-11-17 12:35:57,617 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 12:35:57,816 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 12:35:57,816 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-11-17 12:35:57,823 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f1a7d2c5/2e8f6b1a2bd74931b36b8fbda659909a/FLAG016732420 [2023-11-17 12:35:57,834 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f1a7d2c5/2e8f6b1a2bd74931b36b8fbda659909a [2023-11-17 12:35:57,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 12:35:57,837 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 12:35:57,838 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 12:35:57,838 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 12:35:57,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 12:35:57,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:35:57" (1/1) ... [2023-11-17 12:35:57,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c5ce1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:57, skipping insertion in model container [2023-11-17 12:35:57,843 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:35:57" (1/1) ... [2023-11-17 12:35:57,864 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 12:35:58,024 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/popl20-two-queue.wvr.c[3013,3026] [2023-11-17 12:35:58,032 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 12:35:58,045 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 12:35:58,064 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/popl20-two-queue.wvr.c[3013,3026] [2023-11-17 12:35:58,067 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 12:35:58,074 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 12:35:58,074 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 12:35:58,080 INFO L206 MainTranslator]: Completed translation [2023-11-17 12:35:58,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:58 WrapperNode [2023-11-17 12:35:58,081 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 12:35:58,082 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 12:35:58,082 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 12:35:58,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 12:35:58,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:58" (1/1) ... [2023-11-17 12:35:58,095 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:58" (1/1) ... [2023-11-17 12:35:58,120 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 210 [2023-11-17 12:35:58,120 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 12:35:58,121 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 12:35:58,121 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 12:35:58,121 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 12:35:58,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:58" (1/1) ... [2023-11-17 12:35:58,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:58" (1/1) ... [2023-11-17 12:35:58,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:58" (1/1) ... [2023-11-17 12:35:58,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:58" (1/1) ... [2023-11-17 12:35:58,148 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:58" (1/1) ... [2023-11-17 12:35:58,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:58" (1/1) ... [2023-11-17 12:35:58,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:58" (1/1) ... [2023-11-17 12:35:58,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:58" (1/1) ... [2023-11-17 12:35:58,157 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 12:35:58,158 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 12:35:58,158 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 12:35:58,158 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 12:35:58,159 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:58" (1/1) ... [2023-11-17 12:35:58,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 12:35:58,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:35:58,194 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 12:35:58,205 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 12:35:58,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 12:35:58,216 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 12:35:58,217 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 12:35:58,217 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 12:35:58,217 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 12:35:58,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 12:35:58,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 12:35:58,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 12:35:58,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 12:35:58,217 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 12:35:58,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 12:35:58,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 12:35:58,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 12:35:58,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 12:35:58,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 12:35:58,219 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 12:35:58,304 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 12:35:58,306 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 12:35:58,705 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 12:35:58,984 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 12:35:58,984 INFO L307 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-17 12:35:58,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:35:58 BoogieIcfgContainer [2023-11-17 12:35:58,986 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 12:35:58,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 12:35:58,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 12:35:58,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 12:35:58,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:35:57" (1/3) ... [2023-11-17 12:35:58,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7082f2be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:35:58, skipping insertion in model container [2023-11-17 12:35:58,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:35:58" (2/3) ... [2023-11-17 12:35:58,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7082f2be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:35:58, skipping insertion in model container [2023-11-17 12:35:58,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:35:58" (3/3) ... [2023-11-17 12:35:58,999 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2023-11-17 12:35:59,012 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 12:35:59,012 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 12:35:59,012 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 12:35:59,058 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-17 12:35:59,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 72 flow [2023-11-17 12:35:59,128 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2023-11-17 12:35:59,128 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 12:35:59,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 4/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2023-11-17 12:35:59,132 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 72 flow [2023-11-17 12:35:59,135 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 64 flow [2023-11-17 12:35:59,138 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 12:35:59,147 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 26 transitions, 64 flow [2023-11-17 12:35:59,149 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 26 transitions, 64 flow [2023-11-17 12:35:59,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 26 transitions, 64 flow [2023-11-17 12:35:59,159 INFO L124 PetriNetUnfolderBase]: 4/26 cut-off events. [2023-11-17 12:35:59,159 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 12:35:59,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 26 events. 4/26 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 17. Up to 2 conditions per place. [2023-11-17 12:35:59,160 INFO L119 LiptonReduction]: Number of co-enabled transitions 144 [2023-11-17 12:35:59,520 INFO L134 LiptonReduction]: Checked pairs total: 173 [2023-11-17 12:35:59,520 INFO L136 LiptonReduction]: Total number of compositions: 5 [2023-11-17 12:35:59,542 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 12:35:59,548 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;@4238d10e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 12:35:59,549 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-17 12:35:59,559 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 12:35:59,559 INFO L124 PetriNetUnfolderBase]: 4/20 cut-off events. [2023-11-17 12:35:59,559 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 12:35:59,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:35:59,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:35:59,560 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 12:35:59,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:35:59,565 INFO L85 PathProgramCache]: Analyzing trace with hash -118756635, now seen corresponding path program 1 times [2023-11-17 12:35:59,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:35:59,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294379061] [2023-11-17 12:35:59,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:35:59,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:35:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:35:59,969 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 12:35:59,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:35:59,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294379061] [2023-11-17 12:35:59,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294379061] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:35:59,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:35:59,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 12:35:59,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509963573] [2023-11-17 12:35:59,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:35:59,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 12:35:59,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:36:00,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 12:36:00,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 12:36:00,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2023-11-17 12:36:00,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 21 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:36:00,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:36:00,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2023-11-17 12:36:00,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:36:00,114 INFO L124 PetriNetUnfolderBase]: 115/199 cut-off events. [2023-11-17 12:36:00,115 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-17 12:36:00,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 199 events. 115/199 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 701 event pairs, 24 based on Foata normal form. 1/148 useless extension candidates. Maximal degree in co-relation 328. Up to 136 conditions per place. [2023-11-17 12:36:00,124 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 27 selfloop transitions, 3 changer transitions 1/33 dead transitions. [2023-11-17 12:36:00,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 33 transitions, 149 flow [2023-11-17 12:36:00,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 12:36:00,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 12:36:00,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2023-11-17 12:36:00,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46078431372549017 [2023-11-17 12:36:00,137 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 47 transitions. [2023-11-17 12:36:00,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 47 transitions. [2023-11-17 12:36:00,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:36:00,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 47 transitions. [2023-11-17 12:36:00,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:36:00,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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 12:36:00,147 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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 12:36:00,148 INFO L175 Difference]: Start difference. First operand has 24 places, 21 transitions, 54 flow. Second operand 3 states and 47 transitions. [2023-11-17 12:36:00,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 33 transitions, 149 flow [2023-11-17 12:36:00,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 33 transitions, 135 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 12:36:00,155 INFO L231 Difference]: Finished difference. Result has 23 places, 23 transitions, 65 flow [2023-11-17 12:36:00,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=23, PETRI_TRANSITIONS=23} [2023-11-17 12:36:00,163 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2023-11-17 12:36:00,163 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 23 transitions, 65 flow [2023-11-17 12:36:00,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:36:00,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:36:00,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:36:00,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 12:36:00,164 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 12:36:00,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:36:00,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1302486397, now seen corresponding path program 1 times [2023-11-17 12:36:00,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:36:00,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355500652] [2023-11-17 12:36:00,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:36:00,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:36:00,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:36:00,299 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 12:36:00,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:36:00,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355500652] [2023-11-17 12:36:00,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355500652] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:36:00,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:36:00,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 12:36:00,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213138999] [2023-11-17 12:36:00,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:36:00,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 12:36:00,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:36:00,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 12:36:00,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 12:36:00,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2023-11-17 12:36:00,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 23 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 12:36:00,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:36:00,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2023-11-17 12:36:00,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:36:00,361 INFO L124 PetriNetUnfolderBase]: 84/154 cut-off events. [2023-11-17 12:36:00,361 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-17 12:36:00,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 154 events. 84/154 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 475 event pairs, 17 based on Foata normal form. 6/120 useless extension candidates. Maximal degree in co-relation 126. Up to 108 conditions per place. [2023-11-17 12:36:00,362 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 25 selfloop transitions, 2 changer transitions 2/31 dead transitions. [2023-11-17 12:36:00,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 31 transitions, 141 flow [2023-11-17 12:36:00,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 12:36:00,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 12:36:00,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2023-11-17 12:36:00,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4803921568627451 [2023-11-17 12:36:00,364 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 49 transitions. [2023-11-17 12:36:00,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 49 transitions. [2023-11-17 12:36:00,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:36:00,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 49 transitions. [2023-11-17 12:36:00,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 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 12:36:00,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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 12:36:00,366 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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 12:36:00,366 INFO L175 Difference]: Start difference. First operand has 23 places, 23 transitions, 65 flow. Second operand 3 states and 49 transitions. [2023-11-17 12:36:00,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 31 transitions, 141 flow [2023-11-17 12:36:00,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 31 transitions, 138 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 12:36:00,368 INFO L231 Difference]: Finished difference. Result has 25 places, 24 transitions, 74 flow [2023-11-17 12:36:00,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=25, PETRI_TRANSITIONS=24} [2023-11-17 12:36:00,368 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 1 predicate places. [2023-11-17 12:36:00,369 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 24 transitions, 74 flow [2023-11-17 12:36:00,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 12:36:00,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:36:00,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:36:00,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 12:36:00,369 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 12:36:00,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:36:00,370 INFO L85 PathProgramCache]: Analyzing trace with hash -218942041, now seen corresponding path program 1 times [2023-11-17 12:36:00,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:36:00,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351713682] [2023-11-17 12:36:00,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:36:00,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:36:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:36:00,453 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 12:36:00,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:36:00,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351713682] [2023-11-17 12:36:00,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351713682] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:36:00,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:36:00,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 12:36:00,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319474565] [2023-11-17 12:36:00,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:36:00,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 12:36:00,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:36:00,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 12:36:00,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 12:36:00,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2023-11-17 12:36:00,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 24 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 12:36:00,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:36:00,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2023-11-17 12:36:00,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:36:00,525 INFO L124 PetriNetUnfolderBase]: 63/126 cut-off events. [2023-11-17 12:36:00,525 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-17 12:36:00,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 126 events. 63/126 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 353 event pairs, 21 based on Foata normal form. 6/116 useless extension candidates. Maximal degree in co-relation 168. Up to 81 conditions per place. [2023-11-17 12:36:00,529 INFO L140 encePairwiseOnDemand]: 31/34 looper letters, 25 selfloop transitions, 2 changer transitions 5/34 dead transitions. [2023-11-17 12:36:00,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 34 transitions, 164 flow [2023-11-17 12:36:00,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 12:36:00,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 12:36:00,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2023-11-17 12:36:00,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-17 12:36:00,532 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 51 transitions. [2023-11-17 12:36:00,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 51 transitions. [2023-11-17 12:36:00,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:36:00,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 51 transitions. [2023-11-17 12:36:00,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 17.0) internal successors, (51), 3 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 12:36:00,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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 12:36:00,535 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 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 12:36:00,535 INFO L175 Difference]: Start difference. First operand has 25 places, 24 transitions, 74 flow. Second operand 3 states and 51 transitions. [2023-11-17 12:36:00,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 34 transitions, 164 flow [2023-11-17 12:36:00,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 34 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 12:36:00,537 INFO L231 Difference]: Finished difference. Result has 27 places, 25 transitions, 84 flow [2023-11-17 12:36:00,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=27, PETRI_TRANSITIONS=25} [2023-11-17 12:36:00,539 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 3 predicate places. [2023-11-17 12:36:00,539 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 25 transitions, 84 flow [2023-11-17 12:36:00,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 12:36:00,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:36:00,539 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:36:00,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 12:36:00,540 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 12:36:00,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:36:00,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1243736429, now seen corresponding path program 1 times [2023-11-17 12:36:00,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:36:00,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338854025] [2023-11-17 12:36:00,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:36:00,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:36:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:36:00,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:36:00,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:36:00,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338854025] [2023-11-17 12:36:00,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338854025] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:36:00,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:36:00,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 12:36:00,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708606646] [2023-11-17 12:36:00,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:36:00,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 12:36:00,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:36:00,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 12:36:00,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 12:36:00,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2023-11-17 12:36:00,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 25 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 12:36:00,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:36:00,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2023-11-17 12:36:00,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:36:00,795 INFO L124 PetriNetUnfolderBase]: 79/173 cut-off events. [2023-11-17 12:36:00,795 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-11-17 12:36:00,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 173 events. 79/173 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 640 event pairs, 56 based on Foata normal form. 8/177 useless extension candidates. Maximal degree in co-relation 254. Up to 124 conditions per place. [2023-11-17 12:36:00,797 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 22 selfloop transitions, 2 changer transitions 13/39 dead transitions. [2023-11-17 12:36:00,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 39 transitions, 193 flow [2023-11-17 12:36:00,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 12:36:00,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 12:36:00,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2023-11-17 12:36:00,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45588235294117646 [2023-11-17 12:36:00,799 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 62 transitions. [2023-11-17 12:36:00,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 62 transitions. [2023-11-17 12:36:00,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:36:00,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 62 transitions. [2023-11-17 12:36:00,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 12:36:00,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 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 12:36:00,801 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 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 12:36:00,801 INFO L175 Difference]: Start difference. First operand has 27 places, 25 transitions, 84 flow. Second operand 4 states and 62 transitions. [2023-11-17 12:36:00,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 39 transitions, 193 flow [2023-11-17 12:36:00,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 39 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 12:36:00,803 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 96 flow [2023-11-17 12:36:00,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2023-11-17 12:36:00,805 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 7 predicate places. [2023-11-17 12:36:00,805 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 96 flow [2023-11-17 12:36:00,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 12:36:00,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:36:00,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:36:00,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 12:36:00,806 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 12:36:00,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:36:00,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1288987833, now seen corresponding path program 1 times [2023-11-17 12:36:00,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:36:00,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324855317] [2023-11-17 12:36:00,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:36:00,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:36:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:36:00,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 12:36:00,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:36:00,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324855317] [2023-11-17 12:36:00,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324855317] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:36:00,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:36:00,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 12:36:00,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301480157] [2023-11-17 12:36:00,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:36:00,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 12:36:00,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:36:00,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 12:36:00,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 12:36:00,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 34 [2023-11-17 12:36:00,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 12:36:00,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:36:00,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 34 [2023-11-17 12:36:00,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:36:01,020 INFO L124 PetriNetUnfolderBase]: 78/171 cut-off events. [2023-11-17 12:36:01,021 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2023-11-17 12:36:01,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 171 events. 78/171 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 629 event pairs, 56 based on Foata normal form. 8/176 useless extension candidates. Maximal degree in co-relation 413. Up to 125 conditions per place. [2023-11-17 12:36:01,026 INFO L140 encePairwiseOnDemand]: 30/34 looper letters, 23 selfloop transitions, 2 changer transitions 11/38 dead transitions. [2023-11-17 12:36:01,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 38 transitions, 200 flow [2023-11-17 12:36:01,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 12:36:01,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 12:36:01,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2023-11-17 12:36:01,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4411764705882353 [2023-11-17 12:36:01,029 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 60 transitions. [2023-11-17 12:36:01,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 60 transitions. [2023-11-17 12:36:01,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:36:01,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 60 transitions. [2023-11-17 12:36:01,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 15.0) internal successors, (60), 4 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 12:36:01,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 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 12:36:01,032 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 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 12:36:01,032 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 96 flow. Second operand 4 states and 60 transitions. [2023-11-17 12:36:01,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 38 transitions, 200 flow [2023-11-17 12:36:01,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 192 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-17 12:36:01,036 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 104 flow [2023-11-17 12:36:01,036 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=104, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2023-11-17 12:36:01,038 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 9 predicate places. [2023-11-17 12:36:01,038 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 104 flow [2023-11-17 12:36:01,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 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 12:36:01,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:36:01,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:36:01,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 12:36:01,039 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 12:36:01,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:36:01,039 INFO L85 PathProgramCache]: Analyzing trace with hash -198141600, now seen corresponding path program 1 times [2023-11-17 12:36:01,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:36:01,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273191033] [2023-11-17 12:36:01,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:36:01,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:36:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:36:02,627 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 12:36:02,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:36:02,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273191033] [2023-11-17 12:36:02,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273191033] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:36:02,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828598935] [2023-11-17 12:36:02,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:36:02,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:36:02,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:36:02,631 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 12:36:02,644 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 12:36:02,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:36:02,767 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 37 conjunts are in the unsatisfiable core [2023-11-17 12:36:02,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:36:03,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:36:03,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-11-17 12:36:03,540 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-17 12:36:03,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 22 [2023-11-17 12:36:03,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:36:03,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:36:04,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:36:04,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 384 [2023-11-17 12:36:04,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:36:04,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 174 [2023-11-17 12:36:04,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:36:04,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 156 [2023-11-17 12:37:40,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:37:40,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828598935] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:37:40,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:37:40,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 33 [2023-11-17 12:37:40,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499368898] [2023-11-17 12:37:40,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:37:40,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-17 12:37:40,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:37:40,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-17 12:37:40,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1083, Unknown=4, NotChecked=0, Total=1190 [2023-11-17 12:37:40,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2023-11-17 12:37:40,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 104 flow. Second operand has 35 states, 35 states have (on average 6.571428571428571) internal successors, (230), 35 states have internal predecessors, (230), 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 12:37:40,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:37:40,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2023-11-17 12:37:40,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:37:44,121 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 [1] [2023-11-17 12:37:51,176 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 [1] [2023-11-17 12:37:52,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:37:54,244 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 [1] [2023-11-17 12:37:55,147 INFO L124 PetriNetUnfolderBase]: 403/804 cut-off events. [2023-11-17 12:37:55,147 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2023-11-17 12:37:55,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2057 conditions, 804 events. 403/804 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4213 event pairs, 42 based on Foata normal form. 15/814 useless extension candidates. Maximal degree in co-relation 1627. Up to 201 conditions per place. [2023-11-17 12:37:55,152 INFO L140 encePairwiseOnDemand]: 21/34 looper letters, 136 selfloop transitions, 129 changer transitions 63/330 dead transitions. [2023-11-17 12:37:55,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 330 transitions, 1680 flow [2023-11-17 12:37:55,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-11-17 12:37:55,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2023-11-17 12:37:55,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 684 transitions. [2023-11-17 12:37:55,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28739495798319326 [2023-11-17 12:37:55,158 INFO L72 ComplementDD]: Start complementDD. Operand 70 states and 684 transitions. [2023-11-17 12:37:55,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 684 transitions. [2023-11-17 12:37:55,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:37:55,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 70 states and 684 transitions. [2023-11-17 12:37:55,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 71 states, 70 states have (on average 9.771428571428572) internal successors, (684), 70 states have internal predecessors, (684), 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 12:37:55,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 71 states, 71 states have (on average 34.0) internal successors, (2414), 71 states have internal predecessors, (2414), 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 12:37:55,166 INFO L81 ComplementDD]: Finished complementDD. Result has 71 states, 71 states have (on average 34.0) internal successors, (2414), 71 states have internal predecessors, (2414), 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 12:37:55,166 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 104 flow. Second operand 70 states and 684 transitions. [2023-11-17 12:37:55,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 330 transitions, 1680 flow [2023-11-17 12:37:55,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 330 transitions, 1660 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-11-17 12:37:55,173 INFO L231 Difference]: Finished difference. Result has 119 places, 146 transitions, 969 flow [2023-11-17 12:37:55,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=969, PETRI_PLACES=119, PETRI_TRANSITIONS=146} [2023-11-17 12:37:55,174 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 95 predicate places. [2023-11-17 12:37:55,174 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 146 transitions, 969 flow [2023-11-17 12:37:55,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 6.571428571428571) internal successors, (230), 35 states have internal predecessors, (230), 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 12:37:55,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:37:55,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:37:55,181 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 12:37:55,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-17 12:37:55,382 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 12:37:55,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:37:55,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1020776494, now seen corresponding path program 2 times [2023-11-17 12:37:55,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:37:55,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858872034] [2023-11-17 12:37:55,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:37:55,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:37:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:37:56,902 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 12:37:56,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:37:56,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858872034] [2023-11-17 12:37:56,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858872034] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:37:56,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874971319] [2023-11-17 12:37:56,903 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 12:37:56,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:37:56,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:37:56,904 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 12:37:56,908 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 12:37:56,989 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 12:37:56,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:37:56,992 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-17 12:37:56,995 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:37:57,018 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-17 12:37:57,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-11-17 12:37:57,045 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-17 12:37:57,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-17 12:37:57,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-17 12:37:57,278 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:37:57,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-17 12:37:57,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 12:37:57,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:37:57,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:37:57,969 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 12:37:57,969 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:37:59,658 INFO L349 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2023-11-17 12:37:59,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 239 treesize of output 113 [2023-11-17 12:37:59,793 INFO L349 Elim1Store]: treesize reduction 4, result has 96.9 percent of original size [2023-11-17 12:37:59,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 619 treesize of output 661 [2023-11-17 12:37:59,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:37:59,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 495 treesize of output 459 [2023-11-17 12:37:59,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:37:59,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 366 treesize of output 382 [2023-11-17 12:38:59,192 INFO L349 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2023-11-17 12:38:59,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 195 treesize of output 101 [2023-11-17 12:38:59,360 INFO L349 Elim1Store]: treesize reduction 4, result has 96.9 percent of original size [2023-11-17 12:38:59,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 289 treesize of output 379 [2023-11-17 12:38:59,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:38:59,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 237 treesize of output 269 [2023-11-17 12:38:59,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:38:59,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 155 treesize of output 205 [2023-11-17 12:39:20,690 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 12:39:20,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874971319] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:39:20,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:39:20,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 33 [2023-11-17 12:39:20,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940921736] [2023-11-17 12:39:20,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:39:20,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-17 12:39:20,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:39:20,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-17 12:39:20,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1039, Unknown=3, NotChecked=0, Total=1190 [2023-11-17 12:39:20,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 34 [2023-11-17 12:39:20,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 146 transitions, 969 flow. Second operand has 35 states, 35 states have (on average 6.514285714285714) internal successors, (228), 35 states have internal predecessors, (228), 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 12:39:20,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:39:20,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 34 [2023-11-17 12:39:20,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:39:24,261 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 [1] [2023-11-17 12:39:25,538 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse54 (* c_~q2_back~0 4)) (.cse55 (* c_~q2_front~0 4))) (let ((.cse4 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse23 (+ c_~q2~0.offset .cse55)) (.cse22 (+ .cse54 c_~q2~0.offset)) (.cse30 (not (= c_~q2_back~0 0))) (.cse32 (= c_~q2_front~0 0)) (.cse0 (< c_~n1~0 (+ c_~q1_front~0 1))) (.cse1 (< c_~q2_back~0 0)) (.cse2 (< c_~n1~0 (+ c_~q1_back~0 1))) (.cse3 (< c_~q1_front~0 0)) (.cse5 (< c_~q1_back~0 0)) (.cse6 (< c_~n2~0 (+ c_~q2_back~0 1))) (.cse12 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse9 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse19 (+ c_~i~0 1)) (.cse14 (+ .cse55 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse11 (+ .cse54 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (= c_~q2~0.offset 0) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (let ((.cse15 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse16 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_106| Int) (v_ArrVal_135 (Array Int Int)) (v_ArrVal_134 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse15 .cse16 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_106|)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_134) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse10 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse7 (select .cse10 .cse14)) (.cse8 (select .cse13 c_~q1~0.base))) (or (< .cse7 c_~i~0) (< .cse7 (+ (select .cse8 .cse9) 1)) (not (= c_~i~0 (select .cse10 .cse11))) (not (= c_~j~0 (select .cse8 .cse12)))))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_106| Int) (v_ArrVal_135 (Array Int Int)) (v_ArrVal_134 (Array Int Int))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse15 .cse16 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_106|)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_134) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse17 (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse18 (select .cse20 c_~q1~0.base))) (or (< (select .cse17 .cse14) c_~i~0) (not (= c_~i~0 (select .cse17 .cse11))) (not (= c_~j~0 (select .cse18 .cse12))) (< (select .cse18 .cse9) .cse19)))))))) (= c_~q1~0.offset 0) (= c_~j~0 c_~i~0) (or .cse0 .cse1 .cse2 .cse3 (and (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse21 (select .cse25 c_~q2~0.base)) (.cse24 (select .cse25 c_~q1~0.base))) (or (not (= (select .cse21 .cse22) c_~i~0)) (< (select .cse21 .cse23) c_~i~0) (< (select .cse24 .cse9) .cse19) (not (= (select .cse24 .cse12) c_~j~0)))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse26 (select .cse29 c_~q2~0.base))) (let ((.cse27 (select .cse26 .cse23)) (.cse28 (select .cse29 c_~q1~0.base))) (or (not (= (select .cse26 .cse22) c_~i~0)) (< .cse27 c_~i~0) (< .cse27 (+ (select .cse28 .cse9) 1)) (not (= (select .cse28 .cse12) c_~j~0)))))))) .cse5 .cse6) (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse30 (let ((.cse40 (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse37 (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t2~0#1.base| 1))) (.cse38 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0))) (.cse34 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t1~0#1.base|) 0))) (.cse35 (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t1~0#1.base| 1))) (.cse39 (= c_~q1_back~0 c_~q1_front~0)) (.cse31 (not .cse40)) (.cse33 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_115| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_115|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_115| 1))))) (.cse36 (< c_~i~0 (+ c_~j~0 1)))) (and (or (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse31 (and (or .cse32 .cse33) (or .cse34 .cse35 .cse36) (or .cse37 .cse36 .cse38) (or .cse36 .cse33))) (or .cse34 .cse35 .cse32) (or (and (<= c_~j~0 c_~i~0) .cse39) .cse33) (or .cse37 .cse32 .cse38) (or .cse34 .cse35 .cse36 .cse40) (or .cse39 .cse33) (or .cse31 .cse33 (and (<= c_~i~0 c_~j~0) .cse32)) (or .cse32 .cse33 .cse40) (or .cse36 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_115| Int)) (or (= |c_ULTIMATE.start_main_~#t1~0#1.base| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_115|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_115|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_115| 1))))))))) (let ((.cse41 (select |c_#memory_int| c_~q1~0.base)) (.cse45 (select |c_#memory_int| c_~q2~0.base))) (or .cse0 (not (= (select .cse41 .cse12) c_~j~0)) .cse1 .cse2 .cse3 (let ((.cse44 (select .cse45 .cse23))) (let ((.cse42 (select .cse41 .cse9)) (.cse43 (< .cse44 c_~i~0))) (and (or (< .cse42 .cse19) .cse43) (or (< .cse44 (+ .cse42 1)) .cse43)))) .cse5 .cse6 (not (= c_~i~0 (select .cse45 .cse22))))) (<= c_~n2~0 1) (or .cse1 (and (<= 0 c_~i~0) (or (< c_~q1_front~0 1) (< (+ c_~q1_front~0 c_~n1~0) (+ c_~q1_back~0 2))) (or (not (= c_~q1_front~0 0)) (let ((.cse46 (= c_~q1_back~0 0))) (and (or (not .cse46) (= c_~j~0 0)) (or (and (<= 0 c_~q1_back~0) (<= c_~n1~0 1)) .cse46)))) (or .cse30 (and (or (not .cse32) (= c_~i~0 0)) (<= c_~q2_front~0 0)))) (not (= c_~n2~0 1))) (or .cse0 .cse1 .cse2 .cse3 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5 .cse6 (and (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_134 (Array Int Int))) (let ((.cse50 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_134) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse49 (select .cse50 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse48 (select .cse49 .cse14)) (.cse47 (select .cse50 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse47 .cse12))) (< .cse48 c_~i~0) (not (= c_~i~0 (select .cse49 .cse11))) (< .cse48 (+ (select .cse47 .cse9) 1))))))) (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_134 (Array Int Int))) (let ((.cse53 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_134) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse51 (select .cse53 c_~q1~0.base)) (.cse52 (select .cse53 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= c_~j~0 (select .cse51 .cse12))) (< (select .cse51 .cse9) .cse19) (< (select .cse52 .cse14) c_~i~0) (not (= c_~i~0 (select .cse52 .cse11)))))))))))) is different from false [2023-11-17 12:39:45,290 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse36 (* c_~q1_front~0 4)) (.cse68 (* c_~q2_front~0 4))) (let ((.cse38 (select |c_#memory_int| c_~q2~0.base)) (.cse25 (+ c_~q2~0.offset .cse68)) (.cse35 (select |c_#memory_int| c_~q1~0.base)) (.cse9 (+ .cse36 c_~q1~0.offset))) (let ((.cse53 (select .cse35 .cse9)) (.cse41 (= c_~q2_front~0 0)) (.cse65 (= c_~j~0 0)) (.cse56 (<= c_~n1~0 1)) (.cse66 (select .cse38 .cse25)) (.cse67 (* c_~q2_back~0 4)) (.cse52 (= (select .cse38 .cse68) 0))) (let ((.cse22 (not .cse52)) (.cse21 (<= 1 c_~N~0)) (.cse4 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse24 (+ .cse67 c_~q2~0.offset)) (.cse54 (< .cse66 c_~i~0)) (.cse32 (or (< c_~q1_front~0 1) (< (+ c_~q1_front~0 c_~n1~0) (+ c_~q1_back~0 2)))) (.cse33 (or (not (= c_~q1_front~0 0)) (let ((.cse69 (= c_~q1_back~0 0))) (and (or (not .cse69) .cse65) (or (and (<= 0 c_~q1_back~0) .cse56) .cse69))))) (.cse39 (not (= c_~q2_back~0 0))) (.cse50 (not .cse41)) (.cse51 (<= c_~q2_front~0 0)) (.cse37 (= c_~n2~0 1)) (.cse1 (< c_~q2_back~0 0)) (.cse2 (< c_~n1~0 (+ c_~q1_back~0 1))) (.cse5 (< c_~q1_back~0 0)) (.cse6 (< c_~n2~0 (+ c_~q2_back~0 1))) (.cse12 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse19 (+ c_~i~0 1)) (.cse14 (+ .cse68 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse11 (+ .cse67 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse0 (< c_~n1~0 (+ c_~q1_front~0 1))) (.cse3 (< c_~q1_front~0 0)) (.cse55 (< .cse66 (+ .cse53 1))) (.cse57 (< (+ .cse66 1) c_~N~0))) (and (= c_~q2~0.offset 0) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (let ((.cse15 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse16 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_106| Int) (v_ArrVal_135 (Array Int Int)) (v_ArrVal_134 (Array Int Int))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse15 .cse16 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_106|)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_134) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse10 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse7 (select .cse10 .cse14)) (.cse8 (select .cse13 c_~q1~0.base))) (or (< .cse7 c_~i~0) (< .cse7 (+ (select .cse8 .cse9) 1)) (not (= c_~i~0 (select .cse10 .cse11))) (not (= c_~j~0 (select .cse8 .cse12)))))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_106| Int) (v_ArrVal_135 (Array Int Int)) (v_ArrVal_134 (Array Int Int))) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse15 .cse16 |v_ULTIMATE.start_create_fresh_int_array_#t~nondet26#1_106|)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_134) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse17 (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse18 (select .cse20 c_~q1~0.base))) (or (< (select .cse17 .cse14) c_~i~0) (not (= c_~i~0 (select .cse17 .cse11))) (not (= c_~j~0 (select .cse18 .cse12))) (< (select .cse18 .cse9) .cse19)))))))) (= c_~q1~0.offset 0) (or (and .cse21 (<= c_~i~0 c_~N~0)) .cse22) (= c_~j~0 c_~i~0) (or .cse0 .cse1 .cse2 .cse3 (and (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse23 (select .cse27 c_~q2~0.base)) (.cse26 (select .cse27 c_~q1~0.base))) (or (not (= (select .cse23 .cse24) c_~i~0)) (< (select .cse23 .cse25) c_~i~0) (< (select .cse26 .cse9) .cse19) (not (= (select .cse26 .cse12) c_~j~0)))))) (forall ((v_ArrVal_135 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse28 (select .cse31 c_~q2~0.base))) (let ((.cse29 (select .cse28 .cse25)) (.cse30 (select .cse31 c_~q1~0.base))) (or (not (= (select .cse28 .cse24) c_~i~0)) (< .cse29 c_~i~0) (< .cse29 (+ (select .cse30 .cse9) 1)) (not (= (select .cse30 .cse12) c_~j~0)))))))) .cse5 .cse6) (or (let ((.cse34 (= (select .cse35 .cse36) 0))) (and (or (and .cse32 .cse33) .cse34) (or (not .cse34) (< 0 c_~N~0)))) .cse22) .cse37 (= 0 (select .cse38 0)) .cse21 (or .cse0 .cse2 .cse3 .cse4 .cse5 .cse39 (let ((.cse49 (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse46 (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t2~0#1.base| 1))) (.cse47 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0))) (.cse43 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t1~0#1.base|) 0))) (.cse44 (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t1~0#1.base| 1))) (.cse48 (= c_~q1_back~0 c_~q1_front~0)) (.cse40 (not .cse49)) (.cse42 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_115| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_115|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_115| 1))))) (.cse45 (< c_~i~0 (+ c_~j~0 1)))) (and (or (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse40 (and (or .cse41 .cse42) (or .cse43 .cse44 .cse45) (or .cse46 .cse45 .cse47) (or .cse45 .cse42))) (or .cse43 .cse44 .cse41) (or (and (<= c_~j~0 c_~i~0) .cse48) .cse42) (or .cse46 .cse41 .cse47) (or .cse43 .cse44 .cse45 .cse49) (or .cse48 .cse42) (or .cse40 .cse42 (and (<= c_~i~0 c_~j~0) .cse41)) (or .cse41 .cse42 .cse49) (or .cse45 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_115| Int)) (or (= |c_ULTIMATE.start_main_~#t1~0#1.base| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_115|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_115|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_115| 1))))))))) (not (= c_~q1~0.base c_~q2~0.base)) .cse41 (or (and .cse50 .cse51) .cse52) (or .cse0 (not (= (select .cse35 .cse12) c_~j~0)) .cse1 .cse2 .cse3 (and (or (< .cse53 .cse19) .cse54) (or .cse55 .cse54)) .cse5 .cse6 (not (= c_~i~0 (select .cse38 .cse24)))) .cse56 (or .cse57 .cse54) (<= c_~q1_front~0 c_~q1_back~0) (<= c_~n2~0 1) (or .cse1 (and (<= 0 c_~i~0) .cse32 .cse33 (or .cse39 (and (or .cse50 (= c_~i~0 0)) .cse51))) (not .cse37)) (or .cse0 .cse1 .cse2 .cse3 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5 .cse6 (and (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_134 (Array Int Int))) (let ((.cse61 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_134) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse60 (select .cse61 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse59 (select .cse60 .cse14)) (.cse58 (select .cse61 c_~q1~0.base))) (or (not (= c_~j~0 (select .cse58 .cse12))) (< .cse59 c_~i~0) (not (= c_~i~0 (select .cse60 .cse11))) (< .cse59 (+ (select .cse58 .cse9) 1))))))) (forall ((v_ArrVal_135 (Array Int Int)) (v_ArrVal_134 (Array Int Int))) (let ((.cse64 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_134) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_135))) (let ((.cse62 (select .cse64 c_~q1~0.base)) (.cse63 (select .cse64 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= c_~j~0 (select .cse62 .cse12))) (< (select .cse62 .cse9) .cse19) (< (select .cse63 .cse14) c_~i~0) (not (= c_~i~0 (select .cse63 .cse11))))))))) (or .cse0 .cse3 (and (or .cse57 .cse55) (or (< .cse53 c_~N~0) .cse57))) (or (< c_~i~0 (+ c_~N~0 1)) .cse57) .cse65))))) is different from false [2023-11-17 12:39:56,416 INFO L124 PetriNetUnfolderBase]: 692/1319 cut-off events. [2023-11-17 12:39:56,417 INFO L125 PetriNetUnfolderBase]: For 8395/8395 co-relation queries the response was YES. [2023-11-17 12:39:56,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5995 conditions, 1319 events. 692/1319 cut-off events. For 8395/8395 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 7487 event pairs, 71 based on Foata normal form. 5/1317 useless extension candidates. Maximal degree in co-relation 5937. Up to 453 conditions per place. [2023-11-17 12:39:56,433 INFO L140 encePairwiseOnDemand]: 19/34 looper letters, 165 selfloop transitions, 206 changer transitions 35/408 dead transitions. [2023-11-17 12:39:56,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 408 transitions, 3493 flow [2023-11-17 12:39:56,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-11-17 12:39:56,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2023-11-17 12:39:56,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 555 transitions. [2023-11-17 12:39:56,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2914915966386555 [2023-11-17 12:39:56,439 INFO L72 ComplementDD]: Start complementDD. Operand 56 states and 555 transitions. [2023-11-17 12:39:56,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 555 transitions. [2023-11-17 12:39:56,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:39:56,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 56 states and 555 transitions. [2023-11-17 12:39:56,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 57 states, 56 states have (on average 9.910714285714286) internal successors, (555), 56 states have internal predecessors, (555), 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 12:39:56,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 57 states, 57 states have (on average 34.0) internal successors, (1938), 57 states have internal predecessors, (1938), 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 12:39:56,451 INFO L81 ComplementDD]: Finished complementDD. Result has 57 states, 57 states have (on average 34.0) internal successors, (1938), 57 states have internal predecessors, (1938), 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 12:39:56,451 INFO L175 Difference]: Start difference. First operand has 119 places, 146 transitions, 969 flow. Second operand 56 states and 555 transitions. [2023-11-17 12:39:56,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 408 transitions, 3493 flow [2023-11-17 12:39:56,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 408 transitions, 3056 flow, removed 206 selfloop flow, removed 6 redundant places. [2023-11-17 12:39:56,507 INFO L231 Difference]: Finished difference. Result has 181 places, 276 transitions, 2132 flow [2023-11-17 12:39:56,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=34, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=2132, PETRI_PLACES=181, PETRI_TRANSITIONS=276} [2023-11-17 12:39:56,508 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 157 predicate places. [2023-11-17 12:39:56,509 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 276 transitions, 2132 flow [2023-11-17 12:39:56,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 6.514285714285714) internal successors, (228), 35 states have internal predecessors, (228), 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 12:39:56,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:39:56,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:39:56,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-17 12:39:56,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-17 12:39:56,715 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 12:39:56,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:39:56,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1023155078, now seen corresponding path program 3 times [2023-11-17 12:39:56,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:39:56,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935941659] [2023-11-17 12:39:56,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:39:56,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:39:56,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:39:58,212 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 12:39:58,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:39:58,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935941659] [2023-11-17 12:39:58,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935941659] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:39:58,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071573129] [2023-11-17 12:39:58,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 12:39:58,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:39:58,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:39:58,214 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 12:39:58,216 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 12:39:58,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-17 12:39:58,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:39:58,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-17 12:39:58,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:39:58,405 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-17 12:39:58,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-17 12:39:58,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:39:58,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-11-17 12:39:58,445 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-17 12:39:58,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-17 12:39:58,673 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:39:58,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-17 12:39:58,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-17 12:39:58,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:39:59,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 12:39:59,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2023-11-17 12:39:59,489 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 12:39:59,490 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:40:01,375 INFO L349 Elim1Store]: treesize reduction 27, result has 61.4 percent of original size [2023-11-17 12:40:01,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 217 treesize of output 115 [2023-11-17 12:40:01,515 INFO L349 Elim1Store]: treesize reduction 5, result has 96.6 percent of original size [2023-11-17 12:40:01,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 317 treesize of output 418 [2023-11-17 12:40:01,545 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 12:40:01,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:40:01,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 255 treesize of output 279 [2023-11-17 12:40:01,633 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 12:40:01,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:40:01,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 161 treesize of output 209 [2023-11-17 12:40:16,718 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-17 12:40:16,718 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 101 [2023-11-17 12:40:16,719 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-17 12:40:16,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-17 12:40:16,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:40:16,920 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:111) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:495) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 61 more [2023-11-17 12:40:16,923 INFO L158 Benchmark]: Toolchain (without parser) took 259086.08ms. Allocated memory was 178.3MB in the beginning and 1.0GB in the end (delta: 849.3MB). Free memory was 121.9MB in the beginning and 835.3MB in the end (delta: -713.3MB). Peak memory consumption was 611.5MB. Max. memory is 8.0GB. [2023-11-17 12:40:16,923 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 178.3MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 12:40:16,923 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.80ms. Allocated memory is still 178.3MB. Free memory was 121.6MB in the beginning and 109.8MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-11-17 12:40:16,924 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.51ms. Allocated memory is still 178.3MB. Free memory was 109.8MB in the beginning and 107.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 12:40:16,924 INFO L158 Benchmark]: Boogie Preprocessor took 36.28ms. Allocated memory is still 178.3MB. Free memory was 107.4MB in the beginning and 105.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 12:40:16,924 INFO L158 Benchmark]: RCFGBuilder took 828.22ms. Allocated memory was 178.3MB in the beginning and 284.2MB in the end (delta: 105.9MB). Free memory was 105.6MB in the beginning and 208.1MB in the end (delta: -102.4MB). Peak memory consumption was 24.0MB. Max. memory is 8.0GB. [2023-11-17 12:40:16,924 INFO L158 Benchmark]: TraceAbstraction took 257934.34ms. Allocated memory was 284.2MB in the beginning and 1.0GB in the end (delta: 743.4MB). Free memory was 207.0MB in the beginning and 835.3MB in the end (delta: -628.3MB). Peak memory consumption was 589.6MB. Max. memory is 8.0GB. [2023-11-17 12:40:16,926 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.14ms. Allocated memory is still 178.3MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 242.80ms. Allocated memory is still 178.3MB. Free memory was 121.6MB in the beginning and 109.8MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.51ms. Allocated memory is still 178.3MB. Free memory was 109.8MB in the beginning and 107.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.28ms. Allocated memory is still 178.3MB. Free memory was 107.4MB in the beginning and 105.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 828.22ms. Allocated memory was 178.3MB in the beginning and 284.2MB in the end (delta: 105.9MB). Free memory was 105.6MB in the beginning and 208.1MB in the end (delta: -102.4MB). Peak memory consumption was 24.0MB. Max. memory is 8.0GB. * TraceAbstraction took 257934.34ms. Allocated memory was 284.2MB in the beginning and 1.0GB in the end (delta: 743.4MB). Free memory was 207.0MB in the beginning and 835.3MB in the end (delta: -628.3MB). Peak memory consumption was 589.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.4s, 29 PlacesBefore, 24 PlacesAfterwards, 26 TransitionsBefore, 21 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 1 FixpointIterations, 1 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 173 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 159, independent: 150, independent conditional: 0, independent unconditional: 150, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, independent: 97, independent conditional: 0, independent unconditional: 97, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, independent: 96, independent conditional: 0, independent unconditional: 96, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 33, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 159, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 104, unknown conditional: 0, unknown unconditional: 104] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 44, Positive conditional cache size: 0, Positive unconditional cache size: 44, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...