/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-more-min-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 12:23:13,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 12:23:13,855 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:23:13,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 12:23:13,877 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 12:23:13,877 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 12:23:13,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 12:23:13,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 12:23:13,878 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 12:23:13,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 12:23:13,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 12:23:13,879 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 12:23:13,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 12:23:13,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 12:23:13,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 12:23:13,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 12:23:13,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 12:23:13,881 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 12:23:13,881 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 12:23:13,881 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 12:23:13,882 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 12:23:13,882 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 12:23:13,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 12:23:13,882 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 12:23:13,883 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 12:23:13,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 12:23:13,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 12:23:13,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 12:23:13,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 12:23:13,884 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 12:23:13,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 12:23:13,884 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 12:23:13,885 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:23:14,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 12:23:14,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 12:23:14,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 12:23:14,109 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 12:23:14,110 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 12:23:14,111 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2023-11-17 12:23:15,301 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 12:23:15,485 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 12:23:15,486 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2023-11-17 12:23:15,493 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70be98cf3/2b77eceaeb294872bd644fd257b672aa/FLAG7b4a38d7c [2023-11-17 12:23:15,509 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70be98cf3/2b77eceaeb294872bd644fd257b672aa [2023-11-17 12:23:15,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 12:23:15,513 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 12:23:15,516 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 12:23:15,516 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 12:23:15,520 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 12:23:15,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:23:15" (1/1) ... [2023-11-17 12:23:15,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62e5b527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:23:15, skipping insertion in model container [2023-11-17 12:23:15,522 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:23:15" (1/1) ... [2023-11-17 12:23:15,546 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 12:23:15,696 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-more-min-array-hom.wvr.c[2625,2638] [2023-11-17 12:23:15,703 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 12:23:15,711 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 12:23:15,729 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-more-min-array-hom.wvr.c[2625,2638] [2023-11-17 12:23:15,732 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 12:23:15,738 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 12:23:15,738 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 12:23:15,744 INFO L206 MainTranslator]: Completed translation [2023-11-17 12:23:15,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:23:15 WrapperNode [2023-11-17 12:23:15,745 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 12:23:15,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 12:23:15,746 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 12:23:15,746 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 12:23:15,751 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:23:15" (1/1) ... [2023-11-17 12:23:15,758 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:23:15" (1/1) ... [2023-11-17 12:23:15,776 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2023-11-17 12:23:15,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 12:23:15,776 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 12:23:15,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 12:23:15,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 12:23:15,784 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:23:15" (1/1) ... [2023-11-17 12:23:15,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:23:15" (1/1) ... [2023-11-17 12:23:15,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:23:15" (1/1) ... [2023-11-17 12:23:15,788 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:23:15" (1/1) ... [2023-11-17 12:23:15,796 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:23:15" (1/1) ... [2023-11-17 12:23:15,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:23:15" (1/1) ... [2023-11-17 12:23:15,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:23:15" (1/1) ... [2023-11-17 12:23:15,804 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:23:15" (1/1) ... [2023-11-17 12:23:15,807 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 12:23:15,807 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 12:23:15,808 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 12:23:15,808 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 12:23:15,808 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:23:15" (1/1) ... [2023-11-17 12:23:15,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 12:23:15,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:23:15,835 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:23:15,843 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:23:15,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 12:23:15,862 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 12:23:15,863 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 12:23:15,863 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 12:23:15,863 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 12:23:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-17 12:23:15,864 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-17 12:23:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 12:23:15,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 12:23:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 12:23:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 12:23:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 12:23:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 12:23:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 12:23:15,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 12:23:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 12:23:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 12:23:15,867 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:23:15,948 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 12:23:15,950 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 12:23:16,197 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 12:23:16,461 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 12:23:16,461 INFO L307 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-17 12:23:16,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:23:16 BoogieIcfgContainer [2023-11-17 12:23:16,463 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 12:23:16,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 12:23:16,465 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 12:23:16,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 12:23:16,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:23:15" (1/3) ... [2023-11-17 12:23:16,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f288904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:23:16, skipping insertion in model container [2023-11-17 12:23:16,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:23:15" (2/3) ... [2023-11-17 12:23:16,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f288904 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:23:16, skipping insertion in model container [2023-11-17 12:23:16,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 12:23:16" (3/3) ... [2023-11-17 12:23:16,470 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2023-11-17 12:23:16,485 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 12:23:16,485 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 12:23:16,485 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 12:23:16,535 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-17 12:23:16,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 91 flow [2023-11-17 12:23:16,613 INFO L124 PetriNetUnfolderBase]: 4/32 cut-off events. [2023-11-17 12:23:16,614 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 12:23:16,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 4/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2023-11-17 12:23:16,619 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 35 transitions, 91 flow [2023-11-17 12:23:16,626 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 31 transitions, 80 flow [2023-11-17 12:23:16,630 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 12:23:16,654 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 31 transitions, 80 flow [2023-11-17 12:23:16,658 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 31 transitions, 80 flow [2023-11-17 12:23:16,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 31 transitions, 80 flow [2023-11-17 12:23:16,674 INFO L124 PetriNetUnfolderBase]: 4/31 cut-off events. [2023-11-17 12:23:16,674 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 12:23:16,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 31 events. 4/31 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 42 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2023-11-17 12:23:16,676 INFO L119 LiptonReduction]: Number of co-enabled transitions 300 [2023-11-17 12:23:17,225 INFO L134 LiptonReduction]: Checked pairs total: 371 [2023-11-17 12:23:17,225 INFO L136 LiptonReduction]: Total number of compositions: 7 [2023-11-17 12:23:17,238 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 12:23:17,243 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;@61cb7e33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 12:23:17,243 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-17 12:23:17,252 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 12:23:17,252 INFO L124 PetriNetUnfolderBase]: 4/23 cut-off events. [2023-11-17 12:23:17,252 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 12:23:17,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:23:17,252 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:23:17,253 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:23:17,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:23:17,257 INFO L85 PathProgramCache]: Analyzing trace with hash -2145703011, now seen corresponding path program 1 times [2023-11-17 12:23:17,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:23:17,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83164632] [2023-11-17 12:23:17,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:23:17,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:23:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:23:17,769 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:23:17,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:23:17,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83164632] [2023-11-17 12:23:17,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83164632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:23:17,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:23:17,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 12:23:17,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574521317] [2023-11-17 12:23:17,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:23:17,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 12:23:17,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:23:17,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 12:23:17,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 12:23:17,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 42 [2023-11-17 12:23:17,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:23:17,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:23:17,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 42 [2023-11-17 12:23:17,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:23:17,989 INFO L124 PetriNetUnfolderBase]: 429/632 cut-off events. [2023-11-17 12:23:17,990 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2023-11-17 12:23:17,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1341 conditions, 632 events. 429/632 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1999 event pairs, 138 based on Foata normal form. 1/468 useless extension candidates. Maximal degree in co-relation 1030. Up to 389 conditions per place. [2023-11-17 12:23:17,999 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 38 selfloop transitions, 4 changer transitions 1/43 dead transitions. [2023-11-17 12:23:18,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 43 transitions, 205 flow [2023-11-17 12:23:18,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 12:23:18,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 12:23:18,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2023-11-17 12:23:18,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5158730158730159 [2023-11-17 12:23:18,011 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 65 transitions. [2023-11-17 12:23:18,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 65 transitions. [2023-11-17 12:23:18,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:23:18,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 65 transitions. [2023-11-17 12:23:18,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:23:18,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:23:18,022 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:23:18,024 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 66 flow. Second operand 3 states and 65 transitions. [2023-11-17 12:23:18,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 43 transitions, 205 flow [2023-11-17 12:23:18,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 43 transitions, 183 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-17 12:23:18,030 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 80 flow [2023-11-17 12:23:18,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=54, 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=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2023-11-17 12:23:18,035 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2023-11-17 12:23:18,035 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 80 flow [2023-11-17 12:23:18,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:23:18,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:23:18,035 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:23:18,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 12:23:18,036 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:23:18,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:23:18,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1840661634, now seen corresponding path program 1 times [2023-11-17 12:23:18,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:23:18,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127355201] [2023-11-17 12:23:18,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:23:18,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:23:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:23:18,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:23:18,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:23:18,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127355201] [2023-11-17 12:23:18,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127355201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:23:18,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:23:18,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 12:23:18,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428473564] [2023-11-17 12:23:18,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:23:18,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 12:23:18,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:23:18,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 12:23:18,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 12:23:18,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 42 [2023-11-17 12:23:18,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 80 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:23:18,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:23:18,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 42 [2023-11-17 12:23:18,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:23:18,253 INFO L124 PetriNetUnfolderBase]: 429/633 cut-off events. [2023-11-17 12:23:18,254 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2023-11-17 12:23:18,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1541 conditions, 633 events. 429/633 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1875 event pairs, 276 based on Foata normal form. 0/632 useless extension candidates. Maximal degree in co-relation 544. Up to 633 conditions per place. [2023-11-17 12:23:18,257 INFO L140 encePairwiseOnDemand]: 39/42 looper letters, 26 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2023-11-17 12:23:18,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 28 transitions, 138 flow [2023-11-17 12:23:18,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 12:23:18,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 12:23:18,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2023-11-17 12:23:18,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3253968253968254 [2023-11-17 12:23:18,260 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 41 transitions. [2023-11-17 12:23:18,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 41 transitions. [2023-11-17 12:23:18,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:23:18,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 41 transitions. [2023-11-17 12:23:18,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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:23:18,263 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:23:18,263 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 42.0) internal successors, (168), 4 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:23:18,263 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 80 flow. Second operand 3 states and 41 transitions. [2023-11-17 12:23:18,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 28 transitions, 138 flow [2023-11-17 12:23:18,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 28 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 12:23:18,265 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 88 flow [2023-11-17 12:23:18,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2023-11-17 12:23:18,266 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2023-11-17 12:23:18,267 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 28 transitions, 88 flow [2023-11-17 12:23:18,267 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:23:18,267 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:23:18,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:23:18,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 12:23:18,271 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:23:18,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:23:18,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1389490811, now seen corresponding path program 1 times [2023-11-17 12:23:18,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:23:18,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99457711] [2023-11-17 12:23:18,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:23:18,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:23:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:23:18,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 12:23:18,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:23:18,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99457711] [2023-11-17 12:23:18,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99457711] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 12:23:18,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 12:23:18,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 12:23:18,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162832670] [2023-11-17 12:23:18,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:23:18,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 12:23:18,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:23:18,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 12:23:18,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 12:23:18,394 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 42 [2023-11-17 12:23:18,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 28 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:23:18,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:23:18,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 42 [2023-11-17 12:23:18,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:23:18,509 INFO L124 PetriNetUnfolderBase]: 424/625 cut-off events. [2023-11-17 12:23:18,509 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2023-11-17 12:23:18,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1473 conditions, 625 events. 424/625 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1923 event pairs, 186 based on Foata normal form. 50/674 useless extension candidates. Maximal degree in co-relation 1460. Up to 459 conditions per place. [2023-11-17 12:23:18,513 INFO L140 encePairwiseOnDemand]: 38/42 looper letters, 38 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2023-11-17 12:23:18,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 42 transitions, 212 flow [2023-11-17 12:23:18,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 12:23:18,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 12:23:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2023-11-17 12:23:18,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31547619047619047 [2023-11-17 12:23:18,515 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 53 transitions. [2023-11-17 12:23:18,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 53 transitions. [2023-11-17 12:23:18,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:23:18,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 53 transitions. [2023-11-17 12:23:18,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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:23:18,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 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:23:18,518 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 42.0) internal successors, (210), 5 states have internal predecessors, (210), 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:23:18,518 INFO L175 Difference]: Start difference. First operand has 29 places, 28 transitions, 88 flow. Second operand 4 states and 53 transitions. [2023-11-17 12:23:18,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 42 transitions, 212 flow [2023-11-17 12:23:18,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 42 transitions, 206 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-17 12:23:18,520 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 101 flow [2023-11-17 12:23:18,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2023-11-17 12:23:18,522 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2023-11-17 12:23:18,522 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 101 flow [2023-11-17 12:23:18,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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:23:18,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:23:18,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:23:18,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 12:23:18,523 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:23:18,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:23:18,523 INFO L85 PathProgramCache]: Analyzing trace with hash 91596736, now seen corresponding path program 1 times [2023-11-17 12:23:18,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:23:18,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57259200] [2023-11-17 12:23:18,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:23:18,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:23:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:23:18,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:23:18,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:23:18,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57259200] [2023-11-17 12:23:18,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57259200] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:23:18,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137015597] [2023-11-17 12:23:18,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:23:18,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:23:18,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:23:18,649 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:23:18,673 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:23:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:23:18,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 12:23:18,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:23:18,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:23:18,848 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:23:18,884 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:23:18,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137015597] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-17 12:23:18,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-17 12:23:18,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-11-17 12:23:18,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922386158] [2023-11-17 12:23:18,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 12:23:18,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 12:23:18,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:23:18,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 12:23:18,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-17 12:23:18,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 42 [2023-11-17 12:23:18,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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:23:18,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:23:18,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 42 [2023-11-17 12:23:18,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:23:19,022 INFO L124 PetriNetUnfolderBase]: 410/599 cut-off events. [2023-11-17 12:23:19,022 INFO L125 PetriNetUnfolderBase]: For 328/328 co-relation queries the response was YES. [2023-11-17 12:23:19,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1622 conditions, 599 events. 410/599 cut-off events. For 328/328 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1807 event pairs, 183 based on Foata normal form. 44/643 useless extension candidates. Maximal degree in co-relation 1603. Up to 452 conditions per place. [2023-11-17 12:23:19,026 INFO L140 encePairwiseOnDemand]: 37/42 looper letters, 39 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2023-11-17 12:23:19,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 44 transitions, 246 flow [2023-11-17 12:23:19,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 12:23:19,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 12:23:19,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2023-11-17 12:23:19,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3 [2023-11-17 12:23:19,028 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 63 transitions. [2023-11-17 12:23:19,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 63 transitions. [2023-11-17 12:23:19,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:23:19,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 63 transitions. [2023-11-17 12:23:19,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:23:19,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 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:23:19,029 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 42.0) internal successors, (252), 6 states have internal predecessors, (252), 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:23:19,030 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 101 flow. Second operand 5 states and 63 transitions. [2023-11-17 12:23:19,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 44 transitions, 246 flow [2023-11-17 12:23:19,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 44 transitions, 230 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-17 12:23:19,032 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 113 flow [2023-11-17 12:23:19,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2023-11-17 12:23:19,033 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2023-11-17 12:23:19,033 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 113 flow [2023-11-17 12:23:19,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 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:23:19,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:23:19,033 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:23:19,064 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:23:19,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:23:19,264 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:23:19,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:23:19,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1443212299, now seen corresponding path program 1 times [2023-11-17 12:23:19,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:23:19,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541862196] [2023-11-17 12:23:19,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:23:19,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:23:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:23:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:23:20,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:23:20,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541862196] [2023-11-17 12:23:20,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541862196] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:23:20,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084929272] [2023-11-17 12:23:20,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:23:20,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:23:20,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:23:20,325 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:23:20,341 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:23:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:23:20,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-17 12:23:20,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:23:20,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:23:20,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:23:20,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-17 12:23:20,529 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:23:20,599 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:23:20,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:23:20,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2023-11-17 12:23:20,853 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 38 treesize of output 29 [2023-11-17 12:23:21,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2023-11-17 12:23:21,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:23:21,112 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:23:21,513 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (= c_~min2~0 c_~min1~0)) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_115 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_115) c_~A~0.base) .cse2))) (let ((.cse0 (+ .cse1 1))) (or (< c_~min2~0 .cse0) (= c_~min1~0 .cse1) (< c_~min3~0 .cse0))))) (or (and .cse3 (<= c_~min2~0 c_~min3~0)) (and (= c_~min1~0 c_~min3~0) (<= (+ c_~min3~0 1) c_~min2~0)) (forall ((v_ArrVal_115 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_115) c_~A~0.base) .cse2) c_~min3~0))) (or .cse3 (and (forall ((v_ArrVal_115 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_115) c_~A~0.base) .cse2))) (or (< c_~min3~0 (+ .cse4 1)) (< .cse4 c_~min2~0)))) (forall ((v_ArrVal_115 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_115) c_~A~0.base) .cse2))) (or (= c_~min1~0 .cse5) (< c_~min3~0 (+ .cse5 1))))))))) is different from false [2023-11-17 12:23:21,651 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~min2~0 c_~min1~0)) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or .cse0 (and (forall ((v_ArrVal_115 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_115) c_~A~0.base) .cse2))) (or (< c_~min3~0 (+ .cse1 1)) (= c_~min1~0 .cse1)))) (forall ((v_ArrVal_115 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_115) c_~A~0.base) .cse2))) (or (< .cse3 c_~min2~0) (< c_~min3~0 (+ .cse3 1))))))) (forall ((v_ArrVal_115 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (let ((.cse5 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_115) c_~A~0.base) .cse2))) (let ((.cse4 (+ .cse5 1))) (or (< c_~min2~0 .cse4) (< c_~min3~0 .cse4) (= c_~min1~0 .cse5))))) (or (and .cse0 (<= c_~min2~0 c_~min3~0)) (and (= c_~min1~0 c_~min3~0) (<= (+ c_~min3~0 1) c_~min2~0)) (forall ((v_ArrVal_115 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_115) c_~A~0.base) .cse2) c_~min3~0))))) is different from false [2023-11-17 12:23:23,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:23:23,269 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 1 case distinctions, treesize of input 55 treesize of output 43 [2023-11-17 12:23:23,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:23:23,282 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 319 treesize of output 307 [2023-11-17 12:23:23,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 128 [2023-11-17 12:23:23,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:23:23,323 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 73 treesize of output 73 [2023-11-17 12:23:23,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2023-11-17 12:23:23,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:23:23,597 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 1 case distinctions, treesize of input 101 treesize of output 65 [2023-11-17 12:23:23,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:23:23,611 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 365 treesize of output 345 [2023-11-17 12:23:23,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 140 [2023-11-17 12:23:23,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:23:23,649 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 100 treesize of output 96 [2023-11-17 12:23:23,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 110 [2023-11-17 12:23:23,892 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 12:23:23,892 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 1 case distinctions, treesize of input 113 treesize of output 1 [2023-11-17 12:23:23,903 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 12:23:23,904 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 1 case distinctions, treesize of input 79 treesize of output 1 [2023-11-17 12:23:23,913 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 12:23:23,913 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 1 case distinctions, treesize of input 132 treesize of output 1 [2023-11-17 12:23:23,924 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 12:23:23,924 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 1 case distinctions, treesize of input 79 treesize of output 1 [2023-11-17 12:23:23,934 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 12:23:23,935 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 1 case distinctions, treesize of input 123 treesize of output 1 [2023-11-17 12:23:23,944 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 12:23:23,945 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 1 case distinctions, treesize of input 144 treesize of output 1 [2023-11-17 12:23:23,955 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 12:23:23,955 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 1 case distinctions, treesize of input 89 treesize of output 1 [2023-11-17 12:23:23,966 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 12:23:23,966 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 1 case distinctions, treesize of input 89 treesize of output 1 [2023-11-17 12:23:24,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-17 12:23:24,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084929272] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:23:24,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:23:24,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2023-11-17 12:23:24,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999384343] [2023-11-17 12:23:24,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:23:24,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-17 12:23:24,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:23:24,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-17 12:23:24,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=442, Unknown=6, NotChecked=90, Total=650 [2023-11-17 12:23:24,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 42 [2023-11-17 12:23:24,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 113 flow. Second operand has 26 states, 26 states have (on average 6.461538461538462) internal successors, (168), 26 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:23:24,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:23:24,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 42 [2023-11-17 12:23:24,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:23:24,655 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (= c_~min1~0 c_~min3~0)) (.cse8 (<= (+ c_~min3~0 1) c_~min2~0)) (.cse4 (= c_~min2~0 c_~min1~0)) (.cse6 (<= c_~min2~0 c_~min3~0)) (.cse21 (select |c_#memory_int| c_~A~0.base)) (.cse11 (+ c_~A~0.offset (* 4 c_~M~0)))) (let ((.cse1 (select .cse21 .cse11)) (.cse5 (select .cse21 c_~A~0.offset)) (.cse12 (forall ((v_ArrVal_115 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_115) c_~A~0.base) .cse11))) (or (< .cse20 c_~min2~0) (< c_~min3~0 (+ .cse20 1)))))) (.cse0 (and .cse4 .cse6)) (.cse2 (and .cse15 .cse8)) (.cse9 (forall ((v_ArrVal_115 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_115) c_~A~0.base) .cse11) c_~min3~0)))) (and (or .cse0 (< .cse1 c_~min3~0) .cse2) (let ((.cse3 (+ .cse1 1))) (or (< c_~min3~0 .cse3) (and .cse4 (<= c_~min2~0 .cse1)) (and (<= .cse3 c_~min2~0) (= c_~min1~0 .cse1)))) (or (< c_~min1~0 (+ .cse5 1)) (let ((.cse7 (= c_~min2~0 .cse5))) (and (or (and .cse6 .cse7) (and .cse8 (= .cse5 c_~min3~0)) .cse9) (or (and (forall ((v_ArrVal_115 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (let ((.cse10 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_115) c_~A~0.base) .cse11))) (or (= .cse10 .cse5) (< c_~min3~0 (+ .cse10 1))))) .cse12) .cse7) (forall ((v_ArrVal_115 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (let ((.cse14 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_115) c_~A~0.base) .cse11))) (let ((.cse13 (+ .cse14 1))) (or (< c_~min2~0 .cse13) (= .cse14 .cse5) (< c_~min3~0 .cse13)))))))) (let ((.cse16 (= c_~min2~0 0))) (or (and .cse15 (<= (+ c_~min1~0 1) 0) .cse16) (and (= c_~min1~0 0) (= c_~min3~0 0) .cse16))) (or (< .cse5 c_~min1~0) (and (or .cse4 (and (forall ((v_ArrVal_115 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (let ((.cse17 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_115) c_~A~0.base) .cse11))) (or (< c_~min3~0 (+ .cse17 1)) (= c_~min1~0 .cse17)))) .cse12)) (forall ((v_ArrVal_115 (Array Int Int)) (v_ArrVal_114 (Array Int Int))) (let ((.cse19 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_114) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_115) c_~A~0.base) .cse11))) (let ((.cse18 (+ .cse19 1))) (or (< c_~min2~0 .cse18) (< c_~min3~0 .cse18) (= c_~min1~0 .cse19))))) (or .cse0 .cse2 .cse9)))))) is different from false [2023-11-17 12:23:25,069 INFO L124 PetriNetUnfolderBase]: 826/1212 cut-off events. [2023-11-17 12:23:25,069 INFO L125 PetriNetUnfolderBase]: For 715/715 co-relation queries the response was YES. [2023-11-17 12:23:25,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3473 conditions, 1212 events. 826/1212 cut-off events. For 715/715 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4378 event pairs, 60 based on Foata normal form. 1/1211 useless extension candidates. Maximal degree in co-relation 2595. Up to 703 conditions per place. [2023-11-17 12:23:25,078 INFO L140 encePairwiseOnDemand]: 24/42 looper letters, 87 selfloop transitions, 38 changer transitions 1/126 dead transitions. [2023-11-17 12:23:25,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 126 transitions, 671 flow [2023-11-17 12:23:25,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-17 12:23:25,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-17 12:23:25,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 166 transitions. [2023-11-17 12:23:25,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3593073593073593 [2023-11-17 12:23:25,083 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 166 transitions. [2023-11-17 12:23:25,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 166 transitions. [2023-11-17 12:23:25,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:23:25,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 166 transitions. [2023-11-17 12:23:25,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 15.090909090909092) internal successors, (166), 11 states have internal predecessors, (166), 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:23:25,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 42.0) internal successors, (504), 12 states have internal predecessors, (504), 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:23:25,088 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 42.0) internal successors, (504), 12 states have internal predecessors, (504), 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:23:25,088 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 113 flow. Second operand 11 states and 166 transitions. [2023-11-17 12:23:25,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 126 transitions, 671 flow [2023-11-17 12:23:25,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 126 transitions, 655 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-17 12:23:25,095 INFO L231 Difference]: Finished difference. Result has 47 places, 63 transitions, 387 flow [2023-11-17 12:23:25,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=387, PETRI_PLACES=47, PETRI_TRANSITIONS=63} [2023-11-17 12:23:25,097 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2023-11-17 12:23:25,097 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 63 transitions, 387 flow [2023-11-17 12:23:25,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.461538461538462) internal successors, (168), 26 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:23:25,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:23:25,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:23:25,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-17 12:23:25,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:23:25,305 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:23:25,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:23:25,306 INFO L85 PathProgramCache]: Analyzing trace with hash 88646219, now seen corresponding path program 2 times [2023-11-17 12:23:25,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:23:25,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617988327] [2023-11-17 12:23:25,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:23:25,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:23:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:23:25,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:23:25,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:23:25,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617988327] [2023-11-17 12:23:25,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617988327] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:23:25,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883001410] [2023-11-17 12:23:25,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 12:23:25,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:23:25,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:23:25,876 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:23:25,893 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:23:25,971 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 12:23:25,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:23:25,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-17 12:23:25,975 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:23:26,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2023-11-17 12:23:26,262 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:23:26,263 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:23:26,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:23:26,510 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 131 treesize of output 75 [2023-11-17 12:23:26,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:23:26,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883001410] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:23:26,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:23:26,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2023-11-17 12:23:26,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821387150] [2023-11-17 12:23:26,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:23:26,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-17 12:23:26,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:23:26,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-17 12:23:26,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2023-11-17 12:23:26,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 42 [2023-11-17 12:23:26,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 63 transitions, 387 flow. Second operand has 18 states, 18 states have (on average 6.888888888888889) internal successors, (124), 18 states have internal predecessors, (124), 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:23:26,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:23:26,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 42 [2023-11-17 12:23:26,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:23:27,319 INFO L124 PetriNetUnfolderBase]: 973/1426 cut-off events. [2023-11-17 12:23:27,319 INFO L125 PetriNetUnfolderBase]: For 1754/1754 co-relation queries the response was YES. [2023-11-17 12:23:27,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5558 conditions, 1426 events. 973/1426 cut-off events. For 1754/1754 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5307 event pairs, 132 based on Foata normal form. 1/1426 useless extension candidates. Maximal degree in co-relation 4397. Up to 1101 conditions per place. [2023-11-17 12:23:27,329 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 88 selfloop transitions, 26 changer transitions 1/115 dead transitions. [2023-11-17 12:23:27,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 115 transitions, 866 flow [2023-11-17 12:23:27,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 12:23:27,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 12:23:27,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 119 transitions. [2023-11-17 12:23:27,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3148148148148148 [2023-11-17 12:23:27,331 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 119 transitions. [2023-11-17 12:23:27,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 119 transitions. [2023-11-17 12:23:27,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:23:27,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 119 transitions. [2023-11-17 12:23:27,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 13.222222222222221) internal successors, (119), 9 states have internal predecessors, (119), 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:23:27,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 42.0) internal successors, (420), 10 states have internal predecessors, (420), 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:23:27,333 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 42.0) internal successors, (420), 10 states have internal predecessors, (420), 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:23:27,333 INFO L175 Difference]: Start difference. First operand has 47 places, 63 transitions, 387 flow. Second operand 9 states and 119 transitions. [2023-11-17 12:23:27,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 115 transitions, 866 flow [2023-11-17 12:23:27,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 115 transitions, 818 flow, removed 23 selfloop flow, removed 1 redundant places. [2023-11-17 12:23:27,339 INFO L231 Difference]: Finished difference. Result has 58 places, 77 transitions, 530 flow [2023-11-17 12:23:27,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=530, PETRI_PLACES=58, PETRI_TRANSITIONS=77} [2023-11-17 12:23:27,340 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 28 predicate places. [2023-11-17 12:23:27,340 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 77 transitions, 530 flow [2023-11-17 12:23:27,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.888888888888889) internal successors, (124), 18 states have internal predecessors, (124), 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:23:27,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:23:27,340 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:23:27,349 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:23:27,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:23:27,549 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:23:27,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:23:27,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1728962175, now seen corresponding path program 3 times [2023-11-17 12:23:27,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:23:27,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464587241] [2023-11-17 12:23:27,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:23:27,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:23:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:23:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:23:28,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:23:28,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464587241] [2023-11-17 12:23:28,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464587241] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:23:28,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803903544] [2023-11-17 12:23:28,085 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 12:23:28,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:23:28,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:23:28,086 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:23:28,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-17 12:23:28,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 12:23:28,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:23:28,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-17 12:23:28,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:23:28,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2023-11-17 12:23:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:23:28,574 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:23:28,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:23:28,826 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 131 treesize of output 75 [2023-11-17 12:23:29,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:23:29,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803903544] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:23:29,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:23:29,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 19 [2023-11-17 12:23:29,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804743289] [2023-11-17 12:23:29,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:23:29,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-17 12:23:29,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:23:29,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-17 12:23:29,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2023-11-17 12:23:29,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 42 [2023-11-17 12:23:29,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 77 transitions, 530 flow. Second operand has 21 states, 21 states have (on average 7.095238095238095) internal successors, (149), 21 states have internal predecessors, (149), 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:23:29,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:23:29,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 42 [2023-11-17 12:23:29,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:23:29,831 INFO L124 PetriNetUnfolderBase]: 1413/2083 cut-off events. [2023-11-17 12:23:29,831 INFO L125 PetriNetUnfolderBase]: For 3505/3505 co-relation queries the response was YES. [2023-11-17 12:23:29,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8512 conditions, 2083 events. 1413/2083 cut-off events. For 3505/3505 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8648 event pairs, 107 based on Foata normal form. 2/2060 useless extension candidates. Maximal degree in co-relation 7381. Up to 1364 conditions per place. [2023-11-17 12:23:29,844 INFO L140 encePairwiseOnDemand]: 29/42 looper letters, 127 selfloop transitions, 70 changer transitions 1/198 dead transitions. [2023-11-17 12:23:29,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 198 transitions, 1583 flow [2023-11-17 12:23:29,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-17 12:23:29,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-17 12:23:29,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 185 transitions. [2023-11-17 12:23:29,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31462585034013607 [2023-11-17 12:23:29,845 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 185 transitions. [2023-11-17 12:23:29,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 185 transitions. [2023-11-17 12:23:29,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:23:29,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 185 transitions. [2023-11-17 12:23:29,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 13.214285714285714) internal successors, (185), 14 states have internal predecessors, (185), 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:23:29,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 42.0) internal successors, (630), 15 states have internal predecessors, (630), 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:23:29,847 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 42.0) internal successors, (630), 15 states have internal predecessors, (630), 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:23:29,847 INFO L175 Difference]: Start difference. First operand has 58 places, 77 transitions, 530 flow. Second operand 14 states and 185 transitions. [2023-11-17 12:23:29,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 198 transitions, 1583 flow [2023-11-17 12:23:29,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 198 transitions, 1539 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-17 12:23:29,859 INFO L231 Difference]: Finished difference. Result has 76 places, 122 transitions, 1094 flow [2023-11-17 12:23:29,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1094, PETRI_PLACES=76, PETRI_TRANSITIONS=122} [2023-11-17 12:23:29,860 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 46 predicate places. [2023-11-17 12:23:29,860 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 122 transitions, 1094 flow [2023-11-17 12:23:29,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.095238095238095) internal successors, (149), 21 states have internal predecessors, (149), 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:23:29,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:23:29,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:23:29,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-17 12:23:30,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:23:30,066 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:23:30,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:23:30,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1506250497, now seen corresponding path program 4 times [2023-11-17 12:23:30,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:23:30,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240620032] [2023-11-17 12:23:30,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:23:30,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:23:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:23:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:23:30,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:23:30,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240620032] [2023-11-17 12:23:30,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240620032] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:23:30,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355329833] [2023-11-17 12:23:30,654 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 12:23:30,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:23:30,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:23:30,663 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:23:30,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-17 12:23:30,754 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 12:23:30,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:23:30,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-17 12:23:30,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:23:30,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 930 treesize of output 898 [2023-11-17 12:23:30,944 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 44 treesize of output 35 [2023-11-17 12:23:31,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 41 [2023-11-17 12:23:31,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:23:31,077 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:23:31,309 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~min2~0 c_~min1~0)) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or .cse0 (and (forall ((v_ArrVal_215 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_215) c_~A~0.base) .cse2))) (or (< c_~min3~0 (+ .cse1 1)) (= c_~min1~0 .cse1)))) (forall ((v_ArrVal_215 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_215) c_~A~0.base) .cse2))) (or (< .cse3 c_~min2~0) (< c_~min3~0 (+ .cse3 1))))))) (or (and .cse0 (<= c_~min2~0 c_~min3~0)) (forall ((v_ArrVal_215 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_215) c_~A~0.base) .cse2) c_~min3~0)) (and (= c_~min1~0 c_~min3~0) (<= (+ c_~min3~0 1) c_~min2~0))) (forall ((v_ArrVal_215 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_215) c_~A~0.base) .cse2))) (let ((.cse4 (+ .cse5 1))) (or (< c_~min3~0 .cse4) (= c_~min1~0 .cse5) (< c_~min2~0 .cse4))))))) is different from false [2023-11-17 12:23:31,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:23:31,372 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 322 treesize of output 242 [2023-11-17 12:23:31,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 190 [2023-11-17 12:23:31,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 178 [2023-11-17 12:23:31,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 172 [2023-11-17 12:23:31,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 154 [2023-11-17 12:23:31,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-17 12:23:31,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355329833] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:23:31,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:23:31,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 21 [2023-11-17 12:23:31,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925379150] [2023-11-17 12:23:31,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:23:31,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-17 12:23:31,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:23:31,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-17 12:23:31,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=369, Unknown=1, NotChecked=40, Total=506 [2023-11-17 12:23:31,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 42 [2023-11-17 12:23:31,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 122 transitions, 1094 flow. Second operand has 23 states, 23 states have (on average 6.739130434782608) internal successors, (155), 23 states have internal predecessors, (155), 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:23:31,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:23:31,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 42 [2023-11-17 12:23:31,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:23:32,685 INFO L124 PetriNetUnfolderBase]: 1806/2686 cut-off events. [2023-11-17 12:23:32,685 INFO L125 PetriNetUnfolderBase]: For 8426/8426 co-relation queries the response was YES. [2023-11-17 12:23:32,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13105 conditions, 2686 events. 1806/2686 cut-off events. For 8426/8426 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11938 event pairs, 195 based on Foata normal form. 2/2688 useless extension candidates. Maximal degree in co-relation 11033. Up to 1613 conditions per place. [2023-11-17 12:23:32,705 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 132 selfloop transitions, 108 changer transitions 1/241 dead transitions. [2023-11-17 12:23:32,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 241 transitions, 2423 flow [2023-11-17 12:23:32,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-17 12:23:32,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-17 12:23:32,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 179 transitions. [2023-11-17 12:23:32,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.304421768707483 [2023-11-17 12:23:32,707 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 179 transitions. [2023-11-17 12:23:32,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 179 transitions. [2023-11-17 12:23:32,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:23:32,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 179 transitions. [2023-11-17 12:23:32,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 12.785714285714286) internal successors, (179), 14 states have internal predecessors, (179), 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:23:32,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 42.0) internal successors, (630), 15 states have internal predecessors, (630), 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:23:32,709 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 42.0) internal successors, (630), 15 states have internal predecessors, (630), 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:23:32,709 INFO L175 Difference]: Start difference. First operand has 76 places, 122 transitions, 1094 flow. Second operand 14 states and 179 transitions. [2023-11-17 12:23:32,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 241 transitions, 2423 flow [2023-11-17 12:23:32,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 241 transitions, 2303 flow, removed 31 selfloop flow, removed 4 redundant places. [2023-11-17 12:23:32,739 INFO L231 Difference]: Finished difference. Result has 93 places, 169 transitions, 1847 flow [2023-11-17 12:23:32,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1847, PETRI_PLACES=93, PETRI_TRANSITIONS=169} [2023-11-17 12:23:32,740 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 63 predicate places. [2023-11-17 12:23:32,740 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 169 transitions, 1847 flow [2023-11-17 12:23:32,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.739130434782608) internal successors, (155), 23 states have internal predecessors, (155), 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:23:32,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:23:32,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:23:32,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-17 12:23:32,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:23:32,946 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:23:32,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:23:32,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2089691883, now seen corresponding path program 5 times [2023-11-17 12:23:32,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:23:32,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114337145] [2023-11-17 12:23:32,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:23:32,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:23:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:23:33,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:23:33,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:23:33,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114337145] [2023-11-17 12:23:33,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114337145] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:23:33,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968966852] [2023-11-17 12:23:33,430 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 12:23:33,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:23:33,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:23:33,431 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 12:23:33,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-17 12:23:33,529 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 12:23:33,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:23:33,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-17 12:23:33,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:23:33,596 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 15 treesize of output 1 [2023-11-17 12:23:33,644 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:23:33,699 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:23:33,776 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:23:34,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2023-11-17 12:23:34,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:23:34,085 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:23:38,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:23:38,484 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 1 case distinctions, treesize of input 156 treesize of output 108 [2023-11-17 12:23:38,500 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-17 12:23:38,500 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 2557 treesize of output 2432 [2023-11-17 12:23:38,534 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 12:23:38,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 255 treesize of output 211 [2023-11-17 12:23:38,549 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 12:23:38,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 211 treesize of output 189 [2023-11-17 12:23:38,651 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 12:23:38,651 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 273 treesize of output 185 [2023-11-17 12:23:38,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:23:38,699 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 1 case distinctions, treesize of input 95 treesize of output 71 [2023-11-17 12:23:38,730 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:23:38,731 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 1752 treesize of output 1676 [2023-11-17 12:23:38,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:23:38,757 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 172 [2023-11-17 12:23:38,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:23:38,767 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 158 [2023-11-17 12:23:38,846 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:23:38,847 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 211 treesize of output 159 [2023-11-17 12:23:38,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:23:38,975 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 1 case distinctions, treesize of input 95 treesize of output 71 [2023-11-17 12:23:38,999 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:23:38,999 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 3536 treesize of output 3380 [2023-11-17 12:23:39,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:23:39,043 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 178 [2023-11-17 12:23:39,061 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:23:39,061 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 380 treesize of output 328 [2023-11-17 12:23:39,087 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:23:39,088 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 175 treesize of output 151 [2023-11-17 12:23:39,203 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 12:23:39,203 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 1 case distinctions, treesize of input 129 treesize of output 1 [2023-11-17 12:23:39,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:23:39,215 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 1 case distinctions, treesize of input 125 treesize of output 89 [2023-11-17 12:23:39,236 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:23:39,236 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 2293 treesize of output 2201 [2023-11-17 12:23:39,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:23:39,285 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 229 [2023-11-17 12:23:39,306 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:23:39,307 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 485 treesize of output 425 [2023-11-17 12:23:39,341 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:23:39,342 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 225 treesize of output 197 [2023-11-17 12:23:39,548 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 12:23:39,548 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 1 case distinctions, treesize of input 150 treesize of output 1 [2023-11-17 12:23:39,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:23:39,562 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 1 case distinctions, treesize of input 91 treesize of output 67 [2023-11-17 12:23:39,585 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:23:39,586 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 3280 treesize of output 3156 [2023-11-17 12:23:39,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:23:39,616 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 170 [2023-11-17 12:23:39,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:23:39,626 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 305 treesize of output 265 [2023-11-17 12:23:39,643 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:23:39,643 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 168 treesize of output 152 [2023-11-17 12:23:39,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:23:39,932 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 1 case distinctions, treesize of input 119 treesize of output 83 [2023-11-17 12:23:39,947 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:23:39,948 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 2101 treesize of output 2025 [2023-11-17 12:23:39,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:23:39,981 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 233 treesize of output 221 [2023-11-17 12:23:40,001 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:23:40,002 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 461 treesize of output 417 [2023-11-17 12:23:40,027 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:23:40,027 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 217 treesize of output 197 [2023-11-17 12:23:40,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:23:40,231 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 1 case distinctions, treesize of input 91 treesize of output 67 [2023-11-17 12:23:40,255 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:23:40,255 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 1624 treesize of output 1564 [2023-11-17 12:23:40,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:23:40,290 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 160 [2023-11-17 12:23:40,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:23:40,304 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 150 [2023-11-17 12:23:40,325 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:23:40,325 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 187 treesize of output 151 [2023-11-17 12:23:40,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:23:40,519 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 1 case distinctions, treesize of input 61 treesize of output 49 [2023-11-17 12:23:40,538 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:23:40,538 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 531 treesize of output 511 [2023-11-17 12:23:40,559 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:23:40,559 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 275 treesize of output 263 [2023-11-17 12:23:40,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:23:40,571 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 125 [2023-11-17 12:23:40,585 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:23:40,585 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 251 treesize of output 223 [2023-11-17 12:23:40,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:23:40,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968966852] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:23:40,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:23:40,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 26 [2023-11-17 12:23:40,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761993729] [2023-11-17 12:23:40,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:23:40,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-17 12:23:40,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:23:40,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-17 12:23:40,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=606, Unknown=4, NotChecked=0, Total=756 [2023-11-17 12:23:40,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 42 [2023-11-17 12:23:40,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 169 transitions, 1847 flow. Second operand has 28 states, 28 states have (on average 6.464285714285714) internal successors, (181), 28 states have internal predecessors, (181), 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:23:40,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:23:40,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 42 [2023-11-17 12:23:40,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:23:43,745 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:23:45,949 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:23:48,590 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:23:52,785 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:23:54,811 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:24:00,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:24:02,693 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:24:04,929 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:24:10,541 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:24:12,560 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:24:14,640 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:24:16,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 12:24:21,252 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:24:23,262 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:24:26,916 INFO L124 PetriNetUnfolderBase]: 2458/3628 cut-off events. [2023-11-17 12:24:26,917 INFO L125 PetriNetUnfolderBase]: For 20326/20326 co-relation queries the response was YES. [2023-11-17 12:24:26,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20834 conditions, 3628 events. 2458/3628 cut-off events. For 20326/20326 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 16978 event pairs, 160 based on Foata normal form. 26/3654 useless extension candidates. Maximal degree in co-relation 17885. Up to 2251 conditions per place. [2023-11-17 12:24:26,967 INFO L140 encePairwiseOnDemand]: 27/42 looper letters, 249 selfloop transitions, 129 changer transitions 4/382 dead transitions. [2023-11-17 12:24:26,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 382 transitions, 4148 flow [2023-11-17 12:24:26,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-17 12:24:26,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-11-17 12:24:26,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 427 transitions. [2023-11-17 12:24:26,970 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30808080808080807 [2023-11-17 12:24:26,970 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 427 transitions. [2023-11-17 12:24:26,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 427 transitions. [2023-11-17 12:24:26,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:24:26,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 427 transitions. [2023-11-17 12:24:26,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 12.93939393939394) internal successors, (427), 33 states have internal predecessors, (427), 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:24:26,974 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 42.0) internal successors, (1428), 34 states have internal predecessors, (1428), 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:24:26,975 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 42.0) internal successors, (1428), 34 states have internal predecessors, (1428), 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:24:26,975 INFO L175 Difference]: Start difference. First operand has 93 places, 169 transitions, 1847 flow. Second operand 33 states and 427 transitions. [2023-11-17 12:24:26,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 382 transitions, 4148 flow [2023-11-17 12:24:27,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 382 transitions, 4087 flow, removed 27 selfloop flow, removed 3 redundant places. [2023-11-17 12:24:27,027 INFO L231 Difference]: Finished difference. Result has 137 places, 216 transitions, 2702 flow [2023-11-17 12:24:27,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1700, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=2702, PETRI_PLACES=137, PETRI_TRANSITIONS=216} [2023-11-17 12:24:27,028 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 107 predicate places. [2023-11-17 12:24:27,028 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 216 transitions, 2702 flow [2023-11-17 12:24:27,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.464285714285714) internal successors, (181), 28 states have internal predecessors, (181), 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:24:27,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:24:27,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:24:27,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-17 12:24:27,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:24:27,234 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:24:27,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:24:27,234 INFO L85 PathProgramCache]: Analyzing trace with hash -2069640487, now seen corresponding path program 6 times [2023-11-17 12:24:27,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:24:27,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453960824] [2023-11-17 12:24:27,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:24:27,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:24:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:24:27,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:24:27,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:24:27,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453960824] [2023-11-17 12:24:27,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453960824] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:24:27,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640946156] [2023-11-17 12:24:27,684 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 12:24:27,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:24:27,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:24:27,686 INFO L229 MonitoredProcess]: Starting monitored process 8 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:24:27,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-17 12:24:27,788 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-17 12:24:27,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:24:27,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-17 12:24:27,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:24:27,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2023-11-17 12:24:28,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:24:28,021 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:24:28,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:24:28,186 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 123 treesize of output 75 [2023-11-17 12:24:28,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:24:28,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640946156] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:24:28,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:24:28,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 17 [2023-11-17 12:24:28,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804391063] [2023-11-17 12:24:28,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:24:28,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-17 12:24:28,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:24:28,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-17 12:24:28,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-11-17 12:24:28,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 42 [2023-11-17 12:24:28,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 216 transitions, 2702 flow. Second operand has 19 states, 19 states have (on average 6.894736842105263) internal successors, (131), 19 states have internal predecessors, (131), 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:24:28,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:24:28,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 42 [2023-11-17 12:24:28,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:24:29,285 INFO L124 PetriNetUnfolderBase]: 2508/3720 cut-off events. [2023-11-17 12:24:29,285 INFO L125 PetriNetUnfolderBase]: For 30568/30568 co-relation queries the response was YES. [2023-11-17 12:24:29,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24455 conditions, 3720 events. 2508/3720 cut-off events. For 30568/30568 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 17417 event pairs, 546 based on Foata normal form. 2/3722 useless extension candidates. Maximal degree in co-relation 24061. Up to 3338 conditions per place. [2023-11-17 12:24:29,312 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 191 selfloop transitions, 76 changer transitions 1/268 dead transitions. [2023-11-17 12:24:29,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 268 transitions, 3617 flow [2023-11-17 12:24:29,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-17 12:24:29,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-17 12:24:29,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 169 transitions. [2023-11-17 12:24:29,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26825396825396824 [2023-11-17 12:24:29,315 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 169 transitions. [2023-11-17 12:24:29,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 169 transitions. [2023-11-17 12:24:29,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:24:29,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 169 transitions. [2023-11-17 12:24:29,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 11.266666666666667) internal successors, (169), 15 states have internal predecessors, (169), 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:24:29,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 42.0) internal successors, (672), 16 states have internal predecessors, (672), 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:24:29,318 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 42.0) internal successors, (672), 16 states have internal predecessors, (672), 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:24:29,318 INFO L175 Difference]: Start difference. First operand has 137 places, 216 transitions, 2702 flow. Second operand 15 states and 169 transitions. [2023-11-17 12:24:29,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 268 transitions, 3617 flow [2023-11-17 12:24:29,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 268 transitions, 3101 flow, removed 196 selfloop flow, removed 13 redundant places. [2023-11-17 12:24:29,417 INFO L231 Difference]: Finished difference. Result has 140 places, 222 transitions, 2463 flow [2023-11-17 12:24:29,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2202, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2463, PETRI_PLACES=140, PETRI_TRANSITIONS=222} [2023-11-17 12:24:29,418 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 110 predicate places. [2023-11-17 12:24:29,418 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 222 transitions, 2463 flow [2023-11-17 12:24:29,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.894736842105263) internal successors, (131), 19 states have internal predecessors, (131), 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:24:29,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:24:29,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:24:29,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-17 12:24:29,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:24:29,625 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:24:29,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:24:29,625 INFO L85 PathProgramCache]: Analyzing trace with hash 190419875, now seen corresponding path program 7 times [2023-11-17 12:24:29,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:24:29,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3224334] [2023-11-17 12:24:29,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:24:29,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:24:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:24:30,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:24:30,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:24:30,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3224334] [2023-11-17 12:24:30,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3224334] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:24:30,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049425979] [2023-11-17 12:24:30,055 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 12:24:30,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:24:30,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:24:30,056 INFO L229 MonitoredProcess]: Starting monitored process 9 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:24:30,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-17 12:24:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:24:30,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-17 12:24:30,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:24:30,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2023-11-17 12:24:30,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:24:30,425 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:24:30,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:24:30,605 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 107 treesize of output 75 [2023-11-17 12:24:30,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:24:30,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049425979] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:24:30,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:24:30,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2023-11-17 12:24:30,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057873287] [2023-11-17 12:24:30,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:24:30,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-17 12:24:30,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:24:30,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-17 12:24:30,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2023-11-17 12:24:30,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 42 [2023-11-17 12:24:30,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 222 transitions, 2463 flow. Second operand has 20 states, 20 states have (on average 7.2) internal successors, (144), 20 states have internal predecessors, (144), 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:24:30,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:24:30,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 42 [2023-11-17 12:24:30,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:24:32,083 INFO L124 PetriNetUnfolderBase]: 2926/4327 cut-off events. [2023-11-17 12:24:32,084 INFO L125 PetriNetUnfolderBase]: For 29428/29428 co-relation queries the response was YES. [2023-11-17 12:24:32,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26142 conditions, 4327 events. 2926/4327 cut-off events. For 29428/29428 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 20924 event pairs, 581 based on Foata normal form. 1/4328 useless extension candidates. Maximal degree in co-relation 25820. Up to 3652 conditions per place. [2023-11-17 12:24:32,110 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 227 selfloop transitions, 105 changer transitions 1/333 dead transitions. [2023-11-17 12:24:32,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 333 transitions, 4128 flow [2023-11-17 12:24:32,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-17 12:24:32,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-17 12:24:32,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 235 transitions. [2023-11-17 12:24:32,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.27976190476190477 [2023-11-17 12:24:32,112 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 235 transitions. [2023-11-17 12:24:32,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 235 transitions. [2023-11-17 12:24:32,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:24:32,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 235 transitions. [2023-11-17 12:24:32,114 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 11.75) internal successors, (235), 20 states have internal predecessors, (235), 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:24:32,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 42.0) internal successors, (882), 21 states have internal predecessors, (882), 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:24:32,115 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 42.0) internal successors, (882), 21 states have internal predecessors, (882), 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:24:32,115 INFO L175 Difference]: Start difference. First operand has 140 places, 222 transitions, 2463 flow. Second operand 20 states and 235 transitions. [2023-11-17 12:24:32,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 333 transitions, 4128 flow [2023-11-17 12:24:32,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 333 transitions, 3979 flow, removed 22 selfloop flow, removed 11 redundant places. [2023-11-17 12:24:32,206 INFO L231 Difference]: Finished difference. Result has 153 places, 262 transitions, 3103 flow [2023-11-17 12:24:32,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2333, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3103, PETRI_PLACES=153, PETRI_TRANSITIONS=262} [2023-11-17 12:24:32,207 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 123 predicate places. [2023-11-17 12:24:32,207 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 262 transitions, 3103 flow [2023-11-17 12:24:32,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.2) internal successors, (144), 20 states have internal predecessors, (144), 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:24:32,208 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:24:32,208 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:24:32,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-17 12:24:32,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-17 12:24:32,420 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:24:32,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:24:32,421 INFO L85 PathProgramCache]: Analyzing trace with hash 10831109, now seen corresponding path program 8 times [2023-11-17 12:24:32,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:24:32,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440090280] [2023-11-17 12:24:32,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:24:32,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:24:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:24:32,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:24:32,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:24:32,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440090280] [2023-11-17 12:24:32,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440090280] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:24:32,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942184409] [2023-11-17 12:24:32,839 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 12:24:32,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:24:32,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:24:32,845 INFO L229 MonitoredProcess]: Starting monitored process 10 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:24:32,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-17 12:24:32,954 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 12:24:32,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:24:32,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-17 12:24:32,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:24:33,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2023-11-17 12:24:33,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:24:33,225 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:24:33,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:24:33,410 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 123 treesize of output 75 [2023-11-17 12:24:33,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:24:33,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942184409] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:24:33,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:24:33,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2023-11-17 12:24:33,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517579389] [2023-11-17 12:24:33,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:24:33,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-17 12:24:33,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:24:33,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-17 12:24:33,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2023-11-17 12:24:33,759 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 42 [2023-11-17 12:24:33,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 262 transitions, 3103 flow. Second operand has 19 states, 19 states have (on average 6.894736842105263) internal successors, (131), 19 states have internal predecessors, (131), 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:24:33,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:24:33,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 42 [2023-11-17 12:24:33,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:24:34,686 INFO L124 PetriNetUnfolderBase]: 3020/4466 cut-off events. [2023-11-17 12:24:34,686 INFO L125 PetriNetUnfolderBase]: For 33796/33796 co-relation queries the response was YES. [2023-11-17 12:24:34,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28025 conditions, 4466 events. 3020/4466 cut-off events. For 33796/33796 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 21741 event pairs, 691 based on Foata normal form. 1/4467 useless extension candidates. Maximal degree in co-relation 27694. Up to 4111 conditions per place. [2023-11-17 12:24:34,729 INFO L140 encePairwiseOnDemand]: 31/42 looper letters, 230 selfloop transitions, 81 changer transitions 1/312 dead transitions. [2023-11-17 12:24:34,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 312 transitions, 4132 flow [2023-11-17 12:24:34,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-17 12:24:34,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-17 12:24:34,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 188 transitions. [2023-11-17 12:24:34,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24867724867724866 [2023-11-17 12:24:34,731 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 188 transitions. [2023-11-17 12:24:34,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 188 transitions. [2023-11-17 12:24:34,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:24:34,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 188 transitions. [2023-11-17 12:24:34,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 10.444444444444445) internal successors, (188), 18 states have internal predecessors, (188), 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:24:34,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 42.0) internal successors, (798), 19 states have internal predecessors, (798), 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:24:34,733 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 42.0) internal successors, (798), 19 states have internal predecessors, (798), 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:24:34,733 INFO L175 Difference]: Start difference. First operand has 153 places, 262 transitions, 3103 flow. Second operand 18 states and 188 transitions. [2023-11-17 12:24:34,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 312 transitions, 4132 flow [2023-11-17 12:24:34,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 312 transitions, 3816 flow, removed 133 selfloop flow, removed 8 redundant places. [2023-11-17 12:24:34,948 INFO L231 Difference]: Finished difference. Result has 165 places, 269 transitions, 3101 flow [2023-11-17 12:24:34,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2811, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3101, PETRI_PLACES=165, PETRI_TRANSITIONS=269} [2023-11-17 12:24:34,951 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 135 predicate places. [2023-11-17 12:24:34,951 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 269 transitions, 3101 flow [2023-11-17 12:24:34,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.894736842105263) internal successors, (131), 19 states have internal predecessors, (131), 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:24:34,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:24:34,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:24:34,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-17 12:24:35,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:24:35,164 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:24:35,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:24:35,164 INFO L85 PathProgramCache]: Analyzing trace with hash 871112831, now seen corresponding path program 9 times [2023-11-17 12:24:35,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:24:35,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426798270] [2023-11-17 12:24:35,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:24:35,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:24:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:24:35,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:24:35,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:24:35,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426798270] [2023-11-17 12:24:35,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426798270] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:24:35,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151956141] [2023-11-17 12:24:35,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 12:24:35,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:24:35,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:24:35,773 INFO L229 MonitoredProcess]: Starting monitored process 11 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:24:35,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-17 12:24:35,872 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 12:24:35,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:24:35,874 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-17 12:24:35,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:24:35,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:24:35,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:24:35,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-17 12:24:35,945 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:24:35,984 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:24:36,132 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 38 treesize of output 29 [2023-11-17 12:24:36,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:24:36,220 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 38 treesize of output 29 [2023-11-17 12:24:36,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2023-11-17 12:24:36,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:24:36,368 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:24:36,611 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (= c_~min2~0 c_~min1~0)) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_387 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~A~0.base) .cse2))) (let ((.cse0 (+ .cse1 1))) (or (< c_~min2~0 .cse0) (< c_~min3~0 .cse0) (= c_~min1~0 .cse1))))) (or (and .cse3 (<= c_~min2~0 c_~min3~0)) (forall ((v_ArrVal_387 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~A~0.base) .cse2) c_~min3~0)) (and (= c_~min1~0 c_~min3~0) (<= (+ c_~min3~0 1) c_~min2~0))) (or .cse3 (and (forall ((v_ArrVal_387 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~A~0.base) .cse2))) (or (< c_~min3~0 (+ .cse4 1)) (= c_~min1~0 .cse4)))) (forall ((v_ArrVal_387 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_387) c_~A~0.base) .cse2))) (or (< c_~min3~0 (+ .cse5 1)) (< .cse5 c_~min2~0)))))))) is different from false [2023-11-17 12:24:38,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:24:38,093 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 1 case distinctions, treesize of input 101 treesize of output 65 [2023-11-17 12:24:38,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:24:38,105 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 365 treesize of output 345 [2023-11-17 12:24:38,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 140 [2023-11-17 12:24:38,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 116 [2023-11-17 12:24:38,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:24:38,134 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 88 treesize of output 84 [2023-11-17 12:24:38,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:24:38,468 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 1 case distinctions, treesize of input 79 treesize of output 55 [2023-11-17 12:24:38,471 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 12:24:38,471 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 12:24:38,479 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:24:38,479 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 76 treesize of output 64 [2023-11-17 12:24:38,502 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:24:38,503 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 34 treesize of output 28 [2023-11-17 12:24:38,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:24:38,523 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 1 case distinctions, treesize of input 89 treesize of output 65 [2023-11-17 12:24:38,527 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 12:24:38,527 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 12:24:38,535 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:24:38,536 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 84 treesize of output 68 [2023-11-17 12:24:38,552 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:24:38,552 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 38 treesize of output 28 [2023-11-17 12:24:38,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:24:38,568 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 1 case distinctions, treesize of input 89 treesize of output 65 [2023-11-17 12:24:38,572 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 12:24:38,573 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 12:24:38,580 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:24:38,581 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 84 treesize of output 68 [2023-11-17 12:24:38,602 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:24:38,602 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 40 treesize of output 30 [2023-11-17 12:24:38,631 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 12:24:38,632 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 1 case distinctions, treesize of input 132 treesize of output 1 [2023-11-17 12:24:38,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:24:38,644 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 1 case distinctions, treesize of input 79 treesize of output 55 [2023-11-17 12:24:38,650 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 12:24:38,651 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 12:24:38,659 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:24:38,659 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 76 treesize of output 64 [2023-11-17 12:24:38,676 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:24:38,676 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 34 treesize of output 28 [2023-11-17 12:24:38,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:24:38,699 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 1 case distinctions, treesize of input 113 treesize of output 77 [2023-11-17 12:24:38,703 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 12:24:38,704 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 12:24:38,713 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:24:38,713 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 109 treesize of output 89 [2023-11-17 12:24:38,725 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:24:38,725 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 47 treesize of output 35 [2023-11-17 12:24:38,754 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 12:24:38,754 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 1 case distinctions, treesize of input 123 treesize of output 1 [2023-11-17 12:24:38,772 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 12:24:38,772 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 1 case distinctions, treesize of input 144 treesize of output 1 [2023-11-17 12:24:38,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:24:38,783 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 1 case distinctions, treesize of input 55 treesize of output 43 [2023-11-17 12:24:38,787 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 12:24:38,787 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 12:24:38,795 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:24:38,796 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 51 treesize of output 43 [2023-11-17 12:24:38,807 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 12:24:38,807 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 27 treesize of output 23 [2023-11-17 12:24:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:24:38,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151956141] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:24:38,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:24:38,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2023-11-17 12:24:38,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612896619] [2023-11-17 12:24:38,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:24:38,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-17 12:24:38,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:24:38,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-17 12:24:38,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=472, Unknown=19, NotChecked=46, Total=650 [2023-11-17 12:24:38,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 42 [2023-11-17 12:24:38,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 269 transitions, 3101 flow. Second operand has 26 states, 26 states have (on average 6.538461538461538) internal successors, (170), 26 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:24:38,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:24:38,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 42 [2023-11-17 12:24:38,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:24:40,558 INFO L124 PetriNetUnfolderBase]: 3098/4593 cut-off events. [2023-11-17 12:24:40,558 INFO L125 PetriNetUnfolderBase]: For 33029/33029 co-relation queries the response was YES. [2023-11-17 12:24:40,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28042 conditions, 4593 events. 3098/4593 cut-off events. For 33029/33029 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 22537 event pairs, 473 based on Foata normal form. 2/4595 useless extension candidates. Maximal degree in co-relation 27719. Up to 3212 conditions per place. [2023-11-17 12:24:40,581 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 204 selfloop transitions, 114 changer transitions 1/319 dead transitions. [2023-11-17 12:24:40,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 319 transitions, 4101 flow [2023-11-17 12:24:40,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 12:24:40,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 12:24:40,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 141 transitions. [2023-11-17 12:24:40,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3357142857142857 [2023-11-17 12:24:40,582 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 141 transitions. [2023-11-17 12:24:40,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 141 transitions. [2023-11-17 12:24:40,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:24:40,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 141 transitions. [2023-11-17 12:24:40,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 14.1) internal successors, (141), 10 states have internal predecessors, (141), 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:24:40,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 42.0) internal successors, (462), 11 states have internal predecessors, (462), 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:24:40,584 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 42.0) internal successors, (462), 11 states have internal predecessors, (462), 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:24:40,584 INFO L175 Difference]: Start difference. First operand has 165 places, 269 transitions, 3101 flow. Second operand 10 states and 141 transitions. [2023-11-17 12:24:40,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 319 transitions, 4101 flow [2023-11-17 12:24:40,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 319 transitions, 3878 flow, removed 28 selfloop flow, removed 14 redundant places. [2023-11-17 12:24:40,674 INFO L231 Difference]: Finished difference. Result has 161 places, 274 transitions, 3241 flow [2023-11-17 12:24:40,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2878, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3241, PETRI_PLACES=161, PETRI_TRANSITIONS=274} [2023-11-17 12:24:40,675 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 131 predicate places. [2023-11-17 12:24:40,675 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 274 transitions, 3241 flow [2023-11-17 12:24:40,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.538461538461538) internal successors, (170), 26 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:24:40,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:24:40,675 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:24:40,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-17 12:24:40,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-17 12:24:40,876 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:24:40,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:24:40,877 INFO L85 PathProgramCache]: Analyzing trace with hash 469486166, now seen corresponding path program 10 times [2023-11-17 12:24:40,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:24:40,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140800614] [2023-11-17 12:24:40,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:24:40,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:24:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:24:40,975 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:24:40,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:24:40,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140800614] [2023-11-17 12:24:40,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140800614] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:24:40,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042958336] [2023-11-17 12:24:40,976 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 12:24:40,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:24:40,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:24:40,981 INFO L229 MonitoredProcess]: Starting monitored process 12 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:24:41,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-17 12:24:41,093 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 12:24:41,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:24:41,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 12:24:41,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:24:41,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:24:41,166 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:24:41,227 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:24:41,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042958336] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:24:41,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:24:41,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-11-17 12:24:41,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272161007] [2023-11-17 12:24:41,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:24:41,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-17 12:24:41,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:24:41,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-17 12:24:41,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-11-17 12:24:41,229 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 42 [2023-11-17 12:24:41,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 274 transitions, 3241 flow. Second operand has 14 states, 14 states have (on average 8.214285714285714) internal successors, (115), 14 states have internal predecessors, (115), 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:24:41,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:24:41,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 42 [2023-11-17 12:24:41,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:24:41,888 INFO L124 PetriNetUnfolderBase]: 3265/4790 cut-off events. [2023-11-17 12:24:41,888 INFO L125 PetriNetUnfolderBase]: For 43791/43791 co-relation queries the response was YES. [2023-11-17 12:24:41,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31048 conditions, 4790 events. 3265/4790 cut-off events. For 43791/43791 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 23184 event pairs, 1043 based on Foata normal form. 96/4886 useless extension candidates. Maximal degree in co-relation 30880. Up to 3659 conditions per place. [2023-11-17 12:24:41,915 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 296 selfloop transitions, 42 changer transitions 0/338 dead transitions. [2023-11-17 12:24:41,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 338 transitions, 4569 flow [2023-11-17 12:24:41,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 12:24:41,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 12:24:41,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2023-11-17 12:24:41,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33630952380952384 [2023-11-17 12:24:41,916 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 113 transitions. [2023-11-17 12:24:41,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 113 transitions. [2023-11-17 12:24:41,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:24:41,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 113 transitions. [2023-11-17 12:24:41,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 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:24:41,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 42.0) internal successors, (378), 9 states have internal predecessors, (378), 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:24:41,918 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 42.0) internal successors, (378), 9 states have internal predecessors, (378), 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:24:41,918 INFO L175 Difference]: Start difference. First operand has 161 places, 274 transitions, 3241 flow. Second operand 8 states and 113 transitions. [2023-11-17 12:24:41,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 338 transitions, 4569 flow [2023-11-17 12:24:41,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 338 transitions, 4317 flow, removed 30 selfloop flow, removed 9 redundant places. [2023-11-17 12:24:41,993 INFO L231 Difference]: Finished difference. Result has 162 places, 282 transitions, 3238 flow [2023-11-17 12:24:41,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2991, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3238, PETRI_PLACES=162, PETRI_TRANSITIONS=282} [2023-11-17 12:24:41,994 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 132 predicate places. [2023-11-17 12:24:41,994 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 282 transitions, 3238 flow [2023-11-17 12:24:41,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.214285714285714) internal successors, (115), 14 states have internal predecessors, (115), 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:24:41,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:24:41,994 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:24:42,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-17 12:24:42,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-17 12:24:42,195 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:24:42,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:24:42,195 INFO L85 PathProgramCache]: Analyzing trace with hash 92312812, now seen corresponding path program 11 times [2023-11-17 12:24:42,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:24:42,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108546756] [2023-11-17 12:24:42,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:24:42,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:24:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:24:42,286 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:24:42,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:24:42,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108546756] [2023-11-17 12:24:42,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108546756] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:24:42,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173908837] [2023-11-17 12:24:42,287 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 12:24:42,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:24:42,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:24:42,289 INFO L229 MonitoredProcess]: Starting monitored process 13 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:24:42,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-17 12:24:42,399 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 12:24:42,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:24:42,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 12:24:42,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:24:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:24:42,470 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:24:42,519 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:24:42,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173908837] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:24:42,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:24:42,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-11-17 12:24:42,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17020638] [2023-11-17 12:24:42,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:24:42,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-17 12:24:42,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:24:42,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-17 12:24:42,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-11-17 12:24:42,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 42 [2023-11-17 12:24:42,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 282 transitions, 3238 flow. Second operand has 14 states, 14 states have (on average 7.5) internal successors, (105), 14 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:24:42,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:24:42,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 42 [2023-11-17 12:24:42,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:24:43,300 INFO L124 PetriNetUnfolderBase]: 2815/4259 cut-off events. [2023-11-17 12:24:43,300 INFO L125 PetriNetUnfolderBase]: For 42120/42120 co-relation queries the response was YES. [2023-11-17 12:24:43,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27418 conditions, 4259 events. 2815/4259 cut-off events. For 42120/42120 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 21560 event pairs, 720 based on Foata normal form. 258/4517 useless extension candidates. Maximal degree in co-relation 27317. Up to 2447 conditions per place. [2023-11-17 12:24:43,325 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 327 selfloop transitions, 28 changer transitions 0/355 dead transitions. [2023-11-17 12:24:43,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 355 transitions, 4662 flow [2023-11-17 12:24:43,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 12:24:43,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 12:24:43,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2023-11-17 12:24:43,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36054421768707484 [2023-11-17 12:24:43,327 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 106 transitions. [2023-11-17 12:24:43,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 106 transitions. [2023-11-17 12:24:43,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:24:43,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 106 transitions. [2023-11-17 12:24:43,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 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:24:43,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 42.0) internal successors, (336), 8 states have internal predecessors, (336), 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:24:43,328 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 42.0) internal successors, (336), 8 states have internal predecessors, (336), 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:24:43,328 INFO L175 Difference]: Start difference. First operand has 162 places, 282 transitions, 3238 flow. Second operand 7 states and 106 transitions. [2023-11-17 12:24:43,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 355 transitions, 4662 flow [2023-11-17 12:24:43,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 355 transitions, 4601 flow, removed 26 selfloop flow, removed 6 redundant places. [2023-11-17 12:24:43,441 INFO L231 Difference]: Finished difference. Result has 161 places, 246 transitions, 2878 flow [2023-11-17 12:24:43,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2790, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2878, PETRI_PLACES=161, PETRI_TRANSITIONS=246} [2023-11-17 12:24:43,442 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 131 predicate places. [2023-11-17 12:24:43,442 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 246 transitions, 2878 flow [2023-11-17 12:24:43,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.5) internal successors, (105), 14 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:24:43,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:24:43,442 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:24:43,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-17 12:24:43,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-17 12:24:43,644 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:24:43,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:24:43,644 INFO L85 PathProgramCache]: Analyzing trace with hash -385478319, now seen corresponding path program 12 times [2023-11-17 12:24:43,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:24:43,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689421711] [2023-11-17 12:24:43,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:24:43,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:24:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:24:43,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:24:43,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:24:43,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689421711] [2023-11-17 12:24:43,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689421711] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:24:43,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783446765] [2023-11-17 12:24:43,737 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 12:24:43,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:24:43,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:24:43,741 INFO L229 MonitoredProcess]: Starting monitored process 14 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:24:43,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-17 12:24:43,850 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-17 12:24:43,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:24:43,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-17 12:24:43,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:24:43,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:24:43,959 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:24:44,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:24:44,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783446765] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:24:44,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:24:44,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-11-17 12:24:44,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147414103] [2023-11-17 12:24:44,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:24:44,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-17 12:24:44,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:24:44,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-17 12:24:44,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-11-17 12:24:44,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 42 [2023-11-17 12:24:44,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 246 transitions, 2878 flow. Second operand has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 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:24:44,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:24:44,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 42 [2023-11-17 12:24:44,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:24:44,578 INFO L124 PetriNetUnfolderBase]: 2194/3503 cut-off events. [2023-11-17 12:24:44,578 INFO L125 PetriNetUnfolderBase]: For 34482/34482 co-relation queries the response was YES. [2023-11-17 12:24:44,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22807 conditions, 3503 events. 2194/3503 cut-off events. For 34482/34482 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 18894 event pairs, 673 based on Foata normal form. 337/3840 useless extension candidates. Maximal degree in co-relation 22722. Up to 2101 conditions per place. [2023-11-17 12:24:44,598 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 234 selfloop transitions, 32 changer transitions 11/277 dead transitions. [2023-11-17 12:24:44,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 277 transitions, 3688 flow [2023-11-17 12:24:44,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 12:24:44,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 12:24:44,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2023-11-17 12:24:44,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.336734693877551 [2023-11-17 12:24:44,600 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 99 transitions. [2023-11-17 12:24:44,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 99 transitions. [2023-11-17 12:24:44,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:24:44,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 99 transitions. [2023-11-17 12:24:44,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 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:24:44,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 42.0) internal successors, (336), 8 states have internal predecessors, (336), 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:24:44,601 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 42.0) internal successors, (336), 8 states have internal predecessors, (336), 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:24:44,601 INFO L175 Difference]: Start difference. First operand has 161 places, 246 transitions, 2878 flow. Second operand 7 states and 99 transitions. [2023-11-17 12:24:44,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 277 transitions, 3688 flow [2023-11-17 12:24:44,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 277 transitions, 3553 flow, removed 18 selfloop flow, removed 7 redundant places. [2023-11-17 12:24:44,673 INFO L231 Difference]: Finished difference. Result has 161 places, 213 transitions, 2584 flow [2023-11-17 12:24:44,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2521, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2584, PETRI_PLACES=161, PETRI_TRANSITIONS=213} [2023-11-17 12:24:44,674 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 131 predicate places. [2023-11-17 12:24:44,674 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 213 transitions, 2584 flow [2023-11-17 12:24:44,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 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:24:44,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:24:44,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:24:44,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-17 12:24:44,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-17 12:24:44,875 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:24:44,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:24:44,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1385603186, now seen corresponding path program 1 times [2023-11-17 12:24:44,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:24:44,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164466690] [2023-11-17 12:24:44,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:24:44,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:24:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:24:44,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 12:24:44,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:24:44,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164466690] [2023-11-17 12:24:44,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164466690] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:24:44,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842079375] [2023-11-17 12:24:44,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:24:44,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:24:44,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:24:44,962 INFO L229 MonitoredProcess]: Starting monitored process 15 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:24:44,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-17 12:24:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:24:45,073 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 12:24:45,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:24:45,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 12:24:45,124 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:24:45,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 12:24:45,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842079375] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:24:45,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:24:45,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-11-17 12:24:45,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594923749] [2023-11-17 12:24:45,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:24:45,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-17 12:24:45,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:24:45,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-17 12:24:45,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-11-17 12:24:45,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 42 [2023-11-17 12:24:45,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 213 transitions, 2584 flow. Second operand has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 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:24:45,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:24:45,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 42 [2023-11-17 12:24:45,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:24:45,762 INFO L124 PetriNetUnfolderBase]: 1749/2962 cut-off events. [2023-11-17 12:24:45,763 INFO L125 PetriNetUnfolderBase]: For 31896/31896 co-relation queries the response was YES. [2023-11-17 12:24:45,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19738 conditions, 2962 events. 1749/2962 cut-off events. For 31896/31896 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 16955 event pairs, 796 based on Foata normal form. 246/3208 useless extension candidates. Maximal degree in co-relation 19510. Up to 1906 conditions per place. [2023-11-17 12:24:45,778 INFO L140 encePairwiseOnDemand]: 36/42 looper letters, 112 selfloop transitions, 3 changer transitions 105/220 dead transitions. [2023-11-17 12:24:45,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 220 transitions, 3068 flow [2023-11-17 12:24:45,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 12:24:45,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 12:24:45,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2023-11-17 12:24:45,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3253968253968254 [2023-11-17 12:24:45,779 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 82 transitions. [2023-11-17 12:24:45,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 82 transitions. [2023-11-17 12:24:45,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:24:45,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 82 transitions. [2023-11-17 12:24:45,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:24:45,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 42.0) internal successors, (294), 7 states have internal predecessors, (294), 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:24:45,780 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 42.0) internal successors, (294), 7 states have internal predecessors, (294), 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:24:45,780 INFO L175 Difference]: Start difference. First operand has 161 places, 213 transitions, 2584 flow. Second operand 6 states and 82 transitions. [2023-11-17 12:24:45,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 220 transitions, 3068 flow [2023-11-17 12:24:45,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 220 transitions, 2849 flow, removed 13 selfloop flow, removed 11 redundant places. [2023-11-17 12:24:45,841 INFO L231 Difference]: Finished difference. Result has 157 places, 115 transitions, 1230 flow [2023-11-17 12:24:45,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2012, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1230, PETRI_PLACES=157, PETRI_TRANSITIONS=115} [2023-11-17 12:24:45,841 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 127 predicate places. [2023-11-17 12:24:45,842 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 115 transitions, 1230 flow [2023-11-17 12:24:45,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 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:24:45,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:24:45,842 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:24:45,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-17 12:24:46,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:24:46,049 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:24:46,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:24:46,049 INFO L85 PathProgramCache]: Analyzing trace with hash 730719539, now seen corresponding path program 13 times [2023-11-17 12:24:46,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:24:46,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491404197] [2023-11-17 12:24:46,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:24:46,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:24:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:24:46,189 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:24:46,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:24:46,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491404197] [2023-11-17 12:24:46,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491404197] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:24:46,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868324863] [2023-11-17 12:24:46,190 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 12:24:46,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:24:46,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:24:46,193 INFO L229 MonitoredProcess]: Starting monitored process 16 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:24:46,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-17 12:24:46,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:24:46,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 12:24:46,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:24:46,443 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:24:46,443 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:24:46,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:24:46,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868324863] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:24:46,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:24:46,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2023-11-17 12:24:46,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069986489] [2023-11-17 12:24:46,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:24:46,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-17 12:24:46,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:24:46,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-17 12:24:46,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-11-17 12:24:46,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 42 [2023-11-17 12:24:46,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 115 transitions, 1230 flow. Second operand has 19 states, 19 states have (on average 6.105263157894737) internal successors, (116), 19 states have internal predecessors, (116), 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:24:46,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:24:46,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 42 [2023-11-17 12:24:46,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:24:46,928 INFO L124 PetriNetUnfolderBase]: 1014/1480 cut-off events. [2023-11-17 12:24:46,928 INFO L125 PetriNetUnfolderBase]: For 18392/18392 co-relation queries the response was YES. [2023-11-17 12:24:46,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10807 conditions, 1480 events. 1014/1480 cut-off events. For 18392/18392 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 5709 event pairs, 345 based on Foata normal form. 14/1494 useless extension candidates. Maximal degree in co-relation 10749. Up to 1148 conditions per place. [2023-11-17 12:24:46,938 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 150 selfloop transitions, 34 changer transitions 0/184 dead transitions. [2023-11-17 12:24:46,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 184 transitions, 2441 flow [2023-11-17 12:24:46,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 12:24:46,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 12:24:46,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 107 transitions. [2023-11-17 12:24:46,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25476190476190474 [2023-11-17 12:24:46,939 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 107 transitions. [2023-11-17 12:24:46,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 107 transitions. [2023-11-17 12:24:46,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:24:46,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 107 transitions. [2023-11-17 12:24:46,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 10.7) internal successors, (107), 10 states have internal predecessors, (107), 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:24:46,940 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 42.0) internal successors, (462), 11 states have internal predecessors, (462), 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:24:46,940 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 42.0) internal successors, (462), 11 states have internal predecessors, (462), 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:24:46,941 INFO L175 Difference]: Start difference. First operand has 157 places, 115 transitions, 1230 flow. Second operand 10 states and 107 transitions. [2023-11-17 12:24:46,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 184 transitions, 2441 flow [2023-11-17 12:24:46,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 184 transitions, 2167 flow, removed 91 selfloop flow, removed 19 redundant places. [2023-11-17 12:24:46,968 INFO L231 Difference]: Finished difference. Result has 114 places, 137 transitions, 1462 flow [2023-11-17 12:24:46,968 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1047, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1462, PETRI_PLACES=114, PETRI_TRANSITIONS=137} [2023-11-17 12:24:46,969 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 84 predicate places. [2023-11-17 12:24:46,969 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 137 transitions, 1462 flow [2023-11-17 12:24:46,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.105263157894737) internal successors, (116), 19 states have internal predecessors, (116), 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:24:46,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:24:46,969 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:24:46,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-17 12:24:47,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-17 12:24:47,170 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:24:47,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:24:47,170 INFO L85 PathProgramCache]: Analyzing trace with hash 712339107, now seen corresponding path program 14 times [2023-11-17 12:24:47,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:24:47,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589269160] [2023-11-17 12:24:47,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:24:47,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:24:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:24:47,294 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:24:47,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:24:47,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589269160] [2023-11-17 12:24:47,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589269160] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:24:47,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426011659] [2023-11-17 12:24:47,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 12:24:47,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:24:47,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:24:47,296 INFO L229 MonitoredProcess]: Starting monitored process 17 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:24:47,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-17 12:24:47,404 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 12:24:47,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:24:47,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 12:24:47,406 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:24:47,490 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:24:47,490 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:24:47,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:24:47,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426011659] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:24:47,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:24:47,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2023-11-17 12:24:47,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406153055] [2023-11-17 12:24:47,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:24:47,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-17 12:24:47,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:24:47,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-17 12:24:47,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2023-11-17 12:24:47,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 42 [2023-11-17 12:24:47,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 137 transitions, 1462 flow. Second operand has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 18 states have internal predecessors, (110), 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:24:47,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:24:47,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 42 [2023-11-17 12:24:47,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:24:47,924 INFO L124 PetriNetUnfolderBase]: 1083/1607 cut-off events. [2023-11-17 12:24:47,924 INFO L125 PetriNetUnfolderBase]: For 19585/19585 co-relation queries the response was YES. [2023-11-17 12:24:47,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11337 conditions, 1607 events. 1083/1607 cut-off events. For 19585/19585 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 6436 event pairs, 296 based on Foata normal form. 32/1639 useless extension candidates. Maximal degree in co-relation 11290. Up to 836 conditions per place. [2023-11-17 12:24:47,955 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 143 selfloop transitions, 48 changer transitions 0/191 dead transitions. [2023-11-17 12:24:47,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 191 transitions, 2371 flow [2023-11-17 12:24:47,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 12:24:47,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 12:24:47,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2023-11-17 12:24:47,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26904761904761904 [2023-11-17 12:24:47,956 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 113 transitions. [2023-11-17 12:24:47,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 113 transitions. [2023-11-17 12:24:47,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:24:47,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 113 transitions. [2023-11-17 12:24:47,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 11.3) internal successors, (113), 10 states have internal predecessors, (113), 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:24:47,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 42.0) internal successors, (462), 11 states have internal predecessors, (462), 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:24:47,957 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 42.0) internal successors, (462), 11 states have internal predecessors, (462), 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:24:47,957 INFO L175 Difference]: Start difference. First operand has 114 places, 137 transitions, 1462 flow. Second operand 10 states and 113 transitions. [2023-11-17 12:24:47,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 191 transitions, 2371 flow [2023-11-17 12:24:47,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 191 transitions, 2092 flow, removed 98 selfloop flow, removed 7 redundant places. [2023-11-17 12:24:47,977 INFO L231 Difference]: Finished difference. Result has 119 places, 142 transitions, 1491 flow [2023-11-17 12:24:47,977 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1263, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1491, PETRI_PLACES=119, PETRI_TRANSITIONS=142} [2023-11-17 12:24:47,977 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 89 predicate places. [2023-11-17 12:24:47,977 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 142 transitions, 1491 flow [2023-11-17 12:24:47,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 18 states have internal predecessors, (110), 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:24:47,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:24:47,977 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:24:47,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-17 12:24:48,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:24:48,178 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:24:48,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:24:48,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1075903761, now seen corresponding path program 15 times [2023-11-17 12:24:48,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:24:48,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26325450] [2023-11-17 12:24:48,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:24:48,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:24:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:24:48,299 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:24:48,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:24:48,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26325450] [2023-11-17 12:24:48,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26325450] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:24:48,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600229009] [2023-11-17 12:24:48,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 12:24:48,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:24:48,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:24:48,301 INFO L229 MonitoredProcess]: Starting monitored process 18 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:24:48,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-17 12:24:48,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 12:24:48,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:24:48,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 12:24:48,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:24:48,515 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:24:48,515 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:24:48,603 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:24:48,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600229009] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:24:48,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:24:48,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2023-11-17 12:24:48,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041025012] [2023-11-17 12:24:48,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:24:48,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-17 12:24:48,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:24:48,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-17 12:24:48,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-11-17 12:24:48,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 42 [2023-11-17 12:24:48,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 142 transitions, 1491 flow. Second operand has 19 states, 19 states have (on average 6.105263157894737) internal successors, (116), 19 states have internal predecessors, (116), 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:24:48,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:24:48,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 42 [2023-11-17 12:24:48,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:24:48,978 INFO L124 PetriNetUnfolderBase]: 1398/2066 cut-off events. [2023-11-17 12:24:48,979 INFO L125 PetriNetUnfolderBase]: For 19147/19147 co-relation queries the response was YES. [2023-11-17 12:24:48,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13296 conditions, 2066 events. 1398/2066 cut-off events. For 19147/19147 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8579 event pairs, 327 based on Foata normal form. 12/2078 useless extension candidates. Maximal degree in co-relation 13249. Up to 1008 conditions per place. [2023-11-17 12:24:48,991 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 161 selfloop transitions, 65 changer transitions 0/226 dead transitions. [2023-11-17 12:24:48,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 226 transitions, 2749 flow [2023-11-17 12:24:48,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 12:24:48,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 12:24:48,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2023-11-17 12:24:48,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26666666666666666 [2023-11-17 12:24:48,992 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 112 transitions. [2023-11-17 12:24:48,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 112 transitions. [2023-11-17 12:24:48,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:24:48,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 112 transitions. [2023-11-17 12:24:48,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:24:48,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 42.0) internal successors, (462), 11 states have internal predecessors, (462), 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:24:48,993 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 42.0) internal successors, (462), 11 states have internal predecessors, (462), 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:24:48,993 INFO L175 Difference]: Start difference. First operand has 119 places, 142 transitions, 1491 flow. Second operand 10 states and 112 transitions. [2023-11-17 12:24:48,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 226 transitions, 2749 flow [2023-11-17 12:24:49,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 226 transitions, 2666 flow, removed 9 selfloop flow, removed 6 redundant places. [2023-11-17 12:24:49,021 INFO L231 Difference]: Finished difference. Result has 125 places, 146 transitions, 1690 flow [2023-11-17 12:24:49,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1437, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1690, PETRI_PLACES=125, PETRI_TRANSITIONS=146} [2023-11-17 12:24:49,022 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 95 predicate places. [2023-11-17 12:24:49,022 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 146 transitions, 1690 flow [2023-11-17 12:24:49,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.105263157894737) internal successors, (116), 19 states have internal predecessors, (116), 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:24:49,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:24:49,022 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:24:49,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-17 12:24:49,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:24:49,223 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:24:49,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:24:49,223 INFO L85 PathProgramCache]: Analyzing trace with hash 539053305, now seen corresponding path program 16 times [2023-11-17 12:24:49,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:24:49,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856362082] [2023-11-17 12:24:49,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:24:49,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:24:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:24:49,341 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:24:49,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:24:49,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856362082] [2023-11-17 12:24:49,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856362082] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:24:49,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010392682] [2023-11-17 12:24:49,341 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 12:24:49,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:24:49,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:24:49,345 INFO L229 MonitoredProcess]: Starting monitored process 19 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:24:49,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-17 12:24:49,442 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 12:24:49,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:24:49,443 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 12:24:49,444 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:24:49,542 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:24:49,542 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:24:49,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:24:49,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010392682] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:24:49,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:24:49,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2023-11-17 12:24:49,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207133600] [2023-11-17 12:24:49,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:24:49,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-17 12:24:49,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:24:49,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-17 12:24:49,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2023-11-17 12:24:49,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 42 [2023-11-17 12:24:49,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 146 transitions, 1690 flow. Second operand has 18 states, 18 states have (on average 6.777777777777778) internal successors, (122), 18 states have internal predecessors, (122), 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:24:49,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:24:49,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 42 [2023-11-17 12:24:49,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:24:50,725 INFO L124 PetriNetUnfolderBase]: 1584/2340 cut-off events. [2023-11-17 12:24:50,725 INFO L125 PetriNetUnfolderBase]: For 22812/22812 co-relation queries the response was YES. [2023-11-17 12:24:50,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15773 conditions, 2340 events. 1584/2340 cut-off events. For 22812/22812 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 10030 event pairs, 263 based on Foata normal form. 14/2354 useless extension candidates. Maximal degree in co-relation 15723. Up to 1030 conditions per place. [2023-11-17 12:24:50,738 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 219 selfloop transitions, 157 changer transitions 0/376 dead transitions. [2023-11-17 12:24:50,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 376 transitions, 4793 flow [2023-11-17 12:24:50,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-17 12:24:50,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-11-17 12:24:50,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 351 transitions. [2023-11-17 12:24:50,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.23877551020408164 [2023-11-17 12:24:50,740 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 351 transitions. [2023-11-17 12:24:50,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 351 transitions. [2023-11-17 12:24:50,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:24:50,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 351 transitions. [2023-11-17 12:24:50,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 10.028571428571428) internal successors, (351), 35 states have internal predecessors, (351), 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:24:50,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 42.0) internal successors, (1512), 36 states have internal predecessors, (1512), 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:24:50,744 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 42.0) internal successors, (1512), 36 states have internal predecessors, (1512), 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:24:50,744 INFO L175 Difference]: Start difference. First operand has 125 places, 146 transitions, 1690 flow. Second operand 35 states and 351 transitions. [2023-11-17 12:24:50,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 376 transitions, 4793 flow [2023-11-17 12:24:50,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 376 transitions, 4529 flow, removed 72 selfloop flow, removed 6 redundant places. [2023-11-17 12:24:50,784 INFO L231 Difference]: Finished difference. Result has 164 places, 244 transitions, 3124 flow [2023-11-17 12:24:50,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=1593, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=3124, PETRI_PLACES=164, PETRI_TRANSITIONS=244} [2023-11-17 12:24:50,785 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 134 predicate places. [2023-11-17 12:24:50,785 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 244 transitions, 3124 flow [2023-11-17 12:24:50,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.777777777777778) internal successors, (122), 18 states have internal predecessors, (122), 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:24:50,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:24:50,785 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:24:50,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-11-17 12:24:50,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:24:50,989 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:24:50,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:24:50,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2099375851, now seen corresponding path program 17 times [2023-11-17 12:24:50,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:24:50,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594992969] [2023-11-17 12:24:50,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:24:50,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:24:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:24:51,112 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:24:51,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:24:51,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594992969] [2023-11-17 12:24:51,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594992969] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:24:51,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152643094] [2023-11-17 12:24:51,113 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 12:24:51,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:24:51,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:24:51,114 INFO L229 MonitoredProcess]: Starting monitored process 20 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:24:51,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-17 12:24:51,237 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 12:24:51,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:24:51,239 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 12:24:51,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:24:51,356 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:24:51,357 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:24:51,471 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:24:51,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152643094] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:24:51,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:24:51,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 21 [2023-11-17 12:24:51,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404637246] [2023-11-17 12:24:51,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:24:51,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-17 12:24:51,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:24:51,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-17 12:24:51,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2023-11-17 12:24:51,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 42 [2023-11-17 12:24:51,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 244 transitions, 3124 flow. Second operand has 21 states, 21 states have (on average 6.285714285714286) internal successors, (132), 21 states have internal predecessors, (132), 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:24:51,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:24:51,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 42 [2023-11-17 12:24:51,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:24:53,059 INFO L124 PetriNetUnfolderBase]: 2830/4192 cut-off events. [2023-11-17 12:24:53,059 INFO L125 PetriNetUnfolderBase]: For 70021/70021 co-relation queries the response was YES. [2023-11-17 12:24:53,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32411 conditions, 4192 events. 2830/4192 cut-off events. For 70021/70021 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 19382 event pairs, 535 based on Foata normal form. 62/4254 useless extension candidates. Maximal degree in co-relation 32350. Up to 2138 conditions per place. [2023-11-17 12:24:53,085 INFO L140 encePairwiseOnDemand]: 30/42 looper letters, 391 selfloop transitions, 269 changer transitions 0/660 dead transitions. [2023-11-17 12:24:53,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 660 transitions, 9540 flow [2023-11-17 12:24:53,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-11-17 12:24:53,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2023-11-17 12:24:53,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 443 transitions. [2023-11-17 12:24:53,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2572590011614402 [2023-11-17 12:24:53,087 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 443 transitions. [2023-11-17 12:24:53,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 443 transitions. [2023-11-17 12:24:53,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:24:53,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 443 transitions. [2023-11-17 12:24:53,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 10.804878048780488) internal successors, (443), 41 states have internal predecessors, (443), 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:24:53,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 42.0) internal successors, (1764), 42 states have internal predecessors, (1764), 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:24:53,091 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 42.0) internal successors, (1764), 42 states have internal predecessors, (1764), 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:24:53,091 INFO L175 Difference]: Start difference. First operand has 164 places, 244 transitions, 3124 flow. Second operand 41 states and 443 transitions. [2023-11-17 12:24:53,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 660 transitions, 9540 flow [2023-11-17 12:24:53,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 660 transitions, 8726 flow, removed 284 selfloop flow, removed 8 redundant places. [2023-11-17 12:24:53,225 INFO L231 Difference]: Finished difference. Result has 217 places, 446 transitions, 6700 flow [2023-11-17 12:24:53,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=2710, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=6700, PETRI_PLACES=217, PETRI_TRANSITIONS=446} [2023-11-17 12:24:53,226 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 187 predicate places. [2023-11-17 12:24:53,226 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 446 transitions, 6700 flow [2023-11-17 12:24:53,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.285714285714286) internal successors, (132), 21 states have internal predecessors, (132), 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:24:53,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:24:53,226 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:24:53,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-17 12:24:53,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:24:53,427 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:24:53,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:24:53,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1367067243, now seen corresponding path program 18 times [2023-11-17 12:24:53,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:24:53,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428671768] [2023-11-17 12:24:53,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:24:53,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:24:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:24:53,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:24:53,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:24:53,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428671768] [2023-11-17 12:24:53,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428671768] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:24:53,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416966473] [2023-11-17 12:24:53,542 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 12:24:53,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:24:53,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:24:53,545 INFO L229 MonitoredProcess]: Starting monitored process 21 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:24:53,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-17 12:24:53,647 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-17 12:24:53,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:24:53,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 12:24:53,649 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:24:53,735 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:24:53,736 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:24:53,824 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 12:24:53,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416966473] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:24:53,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:24:53,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2023-11-17 12:24:53,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741856440] [2023-11-17 12:24:53,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:24:53,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-17 12:24:53,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:24:53,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-17 12:24:53,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2023-11-17 12:24:53,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 42 [2023-11-17 12:24:53,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 446 transitions, 6700 flow. Second operand has 20 states, 20 states have (on average 6.0) internal successors, (120), 20 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:24:53,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:24:53,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 42 [2023-11-17 12:24:53,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:24:55,016 INFO L124 PetriNetUnfolderBase]: 3304/4866 cut-off events. [2023-11-17 12:24:55,017 INFO L125 PetriNetUnfolderBase]: For 107438/107438 co-relation queries the response was YES. [2023-11-17 12:24:55,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42477 conditions, 4866 events. 3304/4866 cut-off events. For 107438/107438 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 23035 event pairs, 389 based on Foata normal form. 28/4894 useless extension candidates. Maximal degree in co-relation 42395. Up to 2248 conditions per place. [2023-11-17 12:24:55,057 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 443 selfloop transitions, 270 changer transitions 0/713 dead transitions. [2023-11-17 12:24:55,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 713 transitions, 12012 flow [2023-11-17 12:24:55,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-17 12:24:55,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-17 12:24:55,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 238 transitions. [2023-11-17 12:24:55,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2982456140350877 [2023-11-17 12:24:55,059 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 238 transitions. [2023-11-17 12:24:55,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 238 transitions. [2023-11-17 12:24:55,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:24:55,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 238 transitions. [2023-11-17 12:24:55,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 12.526315789473685) internal successors, (238), 19 states have internal predecessors, (238), 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:24:55,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 42.0) internal successors, (840), 20 states have internal predecessors, (840), 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:24:55,061 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 42.0) internal successors, (840), 20 states have internal predecessors, (840), 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:24:55,061 INFO L175 Difference]: Start difference. First operand has 217 places, 446 transitions, 6700 flow. Second operand 19 states and 238 transitions. [2023-11-17 12:24:55,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 713 transitions, 12012 flow [2023-11-17 12:24:55,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 713 transitions, 10545 flow, removed 629 selfloop flow, removed 6 redundant places. [2023-11-17 12:24:55,442 INFO L231 Difference]: Finished difference. Result has 234 places, 528 transitions, 7944 flow [2023-11-17 12:24:55,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=5657, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=194, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=7944, PETRI_PLACES=234, PETRI_TRANSITIONS=528} [2023-11-17 12:24:55,443 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 204 predicate places. [2023-11-17 12:24:55,443 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 528 transitions, 7944 flow [2023-11-17 12:24:55,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.0) internal successors, (120), 20 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 12:24:55,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:24:55,443 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:24:55,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-11-17 12:24:55,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-17 12:24:55,644 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:24:55,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:24:55,644 INFO L85 PathProgramCache]: Analyzing trace with hash -454080403, now seen corresponding path program 19 times [2023-11-17 12:24:55,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:24:55,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263552216] [2023-11-17 12:24:55,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:24:55,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:24:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:24:55,762 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:24:55,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:24:55,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263552216] [2023-11-17 12:24:55,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263552216] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:24:55,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065715560] [2023-11-17 12:24:55,763 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 12:24:55,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:24:55,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:24:55,765 INFO L229 MonitoredProcess]: Starting monitored process 22 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:24:55,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-17 12:24:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:24:55,871 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 12:24:55,873 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:24:55,962 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:24:55,962 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:24:56,062 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:24:56,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065715560] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:24:56,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:24:56,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2023-11-17 12:24:56,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169730931] [2023-11-17 12:24:56,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:24:56,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-17 12:24:56,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:24:56,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-17 12:24:56,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2023-11-17 12:24:56,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 42 [2023-11-17 12:24:56,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 528 transitions, 7944 flow. Second operand has 21 states, 21 states have (on average 5.904761904761905) internal successors, (124), 21 states have internal predecessors, (124), 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:24:56,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:24:56,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 42 [2023-11-17 12:24:56,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:24:57,254 INFO L124 PetriNetUnfolderBase]: 3265/4775 cut-off events. [2023-11-17 12:24:57,255 INFO L125 PetriNetUnfolderBase]: For 91153/91153 co-relation queries the response was YES. [2023-11-17 12:24:57,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40934 conditions, 4775 events. 3265/4775 cut-off events. For 91153/91153 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 22172 event pairs, 399 based on Foata normal form. 32/4807 useless extension candidates. Maximal degree in co-relation 40848. Up to 2179 conditions per place. [2023-11-17 12:24:57,301 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 420 selfloop transitions, 263 changer transitions 0/683 dead transitions. [2023-11-17 12:24:57,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 683 transitions, 11019 flow [2023-11-17 12:24:57,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-17 12:24:57,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-17 12:24:57,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 210 transitions. [2023-11-17 12:24:57,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29411764705882354 [2023-11-17 12:24:57,304 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 210 transitions. [2023-11-17 12:24:57,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 210 transitions. [2023-11-17 12:24:57,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:24:57,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 210 transitions. [2023-11-17 12:24:57,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 12.352941176470589) internal successors, (210), 17 states have internal predecessors, (210), 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:24:57,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 42.0) internal successors, (756), 18 states have internal predecessors, (756), 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:24:57,305 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 42.0) internal successors, (756), 18 states have internal predecessors, (756), 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:24:57,305 INFO L175 Difference]: Start difference. First operand has 234 places, 528 transitions, 7944 flow. Second operand 17 states and 210 transitions. [2023-11-17 12:24:57,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 683 transitions, 11019 flow [2023-11-17 12:24:57,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 683 transitions, 10283 flow, removed 249 selfloop flow, removed 8 redundant places. [2023-11-17 12:24:57,794 INFO L231 Difference]: Finished difference. Result has 241 places, 522 transitions, 7615 flow [2023-11-17 12:24:57,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7089, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=263, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=7615, PETRI_PLACES=241, PETRI_TRANSITIONS=522} [2023-11-17 12:24:57,794 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 211 predicate places. [2023-11-17 12:24:57,794 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 522 transitions, 7615 flow [2023-11-17 12:24:57,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.904761904761905) internal successors, (124), 21 states have internal predecessors, (124), 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:24:57,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:24:57,795 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:24:57,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-11-17 12:24:57,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-17 12:24:57,995 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:24:57,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:24:57,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1977764231, now seen corresponding path program 20 times [2023-11-17 12:24:57,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:24:57,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670138755] [2023-11-17 12:24:57,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:24:57,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:24:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:24:58,172 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:24:58,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:24:58,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670138755] [2023-11-17 12:24:58,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670138755] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:24:58,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426482096] [2023-11-17 12:24:58,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 12:24:58,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:24:58,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:24:58,173 INFO L229 MonitoredProcess]: Starting monitored process 23 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:24:58,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-17 12:24:58,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 12:24:58,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:24:58,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 12:24:58,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:24:58,382 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:24:58,383 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:24:58,485 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 12:24:58,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426482096] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 12:24:58,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 12:24:58,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2023-11-17 12:24:58,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806679409] [2023-11-17 12:24:58,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 12:24:58,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-17 12:24:58,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 12:24:58,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-17 12:24:58,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2023-11-17 12:24:58,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 42 [2023-11-17 12:24:58,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 522 transitions, 7615 flow. Second operand has 21 states, 21 states have (on average 6.095238095238095) internal successors, (128), 21 states have internal predecessors, (128), 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:24:58,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 12:24:58,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 42 [2023-11-17 12:24:58,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 12:24:59,565 INFO L124 PetriNetUnfolderBase]: 3237/4713 cut-off events. [2023-11-17 12:24:59,566 INFO L125 PetriNetUnfolderBase]: For 79295/79295 co-relation queries the response was YES. [2023-11-17 12:24:59,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39366 conditions, 4713 events. 3237/4713 cut-off events. For 79295/79295 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 21524 event pairs, 875 based on Foata normal form. 22/4735 useless extension candidates. Maximal degree in co-relation 39281. Up to 3684 conditions per place. [2023-11-17 12:24:59,611 INFO L140 encePairwiseOnDemand]: 33/42 looper letters, 391 selfloop transitions, 182 changer transitions 0/573 dead transitions. [2023-11-17 12:24:59,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 573 transitions, 9371 flow [2023-11-17 12:24:59,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-17 12:24:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-17 12:24:59,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 134 transitions. [2023-11-17 12:24:59,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26587301587301587 [2023-11-17 12:24:59,612 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 134 transitions. [2023-11-17 12:24:59,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 134 transitions. [2023-11-17 12:24:59,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 12:24:59,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 134 transitions. [2023-11-17 12:24:59,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 11.166666666666666) internal successors, (134), 12 states have internal predecessors, (134), 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:24:59,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 42.0) internal successors, (546), 13 states have internal predecessors, (546), 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:24:59,613 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 42.0) internal successors, (546), 13 states have internal predecessors, (546), 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:24:59,613 INFO L175 Difference]: Start difference. First operand has 241 places, 522 transitions, 7615 flow. Second operand 12 states and 134 transitions. [2023-11-17 12:24:59,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 573 transitions, 9371 flow [2023-11-17 12:25:00,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 573 transitions, 8821 flow, removed 6 selfloop flow, removed 16 redundant places. [2023-11-17 12:25:00,021 INFO L231 Difference]: Finished difference. Result has 233 places, 515 transitions, 7364 flow [2023-11-17 12:25:00,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=42, PETRI_DIFFERENCE_MINUEND_FLOW=7000, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=515, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=182, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7364, PETRI_PLACES=233, PETRI_TRANSITIONS=515} [2023-11-17 12:25:00,021 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 203 predicate places. [2023-11-17 12:25:00,022 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 515 transitions, 7364 flow [2023-11-17 12:25:00,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.095238095238095) internal successors, (128), 21 states have internal predecessors, (128), 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:25:00,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 12:25:00,022 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 12:25:00,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-11-17 12:25:00,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:25:00,228 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 12:25:00,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 12:25:00,229 INFO L85 PathProgramCache]: Analyzing trace with hash -2093417886, now seen corresponding path program 2 times [2023-11-17 12:25:00,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 12:25:00,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118043484] [2023-11-17 12:25:00,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 12:25:00,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 12:25:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 12:25:01,433 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:25:01,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 12:25:01,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118043484] [2023-11-17 12:25:01,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118043484] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 12:25:01,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238415300] [2023-11-17 12:25:01,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 12:25:01,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:25:01,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 12:25:01,440 INFO L229 MonitoredProcess]: Starting monitored process 24 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:25:01,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-17 12:25:01,556 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 12:25:01,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 12:25:01,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-17 12:25:01,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 12:25:02,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 12:25:02,041 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 98 treesize of output 73 [2023-11-17 12:25:02,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:25:02,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 99 [2023-11-17 12:25:03,215 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 12:25:03,216 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 12:25:04,366 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (= c_~min1~0 c_~min3~0)) (.cse11 (+ c_~min3~0 1)) (.cse17 (= c_~min2~0 c_~min1~0))) (and (forall ((v_ArrVal_844 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_844) c_~A~0.base))) (or (< (select .cse0 c_~A~0.offset) c_~min2~0) (forall ((v_thread3Thread1of1ForFork1_~i~2_107 Int)) (let ((.cse1 (select .cse0 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_107 4))))) (let ((.cse2 (+ .cse1 1))) (or (= .cse1 c_~min1~0) (< c_~min2~0 .cse2) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_107) (< (+ v_thread3Thread1of1ForFork1_~i~2_107 1) c_~N~0) (< c_~min3~0 .cse2)))))))) (forall ((v_ArrVal_844 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_844) c_~A~0.base))) (let ((.cse5 (select .cse6 c_~A~0.offset))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_107 Int)) (let ((.cse3 (select .cse6 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_107 4))))) (let ((.cse4 (+ .cse3 1))) (or (= .cse3 c_~min1~0) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_107) (< (+ v_thread3Thread1of1ForFork1_~i~2_107 1) c_~N~0) (< c_~min3~0 .cse4) (< .cse5 .cse4))))) (< c_~min2~0 (+ .cse5 1)))))) (forall ((v_thread3Thread1of1ForFork1_~i~2_107 Int)) (or (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_107) (< (+ v_thread3Thread1of1ForFork1_~i~2_107 1) c_~N~0) (forall ((v_ArrVal_844 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_844) c_~A~0.base))) (let ((.cse7 (select .cse8 c_~A~0.offset))) (or (< c_~min3~0 .cse7) (= c_~min1~0 .cse7) (< (select .cse8 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_107 4))) c_~min3~0) (< c_~min2~0 (+ .cse7 1)))))))) (or (forall ((v_ArrVal_844 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_107 Int)) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_844) c_~A~0.base))) (let ((.cse10 (select .cse9 c_~A~0.offset))) (or (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_107) (< (+ v_thread3Thread1of1ForFork1_~i~2_107 1) c_~N~0) (< (select .cse9 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_107 4))) c_~min3~0) (< c_~min2~0 (+ .cse10 1)) (< .cse10 .cse11))))) .cse12) (forall ((v_ArrVal_844 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_844) c_~A~0.base))) (let ((.cse13 (select .cse15 c_~A~0.offset))) (or (= c_~min1~0 .cse13) (< c_~min2~0 (+ .cse13 1)) (forall ((v_thread3Thread1of1ForFork1_~i~2_107 Int)) (let ((.cse14 (select .cse15 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_107 4))))) (or (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_107) (< (+ v_thread3Thread1of1ForFork1_~i~2_107 1) c_~N~0) (< c_~min3~0 (+ .cse14 1)) (< .cse14 .cse13)))))))) (or (forall ((v_ArrVal_844 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_107 Int)) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_844) c_~A~0.base))) (or (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_107) (< (+ v_thread3Thread1of1ForFork1_~i~2_107 1) c_~N~0) (< (select .cse16 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_107 4))) c_~min3~0) (< (select .cse16 c_~A~0.offset) c_~min2~0)))) (and (or .cse12 (< c_~min2~0 .cse11)) (or .cse17 (< c_~min3~0 c_~min2~0)))) (or .cse17 (forall ((v_ArrVal_844 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_107 Int)) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_844) c_~A~0.base))) (let ((.cse18 (select .cse19 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_107 4))))) (or (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_107) (< (+ v_thread3Thread1of1ForFork1_~i~2_107 1) c_~N~0) (< c_~min3~0 (+ .cse18 1)) (< .cse18 c_~min2~0) (< (select .cse19 c_~A~0.offset) c_~min2~0)))))))) is different from false [2023-11-17 12:25:08,457 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:25:08,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 1687 treesize of output 2335 [2023-11-17 12:25:09,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:25:09,165 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 1185 treesize of output 1172 [2023-11-17 12:25:09,423 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:25:09,424 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 1163 treesize of output 1152 [2023-11-17 12:25:09,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:25:09,715 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 1143 treesize of output 1138 [2023-11-17 12:25:09,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:25:09,977 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 1129 treesize of output 1130 [2023-11-17 12:25:10,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:25:10,263 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 1121 treesize of output 1120 [2023-11-17 12:25:10,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:25:10,546 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 1111 treesize of output 1108 [2023-11-17 12:25:10,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:25:10,848 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 1099 treesize of output 1090 [2023-11-17 12:25:11,160 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:25:11,161 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 1081 treesize of output 1080 [2023-11-17 12:25:11,457 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-11-17 12:25:11,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:25:11,562 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 1071 treesize of output 1068 [2023-11-17 12:25:11,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:25:11,877 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 1059 treesize of output 1050 [2023-11-17 12:25:12,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:25:12,175 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 1041 treesize of output 1030 [2023-11-17 12:25:12,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:25:12,487 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 1021 treesize of output 1022 [2023-11-17 12:25:12,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:25:12,774 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 1013 treesize of output 1000 [2023-11-17 12:25:13,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 12:25:13,076 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 991 treesize of output 986 [2023-11-17 12:28:58,544 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:28:58,546 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-17 12:28:58,546 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:28:58,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-11-17 12:28:58,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 12:28:58,747 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.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:268) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:410) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:394) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:500) 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:140) 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.transform(TermContextTransformationEngine.java:88) 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) ... 68 more [2023-11-17 12:28:58,750 INFO L158 Benchmark]: Toolchain (without parser) took 343236.56ms. Allocated memory was 340.8MB in the beginning and 1.1GB in the end (delta: 750.8MB). Free memory was 292.0MB in the beginning and 477.7MB in the end (delta: -185.7MB). Peak memory consumption was 720.7MB. Max. memory is 8.0GB. [2023-11-17 12:28:58,750 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 217.1MB. Free memory is still 169.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 12:28:58,750 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.15ms. Allocated memory is still 340.8MB. Free memory was 291.6MB in the beginning and 280.0MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-11-17 12:28:58,750 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.29ms. Allocated memory is still 340.8MB. Free memory was 280.0MB in the beginning and 278.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 12:28:58,751 INFO L158 Benchmark]: Boogie Preprocessor took 30.23ms. Allocated memory is still 340.8MB. Free memory was 278.0MB in the beginning and 276.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 12:28:58,751 INFO L158 Benchmark]: RCFGBuilder took 655.41ms. Allocated memory is still 340.8MB. Free memory was 276.3MB in the beginning and 301.9MB in the end (delta: -25.6MB). Peak memory consumption was 42.9MB. Max. memory is 8.0GB. [2023-11-17 12:28:58,751 INFO L158 Benchmark]: TraceAbstraction took 342284.99ms. Allocated memory was 340.8MB in the beginning and 1.1GB in the end (delta: 750.8MB). Free memory was 301.4MB in the beginning and 477.7MB in the end (delta: -176.3MB). Peak memory consumption was 729.1MB. Max. memory is 8.0GB. [2023-11-17 12:28:58,752 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 217.1MB. Free memory is still 169.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 229.15ms. Allocated memory is still 340.8MB. Free memory was 291.6MB in the beginning and 280.0MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.29ms. Allocated memory is still 340.8MB. Free memory was 280.0MB in the beginning and 278.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.23ms. Allocated memory is still 340.8MB. Free memory was 278.0MB in the beginning and 276.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 655.41ms. Allocated memory is still 340.8MB. Free memory was 276.3MB in the beginning and 301.9MB in the end (delta: -25.6MB). Peak memory consumption was 42.9MB. Max. memory is 8.0GB. * TraceAbstraction took 342284.99ms. Allocated memory was 340.8MB in the beginning and 1.1GB in the end (delta: 750.8MB). Free memory was 301.4MB in the beginning and 477.7MB in the end (delta: -176.3MB). Peak memory consumption was 729.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 37 PlacesBefore, 30 PlacesAfterwards, 31 TransitionsBefore, 24 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 7 TotalNumberOfCompositions, 371 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 334, independent: 326, independent conditional: 0, independent unconditional: 326, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 175, independent: 167, independent conditional: 0, independent unconditional: 167, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 175, independent: 167, independent conditional: 0, independent unconditional: 167, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 334, independent: 159, independent conditional: 0, independent unconditional: 159, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 175, unknown conditional: 0, unknown unconditional: 175] , Statistics on independence cache: Total cache size (in pairs): 65, Positive cache size: 63, Positive conditional cache size: 0, Positive unconditional cache size: 63, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, 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...