/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 16:20:11,797 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 16:20:11,872 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 16:20:11,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 16:20:11,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 16:20:11,907 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 16:20:11,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 16:20:11,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 16:20:11,908 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 16:20:11,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 16:20:11,913 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 16:20:11,913 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 16:20:11,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 16:20:11,914 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 16:20:11,915 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 16:20:11,915 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 16:20:11,915 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 16:20:11,915 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 16:20:11,915 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 16:20:11,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 16:20:11,916 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 16:20:11,917 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 16:20:11,917 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 16:20:11,917 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 16:20:11,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 16:20:11,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:20:11,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 16:20:11,918 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 16:20:11,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 16:20:11,918 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 16:20:11,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 16:20:11,920 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 16:20:11,920 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 [2023-11-17 16:20:12,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 16:20:12,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 16:20:12,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 16:20:12,143 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 16:20:12,145 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 16:20:12,146 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2023-11-17 16:20:13,336 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 16:20:13,568 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 16:20:13,568 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2023-11-17 16:20:13,577 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbb160b62/710b764c5b48437e88494fd783eff250/FLAGc4999e7c7 [2023-11-17 16:20:13,594 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbb160b62/710b764c5b48437e88494fd783eff250 [2023-11-17 16:20:13,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 16:20:13,598 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 16:20:13,601 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 16:20:13,601 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 16:20:13,605 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 16:20:13,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:20:13" (1/1) ... [2023-11-17 16:20:13,606 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24c67bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:20:13, skipping insertion in model container [2023-11-17 16:20:13,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:20:13" (1/1) ... [2023-11-17 16:20:13,636 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 16:20:13,778 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-inc-subseq.wvr.c[2950,2963] [2023-11-17 16:20:13,785 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:20:13,793 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 16:20:13,812 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-inc-subseq.wvr.c[2950,2963] [2023-11-17 16:20:13,815 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:20:13,826 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 16:20:13,826 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 16:20:13,832 INFO L206 MainTranslator]: Completed translation [2023-11-17 16:20:13,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:20:13 WrapperNode [2023-11-17 16:20:13,832 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 16:20:13,833 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 16:20:13,833 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 16:20:13,834 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 16:20:13,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:20:13" (1/1) ... [2023-11-17 16:20:13,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:20:13" (1/1) ... [2023-11-17 16:20:13,885 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 199 [2023-11-17 16:20:13,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 16:20:13,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 16:20:13,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 16:20:13,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 16:20:13,894 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:20:13" (1/1) ... [2023-11-17 16:20:13,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:20:13" (1/1) ... [2023-11-17 16:20:13,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:20:13" (1/1) ... [2023-11-17 16:20:13,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:20:13" (1/1) ... [2023-11-17 16:20:13,904 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:20:13" (1/1) ... [2023-11-17 16:20:13,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:20:13" (1/1) ... [2023-11-17 16:20:13,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:20:13" (1/1) ... [2023-11-17 16:20:13,914 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:20:13" (1/1) ... [2023-11-17 16:20:13,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 16:20:13,917 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 16:20:13,917 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 16:20:13,917 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 16:20:13,918 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:20:13" (1/1) ... [2023-11-17 16:20:13,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:20:13,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:20:13,958 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 16:20:13,980 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 16:20:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 16:20:13,994 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 16:20:13,995 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 16:20:13,995 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 16:20:13,995 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 16:20:13,995 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 16:20:13,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 16:20:13,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 16:20:13,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 16:20:13,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 16:20:13,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 16:20:13,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 16:20:13,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 16:20:13,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 16:20:13,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 16:20:13,998 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 16:20:14,140 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 16:20:14,142 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 16:20:14,406 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 16:20:14,511 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 16:20:14,512 INFO L307 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-17 16:20:14,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:20:14 BoogieIcfgContainer [2023-11-17 16:20:14,513 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 16:20:14,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 16:20:14,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 16:20:14,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 16:20:14,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 04:20:13" (1/3) ... [2023-11-17 16:20:14,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc491be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:20:14, skipping insertion in model container [2023-11-17 16:20:14,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:20:13" (2/3) ... [2023-11-17 16:20:14,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc491be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:20:14, skipping insertion in model container [2023-11-17 16:20:14,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:20:14" (3/3) ... [2023-11-17 16:20:14,521 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2023-11-17 16:20:14,543 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 16:20:14,543 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 16:20:14,543 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 16:20:14,607 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-17 16:20:14,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 194 transitions, 402 flow [2023-11-17 16:20:14,704 INFO L124 PetriNetUnfolderBase]: 15/192 cut-off events. [2023-11-17 16:20:14,704 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 16:20:14,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 192 events. 15/192 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 112 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 156. Up to 2 conditions per place. [2023-11-17 16:20:14,709 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 194 transitions, 402 flow [2023-11-17 16:20:14,714 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 183 transitions, 378 flow [2023-11-17 16:20:14,717 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 16:20:14,733 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 183 transitions, 378 flow [2023-11-17 16:20:14,737 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 183 transitions, 378 flow [2023-11-17 16:20:14,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 183 transitions, 378 flow [2023-11-17 16:20:14,785 INFO L124 PetriNetUnfolderBase]: 15/183 cut-off events. [2023-11-17 16:20:14,785 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 16:20:14,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 183 events. 15/183 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 156. Up to 2 conditions per place. [2023-11-17 16:20:14,788 INFO L119 LiptonReduction]: Number of co-enabled transitions 772 [2023-11-17 16:20:20,098 INFO L134 LiptonReduction]: Checked pairs total: 1117 [2023-11-17 16:20:20,099 INFO L136 LiptonReduction]: Total number of compositions: 196 [2023-11-17 16:20:20,112 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 16:20:20,122 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;@3c24ce8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 16:20:20,122 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-17 16:20:20,127 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 16:20:20,128 INFO L124 PetriNetUnfolderBase]: 5/22 cut-off events. [2023-11-17 16:20:20,128 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-17 16:20:20,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:20:20,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:20:20,129 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:20:20,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:20:20,137 INFO L85 PathProgramCache]: Analyzing trace with hash -923647947, now seen corresponding path program 1 times [2023-11-17 16:20:20,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:20:20,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858968241] [2023-11-17 16:20:20,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:20:20,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:20:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:20:20,568 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 16:20:20,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:20:20,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858968241] [2023-11-17 16:20:20,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858968241] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:20:20,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:20:20,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 16:20:20,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358816842] [2023-11-17 16:20:20,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:20:20,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 16:20:20,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:20:20,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 16:20:20,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 16:20:20,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 390 [2023-11-17 16:20:20,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 23 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 168.5) internal successors, (674), 4 states have internal predecessors, (674), 0 states have call successors, (0), 0 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 16:20:20,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:20:20,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 390 [2023-11-17 16:20:20,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:20:20,716 INFO L124 PetriNetUnfolderBase]: 124/208 cut-off events. [2023-11-17 16:20:20,716 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-11-17 16:20:20,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 208 events. 124/208 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 591 event pairs, 29 based on Foata normal form. 0/162 useless extension candidates. Maximal degree in co-relation 393. Up to 134 conditions per place. [2023-11-17 16:20:20,719 INFO L140 encePairwiseOnDemand]: 385/390 looper letters, 29 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2023-11-17 16:20:20,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 34 transitions, 149 flow [2023-11-17 16:20:20,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:20:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 16:20:20,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 694 transitions. [2023-11-17 16:20:20,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44487179487179485 [2023-11-17 16:20:20,736 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 694 transitions. [2023-11-17 16:20:20,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 694 transitions. [2023-11-17 16:20:20,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:20:20,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 694 transitions. [2023-11-17 16:20:20,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 173.5) internal successors, (694), 4 states have internal predecessors, (694), 0 states have call successors, (0), 0 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 16:20:20,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 390.0) internal successors, (1950), 5 states have internal predecessors, (1950), 0 states have call successors, (0), 0 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 16:20:20,753 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 390.0) internal successors, (1950), 5 states have internal predecessors, (1950), 0 states have call successors, (0), 0 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 16:20:20,754 INFO L175 Difference]: Start difference. First operand has 25 places, 23 transitions, 58 flow. Second operand 4 states and 694 transitions. [2023-11-17 16:20:20,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 34 transitions, 149 flow [2023-11-17 16:20:20,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 34 transitions, 139 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 16:20:20,759 INFO L231 Difference]: Finished difference. Result has 25 places, 25 transitions, 71 flow [2023-11-17 16:20:20,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=71, PETRI_PLACES=25, PETRI_TRANSITIONS=25} [2023-11-17 16:20:20,763 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2023-11-17 16:20:20,763 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 25 transitions, 71 flow [2023-11-17 16:20:20,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 168.5) internal successors, (674), 4 states have internal predecessors, (674), 0 states have call successors, (0), 0 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 16:20:20,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:20:20,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:20:20,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 16:20:20,765 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:20:20,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:20:20,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1725266034, now seen corresponding path program 1 times [2023-11-17 16:20:20,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:20:20,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013023115] [2023-11-17 16:20:20,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:20:20,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:20:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:20:20,878 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 16:20:20,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:20:20,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013023115] [2023-11-17 16:20:20,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013023115] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:20:20,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:20:20,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 16:20:20,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497133074] [2023-11-17 16:20:20,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:20:20,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:20:20,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:20:20,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:20:20,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:20:20,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 390 [2023-11-17 16:20:20,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 25 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 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 16:20:20,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:20:20,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 390 [2023-11-17 16:20:20,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:20:20,988 INFO L124 PetriNetUnfolderBase]: 124/209 cut-off events. [2023-11-17 16:20:20,988 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-17 16:20:20,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 209 events. 124/209 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 575 event pairs, 78 based on Foata normal form. 1/189 useless extension candidates. Maximal degree in co-relation 208. Up to 208 conditions per place. [2023-11-17 16:20:20,993 INFO L140 encePairwiseOnDemand]: 387/390 looper letters, 23 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2023-11-17 16:20:20,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 123 flow [2023-11-17 16:20:20,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:20:20,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:20:20,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2023-11-17 16:20:20,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2023-11-17 16:20:20,997 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2023-11-17 16:20:20,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2023-11-17 16:20:20,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:20:20,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2023-11-17 16:20:20,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 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 16:20:21,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 390.0) internal successors, (1560), 4 states have internal predecessors, (1560), 0 states have call successors, (0), 0 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 16:20:21,006 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 390.0) internal successors, (1560), 4 states have internal predecessors, (1560), 0 states have call successors, (0), 0 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 16:20:21,006 INFO L175 Difference]: Start difference. First operand has 25 places, 25 transitions, 71 flow. Second operand 3 states and 450 transitions. [2023-11-17 16:20:21,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 123 flow [2023-11-17 16:20:21,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 16:20:21,008 INFO L231 Difference]: Finished difference. Result has 26 places, 26 transitions, 78 flow [2023-11-17 16:20:21,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=26, PETRI_TRANSITIONS=26} [2023-11-17 16:20:21,009 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 1 predicate places. [2023-11-17 16:20:21,009 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 26 transitions, 78 flow [2023-11-17 16:20:21,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 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 16:20:21,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:20:21,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:20:21,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 16:20:21,011 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:20:21,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:20:21,016 INFO L85 PathProgramCache]: Analyzing trace with hash 743253635, now seen corresponding path program 1 times [2023-11-17 16:20:21,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:20:21,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490389797] [2023-11-17 16:20:21,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:20:21,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:20:21,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:20:21,140 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 16:20:21,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:20:21,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490389797] [2023-11-17 16:20:21,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490389797] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:20:21,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:20:21,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 16:20:21,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810691487] [2023-11-17 16:20:21,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:20:21,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:20:21,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:20:21,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:20:21,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:20:21,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 390 [2023-11-17 16:20:21,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 26 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 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 16:20:21,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:20:21,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 390 [2023-11-17 16:20:21,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:20:21,226 INFO L124 PetriNetUnfolderBase]: 190/316 cut-off events. [2023-11-17 16:20:21,226 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-17 16:20:21,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 316 events. 190/316 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1013 event pairs, 78 based on Foata normal form. 1/277 useless extension candidates. Maximal degree in co-relation 696. Up to 187 conditions per place. [2023-11-17 16:20:21,228 INFO L140 encePairwiseOnDemand]: 387/390 looper letters, 35 selfloop transitions, 2 changer transitions 2/40 dead transitions. [2023-11-17 16:20:21,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 40 transitions, 196 flow [2023-11-17 16:20:21,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:20:21,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:20:21,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 551 transitions. [2023-11-17 16:20:21,230 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47094017094017093 [2023-11-17 16:20:21,231 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 551 transitions. [2023-11-17 16:20:21,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 551 transitions. [2023-11-17 16:20:21,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:20:21,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 551 transitions. [2023-11-17 16:20:21,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 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 16:20:21,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 390.0) internal successors, (1560), 4 states have internal predecessors, (1560), 0 states have call successors, (0), 0 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 16:20:21,236 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 390.0) internal successors, (1560), 4 states have internal predecessors, (1560), 0 states have call successors, (0), 0 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 16:20:21,236 INFO L175 Difference]: Start difference. First operand has 26 places, 26 transitions, 78 flow. Second operand 3 states and 551 transitions. [2023-11-17 16:20:21,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 40 transitions, 196 flow [2023-11-17 16:20:21,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 40 transitions, 192 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-17 16:20:21,238 INFO L231 Difference]: Finished difference. Result has 28 places, 27 transitions, 86 flow [2023-11-17 16:20:21,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=28, PETRI_TRANSITIONS=27} [2023-11-17 16:20:21,240 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 3 predicate places. [2023-11-17 16:20:21,240 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 27 transitions, 86 flow [2023-11-17 16:20:21,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 0 states have call successors, (0), 0 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 16:20:21,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:20:21,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:20:21,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 16:20:21,241 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:20:21,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:20:21,242 INFO L85 PathProgramCache]: Analyzing trace with hash -2144291843, now seen corresponding path program 1 times [2023-11-17 16:20:21,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:20:21,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673107407] [2023-11-17 16:20:21,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:20:21,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:20:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:20:21,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:20:21,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:20:21,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673107407] [2023-11-17 16:20:21,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673107407] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:20:21,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:20:21,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 16:20:21,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441060947] [2023-11-17 16:20:21,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:20:21,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:20:21,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:20:21,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:20:21,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:20:21,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 390 [2023-11-17 16:20:21,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 27 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 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 16:20:21,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:20:21,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 390 [2023-11-17 16:20:21,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:20:21,407 INFO L124 PetriNetUnfolderBase]: 209/358 cut-off events. [2023-11-17 16:20:21,407 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-11-17 16:20:21,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 860 conditions, 358 events. 209/358 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1208 event pairs, 66 based on Foata normal form. 12/370 useless extension candidates. Maximal degree in co-relation 837. Up to 255 conditions per place. [2023-11-17 16:20:21,410 INFO L140 encePairwiseOnDemand]: 387/390 looper letters, 31 selfloop transitions, 2 changer transitions 5/39 dead transitions. [2023-11-17 16:20:21,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 39 transitions, 193 flow [2023-11-17 16:20:21,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:20:21,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:20:21,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 545 transitions. [2023-11-17 16:20:21,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4658119658119658 [2023-11-17 16:20:21,412 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 545 transitions. [2023-11-17 16:20:21,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 545 transitions. [2023-11-17 16:20:21,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:20:21,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 545 transitions. [2023-11-17 16:20:21,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 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 16:20:21,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 390.0) internal successors, (1560), 4 states have internal predecessors, (1560), 0 states have call successors, (0), 0 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 16:20:21,417 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 390.0) internal successors, (1560), 4 states have internal predecessors, (1560), 0 states have call successors, (0), 0 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 16:20:21,417 INFO L175 Difference]: Start difference. First operand has 28 places, 27 transitions, 86 flow. Second operand 3 states and 545 transitions. [2023-11-17 16:20:21,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 39 transitions, 193 flow [2023-11-17 16:20:21,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 39 transitions, 191 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 16:20:21,419 INFO L231 Difference]: Finished difference. Result has 30 places, 28 transitions, 96 flow [2023-11-17 16:20:21,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=27, 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=96, PETRI_PLACES=30, PETRI_TRANSITIONS=28} [2023-11-17 16:20:21,420 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 5 predicate places. [2023-11-17 16:20:21,421 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 28 transitions, 96 flow [2023-11-17 16:20:21,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 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 16:20:21,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:20:21,421 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 16:20:21,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 16:20:21,421 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:20:21,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:20:21,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1397107243, now seen corresponding path program 1 times [2023-11-17 16:20:21,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:20:21,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245506650] [2023-11-17 16:20:21,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:20:21,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:20:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:20:21,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:20:21,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:20:21,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245506650] [2023-11-17 16:20:21,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245506650] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:20:21,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:20:21,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 16:20:21,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070914865] [2023-11-17 16:20:21,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:20:21,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 16:20:21,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:20:21,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 16:20:21,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 16:20:21,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 390 [2023-11-17 16:20:21,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 28 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 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 16:20:21,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:20:21,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 390 [2023-11-17 16:20:21,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:20:21,638 INFO L124 PetriNetUnfolderBase]: 260/461 cut-off events. [2023-11-17 16:20:21,639 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2023-11-17 16:20:21,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1145 conditions, 461 events. 260/461 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1715 event pairs, 189 based on Foata normal form. 16/477 useless extension candidates. Maximal degree in co-relation 881. Up to 358 conditions per place. [2023-11-17 16:20:21,641 INFO L140 encePairwiseOnDemand]: 386/390 looper letters, 26 selfloop transitions, 2 changer transitions 17/46 dead transitions. [2023-11-17 16:20:21,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 46 transitions, 240 flow [2023-11-17 16:20:21,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:20:21,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 16:20:21,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 627 transitions. [2023-11-17 16:20:21,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40192307692307694 [2023-11-17 16:20:21,644 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 627 transitions. [2023-11-17 16:20:21,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 627 transitions. [2023-11-17 16:20:21,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:20:21,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 627 transitions. [2023-11-17 16:20:21,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 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 16:20:21,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 390.0) internal successors, (1950), 5 states have internal predecessors, (1950), 0 states have call successors, (0), 0 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 16:20:21,650 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 390.0) internal successors, (1950), 5 states have internal predecessors, (1950), 0 states have call successors, (0), 0 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 16:20:21,650 INFO L175 Difference]: Start difference. First operand has 30 places, 28 transitions, 96 flow. Second operand 4 states and 627 transitions. [2023-11-17 16:20:21,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 46 transitions, 240 flow [2023-11-17 16:20:21,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 46 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 16:20:21,652 INFO L231 Difference]: Finished difference. Result has 34 places, 29 transitions, 108 flow [2023-11-17 16:20:21,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=34, PETRI_TRANSITIONS=29} [2023-11-17 16:20:21,673 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 9 predicate places. [2023-11-17 16:20:21,674 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 29 transitions, 108 flow [2023-11-17 16:20:21,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 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 16:20:21,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:20:21,675 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 16:20:21,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 16:20:21,675 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:20:21,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:20:21,676 INFO L85 PathProgramCache]: Analyzing trace with hash 975106714, now seen corresponding path program 1 times [2023-11-17 16:20:21,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:20:21,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343375042] [2023-11-17 16:20:21,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:20:21,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:20:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:20:23,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:20:23,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:20:23,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343375042] [2023-11-17 16:20:23,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343375042] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:20:23,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963056379] [2023-11-17 16:20:23,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:20:23,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:20:23,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:20:23,149 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 16:20:23,183 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 16:20:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:20:23,263 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-17 16:20:23,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:20:23,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-11-17 16:20:23,375 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-17 16:20:23,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-17 16:20:23,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-17 16:20:23,503 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:20:23,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 11 treesize of output 11 [2023-11-17 16:20:23,555 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 8 treesize of output 1 [2023-11-17 16:20:23,591 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 16:20:23,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:20:23,793 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 20 treesize of output 15 [2023-11-17 16:20:24,050 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-17 16:20:24,050 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 34 treesize of output 10 [2023-11-17 16:20:24,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:20:24,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:20:25,187 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:20:25,188 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 62 treesize of output 51 [2023-11-17 16:20:25,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:20:25,209 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 1686 treesize of output 1578 [2023-11-17 16:20:25,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:20:25,264 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 1558 treesize of output 1383 [2023-11-17 16:20:25,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:20:25,320 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 1366 treesize of output 999 [2023-11-17 16:20:25,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:20:25,371 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 982 treesize of output 903 [2023-11-17 16:20:26,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:20:26,972 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 87 [2023-11-17 16:20:27,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:20:27,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 8540 treesize of output 7882 [2023-11-17 16:20:27,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:20:27,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2276 treesize of output 2148 [2023-11-17 16:20:27,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:20:27,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2108 treesize of output 1668 [2023-11-17 16:20:27,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:20:27,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1628 treesize of output 1332 [2023-11-17 16:20:40,614 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:20:40,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963056379] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:20:40,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:20:40,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 29 [2023-11-17 16:20:40,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035825819] [2023-11-17 16:20:40,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:20:40,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-17 16:20:40,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:20:40,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-17 16:20:40,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=791, Unknown=4, NotChecked=0, Total=930 [2023-11-17 16:20:40,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 390 [2023-11-17 16:20:40,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 29 transitions, 108 flow. Second operand has 31 states, 31 states have (on average 91.03225806451613) internal successors, (2822), 31 states have internal predecessors, (2822), 0 states have call successors, (0), 0 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 16:20:40,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:20:40,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 390 [2023-11-17 16:20:40,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:20:44,761 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 16:20:46,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:20:53,615 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 16:20:56,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:21:09,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:21:24,468 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 [0, 1] [2023-11-17 16:21:32,911 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 [0, 1] [2023-11-17 16:21:35,028 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 16:21:40,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:21:40,999 INFO L124 PetriNetUnfolderBase]: 1375/2314 cut-off events. [2023-11-17 16:21:40,999 INFO L125 PetriNetUnfolderBase]: For 885/885 co-relation queries the response was YES. [2023-11-17 16:21:41,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5894 conditions, 2314 events. 1375/2314 cut-off events. For 885/885 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 12417 event pairs, 71 based on Foata normal form. 58/2372 useless extension candidates. Maximal degree in co-relation 5876. Up to 496 conditions per place. [2023-11-17 16:21:41,012 INFO L140 encePairwiseOnDemand]: 372/390 looper letters, 274 selfloop transitions, 163 changer transitions 118/556 dead transitions. [2023-11-17 16:21:41,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 556 transitions, 2836 flow [2023-11-17 16:21:41,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-11-17 16:21:41,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2023-11-17 16:21:41,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 7666 transitions. [2023-11-17 16:21:41,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24570512820512821 [2023-11-17 16:21:41,040 INFO L72 ComplementDD]: Start complementDD. Operand 80 states and 7666 transitions. [2023-11-17 16:21:41,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 7666 transitions. [2023-11-17 16:21:41,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:41,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 80 states and 7666 transitions. [2023-11-17 16:21:41,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 81 states, 80 states have (on average 95.825) internal successors, (7666), 80 states have internal predecessors, (7666), 0 states have call successors, (0), 0 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 16:21:41,108 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 81 states, 81 states have (on average 390.0) internal successors, (31590), 81 states have internal predecessors, (31590), 0 states have call successors, (0), 0 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 16:21:41,118 INFO L81 ComplementDD]: Finished complementDD. Result has 81 states, 81 states have (on average 390.0) internal successors, (31590), 81 states have internal predecessors, (31590), 0 states have call successors, (0), 0 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 16:21:41,118 INFO L175 Difference]: Start difference. First operand has 34 places, 29 transitions, 108 flow. Second operand 80 states and 7666 transitions. [2023-11-17 16:21:41,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 556 transitions, 2836 flow [2023-11-17 16:21:41,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 556 transitions, 2814 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-11-17 16:21:41,135 INFO L231 Difference]: Finished difference. Result has 160 places, 214 transitions, 1470 flow [2023-11-17 16:21:41,135 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=80, PETRI_FLOW=1470, PETRI_PLACES=160, PETRI_TRANSITIONS=214} [2023-11-17 16:21:41,137 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 135 predicate places. [2023-11-17 16:21:41,137 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 214 transitions, 1470 flow [2023-11-17 16:21:41,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 91.03225806451613) internal successors, (2822), 31 states have internal predecessors, (2822), 0 states have call successors, (0), 0 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 16:21:41,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:41,138 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 16:21:41,152 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 16:21:41,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-17 16:21:41,345 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:21:41,346 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:41,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1694512542, now seen corresponding path program 2 times [2023-11-17 16:21:41,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:41,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013023324] [2023-11-17 16:21:41,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:41,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:41,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:42,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:21:42,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:42,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013023324] [2023-11-17 16:21:42,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013023324] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:42,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120038592] [2023-11-17 16:21:42,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:21:42,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:42,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:42,179 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 16:21:42,180 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 16:21:42,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:21:42,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:21:42,269 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-17 16:21:42,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:42,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:21:42,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-17 16:21:42,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:21:42,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:21:42,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-11-17 16:21:42,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-11-17 16:21:42,393 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:21:42,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-17 16:21:42,428 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 8 treesize of output 1 [2023-11-17 16:21:42,463 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 16:21:44,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:21:44,608 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-17 16:21:44,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2023-11-17 16:21:44,616 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 27 treesize of output 15 [2023-11-17 16:21:44,761 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 15 treesize of output 7 [2023-11-17 16:21:44,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:21:44,778 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:45,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:45,517 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 117 treesize of output 81 [2023-11-17 16:21:45,550 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:45,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 3964 treesize of output 3562 [2023-11-17 16:21:45,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:45,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1076 treesize of output 876 [2023-11-17 16:21:45,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:45,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 836 treesize of output 756 [2023-11-17 16:21:45,688 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 502 treesize of output 406 [2023-11-17 16:21:49,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:49,128 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 56 treesize of output 45 [2023-11-17 16:21:49,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:49,145 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 854 treesize of output 746 [2023-11-17 16:21:49,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:49,164 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 358 treesize of output 327 [2023-11-17 16:21:49,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:49,184 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 310 treesize of output 231 [2023-11-17 16:21:49,361 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:21:49,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120038592] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:49,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:49,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2023-11-17 16:21:49,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684579884] [2023-11-17 16:21:49,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:49,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-17 16:21:49,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:49,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-17 16:21:49,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=700, Unknown=8, NotChecked=0, Total=870 [2023-11-17 16:21:49,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 390 [2023-11-17 16:21:49,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 214 transitions, 1470 flow. Second operand has 30 states, 30 states have (on average 96.1) internal successors, (2883), 30 states have internal predecessors, (2883), 0 states have call successors, (0), 0 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 16:21:49,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:49,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 390 [2023-11-17 16:21:49,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:49,708 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~start~0 1))) (let ((.cse2 (< c_~start~0 0)) (.cse4 (< c_~n~0 .cse3)) (.cse0 (not (= (mod c_~ok~0 256) 0))) (.cse7 (+ (* c_~end~0 4) c_~queue~0.offset)) (.cse1 (+ (* c_~start~0 4) c_~queue~0.offset))) (and (or (= (mod |c_thread2Thread1of1ForFork0_~cond~0#1| 256) 0) (and .cse0 (<= c_~v_old~0 (select (select |c_#memory_int| c_~queue~0.base) .cse1))) .cse2 (< c_~end~0 .cse3) .cse4) (= c_~ok~0 1) (or .cse2 .cse4 (and (forall ((~A~0.offset Int) (v_ArrVal_142 (Array Int Int)) (~i~0 Int) (v_ArrVal_143 (Array Int Int)) (~A~0.base Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_142) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_143))) (let ((.cse5 (select (select .cse6 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (forall ((v_ArrVal_144 (Array Int Int))) (< .cse5 (+ (select (select (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_144) c_~queue~0.base) .cse1) 1))) (not (= .cse5 (select (select .cse6 c_~queue~0.base) .cse7))))))) (or .cse0 (forall ((~A~0.offset Int) (v_ArrVal_142 (Array Int Int)) (~i~0 Int) (v_ArrVal_143 (Array Int Int)) (~A~0.base Int)) (not (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_142) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_143))) (= (select (select .cse8 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse8 c_~queue~0.base) .cse7)))))))) (or .cse2 .cse4 (and (or .cse0 (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_143 (Array Int Int)) (~A~0.base Int)) (not (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_143))) (= (select (select .cse9 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse9 c_~queue~0.base) .cse7)))))) (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_143 (Array Int Int)) (~A~0.base Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_143))) (let ((.cse10 (select (select .cse11 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= .cse10 (select (select .cse11 c_~queue~0.base) .cse7))) (forall ((v_ArrVal_144 (Array Int Int))) (< .cse10 (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_144) c_~queue~0.base) .cse1) 1)))))))))))) is different from false [2023-11-17 16:21:52,314 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 [0] [2023-11-17 16:21:54,540 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 [0] [2023-11-17 16:21:56,865 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 [0] [2023-11-17 16:21:58,874 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 [0] [2023-11-17 16:22:02,195 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 [0] [2023-11-17 16:22:04,568 INFO L124 PetriNetUnfolderBase]: 3058/5126 cut-off events. [2023-11-17 16:22:04,569 INFO L125 PetriNetUnfolderBase]: For 85966/85968 co-relation queries the response was YES. [2023-11-17 16:22:04,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30440 conditions, 5126 events. 3058/5126 cut-off events. For 85966/85968 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 31462 event pairs, 345 based on Foata normal form. 16/5141 useless extension candidates. Maximal degree in co-relation 30354. Up to 1462 conditions per place. [2023-11-17 16:22:04,635 INFO L140 encePairwiseOnDemand]: 375/390 looper letters, 450 selfloop transitions, 245 changer transitions 87/783 dead transitions. [2023-11-17 16:22:04,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 783 transitions, 8298 flow [2023-11-17 16:22:04,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-11-17 16:22:04,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-11-17 16:22:04,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 4690 transitions. [2023-11-17 16:22:04,646 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26142697881828314 [2023-11-17 16:22:04,647 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 4690 transitions. [2023-11-17 16:22:04,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 4690 transitions. [2023-11-17 16:22:04,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:04,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 4690 transitions. [2023-11-17 16:22:04,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 101.95652173913044) internal successors, (4690), 46 states have internal predecessors, (4690), 0 states have call successors, (0), 0 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 16:22:04,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 390.0) internal successors, (18330), 47 states have internal predecessors, (18330), 0 states have call successors, (0), 0 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 16:22:04,694 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 390.0) internal successors, (18330), 47 states have internal predecessors, (18330), 0 states have call successors, (0), 0 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 16:22:04,694 INFO L175 Difference]: Start difference. First operand has 160 places, 214 transitions, 1470 flow. Second operand 46 states and 4690 transitions. [2023-11-17 16:22:04,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 783 transitions, 8298 flow [2023-11-17 16:22:04,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 783 transitions, 7238 flow, removed 529 selfloop flow, removed 14 redundant places. [2023-11-17 16:22:04,942 INFO L231 Difference]: Finished difference. Result has 200 places, 367 transitions, 3256 flow [2023-11-17 16:22:04,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=3256, PETRI_PLACES=200, PETRI_TRANSITIONS=367} [2023-11-17 16:22:04,943 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 175 predicate places. [2023-11-17 16:22:04,943 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 367 transitions, 3256 flow [2023-11-17 16:22:04,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 96.1) internal successors, (2883), 30 states have internal predecessors, (2883), 0 states have call successors, (0), 0 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 16:22:04,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:04,945 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] [2023-11-17 16:22:04,953 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 16:22:05,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-17 16:22:05,150 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:22:05,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:05,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1802487349, now seen corresponding path program 3 times [2023-11-17 16:22:05,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:05,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770431204] [2023-11-17 16:22:05,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:05,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:06,172 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:22:06,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:06,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770431204] [2023-11-17 16:22:06,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770431204] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:06,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219166511] [2023-11-17 16:22:06,173 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:22:06,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:06,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:06,177 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 16:22:06,181 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 16:22:06,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 16:22:06,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:22:06,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-17 16:22:06,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:06,486 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-11-17 16:22:06,486 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 42 treesize of output 10 [2023-11-17 16:22:06,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:22:06,507 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:06,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:06,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 121 [2023-11-17 16:22:06,972 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 16:22:06,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219166511] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:22:06,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:22:06,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 21 [2023-11-17 16:22:06,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299856076] [2023-11-17 16:22:06,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:22:06,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-17 16:22:06,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:06,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-17 16:22:06,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2023-11-17 16:22:06,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 390 [2023-11-17 16:22:06,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 367 transitions, 3256 flow. Second operand has 23 states, 23 states have (on average 103.82608695652173) internal successors, (2388), 23 states have internal predecessors, (2388), 0 states have call successors, (0), 0 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 16:22:06,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:06,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 390 [2023-11-17 16:22:06,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:09,613 INFO L124 PetriNetUnfolderBase]: 3432/5783 cut-off events. [2023-11-17 16:22:09,613 INFO L125 PetriNetUnfolderBase]: For 106632/106634 co-relation queries the response was YES. [2023-11-17 16:22:09,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37919 conditions, 5783 events. 3432/5783 cut-off events. For 106632/106634 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 36902 event pairs, 427 based on Foata normal form. 3/5733 useless extension candidates. Maximal degree in co-relation 37785. Up to 2901 conditions per place. [2023-11-17 16:22:09,691 INFO L140 encePairwiseOnDemand]: 373/390 looper letters, 378 selfloop transitions, 212 changer transitions 42/633 dead transitions. [2023-11-17 16:22:09,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 633 transitions, 7335 flow [2023-11-17 16:22:09,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 16:22:09,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-11-17 16:22:09,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 3121 transitions. [2023-11-17 16:22:09,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2759504862953139 [2023-11-17 16:22:09,697 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 3121 transitions. [2023-11-17 16:22:09,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 3121 transitions. [2023-11-17 16:22:09,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:09,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 3121 transitions. [2023-11-17 16:22:09,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 107.62068965517241) internal successors, (3121), 29 states have internal predecessors, (3121), 0 states have call successors, (0), 0 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 16:22:09,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 390.0) internal successors, (11700), 30 states have internal predecessors, (11700), 0 states have call successors, (0), 0 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 16:22:09,718 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 390.0) internal successors, (11700), 30 states have internal predecessors, (11700), 0 states have call successors, (0), 0 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 16:22:09,718 INFO L175 Difference]: Start difference. First operand has 200 places, 367 transitions, 3256 flow. Second operand 29 states and 3121 transitions. [2023-11-17 16:22:09,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 633 transitions, 7335 flow [2023-11-17 16:22:10,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 633 transitions, 6853 flow, removed 188 selfloop flow, removed 14 redundant places. [2023-11-17 16:22:10,152 INFO L231 Difference]: Finished difference. Result has 224 places, 452 transitions, 4718 flow [2023-11-17 16:22:10,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=2913, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=4718, PETRI_PLACES=224, PETRI_TRANSITIONS=452} [2023-11-17 16:22:10,154 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 199 predicate places. [2023-11-17 16:22:10,154 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 452 transitions, 4718 flow [2023-11-17 16:22:10,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 103.82608695652173) internal successors, (2388), 23 states have internal predecessors, (2388), 0 states have call successors, (0), 0 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 16:22:10,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:10,155 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:22:10,166 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 16:22:10,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:10,360 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:22:10,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:10,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1132487966, now seen corresponding path program 4 times [2023-11-17 16:22:10,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:10,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94105276] [2023-11-17 16:22:10,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:10,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:10,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:22:10,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:10,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94105276] [2023-11-17 16:22:10,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94105276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:22:10,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:22:10,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 16:22:10,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036429349] [2023-11-17 16:22:10,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:22:10,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 16:22:10,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:10,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 16:22:10,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 16:22:10,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 390 [2023-11-17 16:22:10,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 452 transitions, 4718 flow. Second operand has 5 states, 5 states have (on average 174.6) internal successors, (873), 5 states have internal predecessors, (873), 0 states have call successors, (0), 0 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 16:22:10,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:10,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 390 [2023-11-17 16:22:10,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:11,904 INFO L124 PetriNetUnfolderBase]: 3852/6567 cut-off events. [2023-11-17 16:22:11,904 INFO L125 PetriNetUnfolderBase]: For 206252/206254 co-relation queries the response was YES. [2023-11-17 16:22:11,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52555 conditions, 6567 events. 3852/6567 cut-off events. For 206252/206254 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 42436 event pairs, 655 based on Foata normal form. 202/6756 useless extension candidates. Maximal degree in co-relation 52446. Up to 3025 conditions per place. [2023-11-17 16:22:11,974 INFO L140 encePairwiseOnDemand]: 387/390 looper letters, 373 selfloop transitions, 141 changer transitions 0/515 dead transitions. [2023-11-17 16:22:11,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 515 transitions, 6807 flow [2023-11-17 16:22:11,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:22:11,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 16:22:11,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 734 transitions. [2023-11-17 16:22:11,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4705128205128205 [2023-11-17 16:22:11,976 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 734 transitions. [2023-11-17 16:22:11,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 734 transitions. [2023-11-17 16:22:11,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:11,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 734 transitions. [2023-11-17 16:22:11,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 183.5) internal successors, (734), 4 states have internal predecessors, (734), 0 states have call successors, (0), 0 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 16:22:11,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 390.0) internal successors, (1950), 5 states have internal predecessors, (1950), 0 states have call successors, (0), 0 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 16:22:11,979 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 390.0) internal successors, (1950), 5 states have internal predecessors, (1950), 0 states have call successors, (0), 0 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 16:22:11,979 INFO L175 Difference]: Start difference. First operand has 224 places, 452 transitions, 4718 flow. Second operand 4 states and 734 transitions. [2023-11-17 16:22:11,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 515 transitions, 6807 flow [2023-11-17 16:22:12,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 515 transitions, 6182 flow, removed 287 selfloop flow, removed 13 redundant places. [2023-11-17 16:22:12,623 INFO L231 Difference]: Finished difference. Result has 210 places, 446 transitions, 4984 flow [2023-11-17 16:22:12,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=3962, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=4984, PETRI_PLACES=210, PETRI_TRANSITIONS=446} [2023-11-17 16:22:12,624 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 185 predicate places. [2023-11-17 16:22:12,624 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 446 transitions, 4984 flow [2023-11-17 16:22:12,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 174.6) internal successors, (873), 5 states have internal predecessors, (873), 0 states have call successors, (0), 0 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 16:22:12,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:12,625 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] [2023-11-17 16:22:12,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 16:22:12,625 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:22:12,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:12,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1807565712, now seen corresponding path program 5 times [2023-11-17 16:22:12,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:12,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322407064] [2023-11-17 16:22:12,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:12,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:12,768 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 16:22:12,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:12,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322407064] [2023-11-17 16:22:12,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322407064] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:12,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957449814] [2023-11-17 16:22:12,768 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 16:22:12,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:12,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:12,770 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 16:22:12,787 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 16:22:12,850 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:22:12,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:22:12,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-17 16:22:12,853 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:12,895 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:22:12,895 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:13,014 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:22:13,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957449814] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:22:13,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:22:13,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2023-11-17 16:22:13,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258556941] [2023-11-17 16:22:13,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:22:13,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-17 16:22:13,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:13,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-17 16:22:13,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-17 16:22:13,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 390 [2023-11-17 16:22:13,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 446 transitions, 4984 flow. Second operand has 11 states, 11 states have (on average 141.0909090909091) internal successors, (1552), 11 states have internal predecessors, (1552), 0 states have call successors, (0), 0 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 16:22:13,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:13,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 390 [2023-11-17 16:22:13,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:14,956 INFO L124 PetriNetUnfolderBase]: 5393/9194 cut-off events. [2023-11-17 16:22:14,957 INFO L125 PetriNetUnfolderBase]: For 230885/230887 co-relation queries the response was YES. [2023-11-17 16:22:14,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70002 conditions, 9194 events. 5393/9194 cut-off events. For 230885/230887 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 62937 event pairs, 429 based on Foata normal form. 156/9349 useless extension candidates. Maximal degree in co-relation 69587. Up to 3229 conditions per place. [2023-11-17 16:22:15,041 INFO L140 encePairwiseOnDemand]: 379/390 looper letters, 625 selfloop transitions, 401 changer transitions 0/1027 dead transitions. [2023-11-17 16:22:15,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 1027 transitions, 14177 flow [2023-11-17 16:22:15,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-17 16:22:15,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-17 16:22:15,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2009 transitions. [2023-11-17 16:22:15,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.367948717948718 [2023-11-17 16:22:15,044 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2009 transitions. [2023-11-17 16:22:15,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2009 transitions. [2023-11-17 16:22:15,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:15,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2009 transitions. [2023-11-17 16:22:15,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 143.5) internal successors, (2009), 14 states have internal predecessors, (2009), 0 states have call successors, (0), 0 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 16:22:15,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 390.0) internal successors, (5850), 15 states have internal predecessors, (5850), 0 states have call successors, (0), 0 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 16:22:15,051 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 390.0) internal successors, (5850), 15 states have internal predecessors, (5850), 0 states have call successors, (0), 0 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 16:22:15,051 INFO L175 Difference]: Start difference. First operand has 210 places, 446 transitions, 4984 flow. Second operand 14 states and 2009 transitions. [2023-11-17 16:22:15,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 1027 transitions, 14177 flow [2023-11-17 16:22:15,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 1027 transitions, 14037 flow, removed 70 selfloop flow, removed 0 redundant places. [2023-11-17 16:22:15,922 INFO L231 Difference]: Finished difference. Result has 230 places, 737 transitions, 10443 flow [2023-11-17 16:22:15,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=4934, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=117, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=10443, PETRI_PLACES=230, PETRI_TRANSITIONS=737} [2023-11-17 16:22:15,923 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 205 predicate places. [2023-11-17 16:22:15,923 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 737 transitions, 10443 flow [2023-11-17 16:22:15,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 141.0909090909091) internal successors, (1552), 11 states have internal predecessors, (1552), 0 states have call successors, (0), 0 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 16:22:15,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:15,923 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:22:15,929 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 16:22:16,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:16,124 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:22:16,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:16,125 INFO L85 PathProgramCache]: Analyzing trace with hash 691700714, now seen corresponding path program 6 times [2023-11-17 16:22:16,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:16,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215509871] [2023-11-17 16:22:16,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:16,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:17,291 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:22:17,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:17,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215509871] [2023-11-17 16:22:17,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215509871] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:17,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471422529] [2023-11-17 16:22:17,292 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 16:22:17,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:17,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:17,293 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 16:22:17,301 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 16:22:17,407 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-17 16:22:17,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:22:17,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-17 16:22:17,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:17,711 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-11-17 16:22:17,712 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 42 treesize of output 10 [2023-11-17 16:22:17,751 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:22:17,751 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:17,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:17,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 121 [2023-11-17 16:22:18,126 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-17 16:22:18,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471422529] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:22:18,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:22:18,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 23 [2023-11-17 16:22:18,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563906931] [2023-11-17 16:22:18,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:22:18,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-17 16:22:18,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:18,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-17 16:22:18,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2023-11-17 16:22:18,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 390 [2023-11-17 16:22:18,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 737 transitions, 10443 flow. Second operand has 25 states, 25 states have (on average 107.68) internal successors, (2692), 25 states have internal predecessors, (2692), 0 states have call successors, (0), 0 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 16:22:18,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:18,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 390 [2023-11-17 16:22:18,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:21,554 INFO L124 PetriNetUnfolderBase]: 6260/10684 cut-off events. [2023-11-17 16:22:21,554 INFO L125 PetriNetUnfolderBase]: For 320352/320356 co-relation queries the response was YES. [2023-11-17 16:22:21,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93347 conditions, 10684 events. 6260/10684 cut-off events. For 320352/320356 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 74959 event pairs, 682 based on Foata normal form. 8/10690 useless extension candidates. Maximal degree in co-relation 91878. Up to 4743 conditions per place. [2023-11-17 16:22:21,751 INFO L140 encePairwiseOnDemand]: 377/390 looper letters, 520 selfloop transitions, 482 changer transitions 24/1027 dead transitions. [2023-11-17 16:22:21,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 1027 transitions, 17163 flow [2023-11-17 16:22:21,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-17 16:22:21,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-17 16:22:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2349 transitions. [2023-11-17 16:22:21,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2868131868131868 [2023-11-17 16:22:21,765 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 2349 transitions. [2023-11-17 16:22:21,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 2349 transitions. [2023-11-17 16:22:21,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:21,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2349 transitions. [2023-11-17 16:22:21,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 111.85714285714286) internal successors, (2349), 21 states have internal predecessors, (2349), 0 states have call successors, (0), 0 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 16:22:21,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 390.0) internal successors, (8580), 22 states have internal predecessors, (8580), 0 states have call successors, (0), 0 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 16:22:21,776 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 390.0) internal successors, (8580), 22 states have internal predecessors, (8580), 0 states have call successors, (0), 0 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 16:22:21,776 INFO L175 Difference]: Start difference. First operand has 230 places, 737 transitions, 10443 flow. Second operand 21 states and 2349 transitions. [2023-11-17 16:22:21,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 1027 transitions, 17163 flow [2023-11-17 16:22:23,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 1027 transitions, 16261 flow, removed 398 selfloop flow, removed 3 redundant places. [2023-11-17 16:22:23,790 INFO L231 Difference]: Finished difference. Result has 253 places, 809 transitions, 12912 flow [2023-11-17 16:22:23,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=10022, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=737, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=410, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=12912, PETRI_PLACES=253, PETRI_TRANSITIONS=809} [2023-11-17 16:22:23,791 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 228 predicate places. [2023-11-17 16:22:23,791 INFO L495 AbstractCegarLoop]: Abstraction has has 253 places, 809 transitions, 12912 flow [2023-11-17 16:22:23,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 107.68) internal successors, (2692), 25 states have internal predecessors, (2692), 0 states have call successors, (0), 0 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 16:22:23,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:23,792 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:22:23,805 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 16:22:24,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-17 16:22:24,005 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:22:24,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:24,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1670511091, now seen corresponding path program 7 times [2023-11-17 16:22:24,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:24,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305104611] [2023-11-17 16:22:24,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:24,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:25,251 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:22:25,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:25,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305104611] [2023-11-17 16:22:25,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305104611] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:25,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895806433] [2023-11-17 16:22:25,251 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 16:22:25,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:25,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:25,253 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 16:22:25,260 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 16:22:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:25,356 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-17 16:22:25,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:25,517 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 16:22:25,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:22:25,552 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 16 treesize of output 11 [2023-11-17 16:22:25,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:22:25,665 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 16 treesize of output 11 [2023-11-17 16:22:25,851 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-17 16:22:25,851 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 34 treesize of output 10 [2023-11-17 16:22:25,878 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:22:25,879 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:26,134 WARN L854 $PredicateComparison]: unable to prove that (or (let ((.cse1 (+ c_~A~0.offset (* c_~i~0 4))) (.cse2 (* c_~end~0 4))) (and (or (forall ((~queue~0.base Int) (~queue~0.offset Int) (v_ArrVal_324 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_324))) (= (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 ~queue~0.base) (+ .cse2 ~queue~0.offset)))))) (not (= (mod c_~ok~0 256) 0))) (forall ((~queue~0.base Int) (~queue~0.offset Int) (v_ArrVal_324 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_324))) (let ((.cse3 (select .cse4 ~queue~0.base))) (or (< c_~v_old~0 (+ (select .cse3 (+ (* c_~start~0 4) ~queue~0.offset)) 1)) (not (= (select (select .cse4 c_~A~0.base) .cse1) (select .cse3 (+ .cse2 ~queue~0.offset)))))))))) (and (<= c_~N~0 c_~i~0) (<= c_~end~0 c_~start~0))) is different from false [2023-11-17 16:22:26,151 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* c_~i~0 4))) (.cse2 (* c_~end~0 4))) (and (or (forall ((~queue~0.base Int) (~queue~0.offset Int) (v_ArrVal_324 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_324))) (= (select (select .cse0 c_~A~0.base) .cse1) (select (select .cse0 ~queue~0.base) (+ .cse2 ~queue~0.offset)))))) (not (= (mod c_~ok~0 256) 0))) (forall ((~queue~0.base Int) (~queue~0.offset Int) (v_ArrVal_324 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_324))) (let ((.cse3 (select .cse4 ~queue~0.base))) (or (< c_~v_old~0 (+ (select .cse3 (+ (* c_~start~0 4) ~queue~0.offset)) 1)) (not (= (select (select .cse4 c_~A~0.base) .cse1) (select .cse3 (+ .cse2 ~queue~0.offset)))))))))) is different from false [2023-11-17 16:22:26,206 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~end~0 4)) (.cse3 (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((~queue~0.base Int) (~queue~0.offset Int) (v_ArrVal_324 (Array Int Int)) (v_ArrVal_323 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_324))) (let ((.cse0 (select .cse2 ~queue~0.base))) (or (< (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ (select .cse0 (+ (* c_~start~0 4) ~queue~0.offset)) 1)) (not (= (select .cse0 (+ .cse1 ~queue~0.offset)) (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3))))))) (or (forall ((~queue~0.base Int) (~queue~0.offset Int) (v_ArrVal_324 (Array Int Int)) (v_ArrVal_323 (Array Int Int))) (not (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_324))) (= (select (select .cse4 ~queue~0.base) (+ .cse1 ~queue~0.offset)) (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse3))))) (not (= (mod c_~ok~0 256) 0))))) is different from false [2023-11-17 16:22:26,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:26,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 74 [2023-11-17 16:22:26,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:26,227 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 1173 treesize of output 1125 [2023-11-17 16:22:26,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:26,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 470 treesize of output 456 [2023-11-17 16:22:26,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:26,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 421 treesize of output 353 [2023-11-17 16:22:26,315 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2023-11-17 16:22:26,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 155 treesize of output 141 [2023-11-17 16:22:28,753 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 13 treesize of output 7 [2023-11-17 16:22:28,760 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 25 treesize of output 13 [2023-11-17 16:22:28,782 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:28,783 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 35 treesize of output 25 [2023-11-17 16:22:28,796 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 25 treesize of output 13 [2023-11-17 16:22:28,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:28,812 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 41 treesize of output 31 [2023-11-17 16:22:28,833 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:22:28,833 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 30 treesize of output 22 [2023-11-17 16:22:28,856 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 16:22:28,856 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 28 treesize of output 1 [2023-11-17 16:22:28,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:22:28,885 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 30 treesize of output 18 [2023-11-17 16:22:28,894 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-17 16:22:28,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:22:28,904 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 41 treesize of output 23 [2023-11-17 16:22:29,223 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-17 16:22:29,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 7 [2023-11-17 16:22:29,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:29,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 41 [2023-11-17 16:22:29,238 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:22:29,238 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:22:29,244 INFO L349 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2023-11-17 16:22:29,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 64 [2023-11-17 16:22:29,249 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 24 treesize of output 18 [2023-11-17 16:22:29,378 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 2 not checked. [2023-11-17 16:22:29,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895806433] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:22:29,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:22:29,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 31 [2023-11-17 16:22:29,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923948216] [2023-11-17 16:22:29,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:22:29,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-17 16:22:29,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:29,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-17 16:22:29,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=727, Unknown=3, NotChecked=174, Total=1056 [2023-11-17 16:22:29,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 390 [2023-11-17 16:22:29,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 809 transitions, 12912 flow. Second operand has 33 states, 33 states have (on average 94.06060606060606) internal successors, (3104), 33 states have internal predecessors, (3104), 0 states have call successors, (0), 0 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 16:22:29,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:29,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 390 [2023-11-17 16:22:29,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:34,193 INFO L124 PetriNetUnfolderBase]: 7549/12856 cut-off events. [2023-11-17 16:22:34,194 INFO L125 PetriNetUnfolderBase]: For 364712/364716 co-relation queries the response was YES. [2023-11-17 16:22:34,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115381 conditions, 12856 events. 7549/12856 cut-off events. For 364712/364716 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 92855 event pairs, 604 based on Foata normal form. 8/12862 useless extension candidates. Maximal degree in co-relation 115236. Up to 4666 conditions per place. [2023-11-17 16:22:34,334 INFO L140 encePairwiseOnDemand]: 375/390 looper letters, 508 selfloop transitions, 603 changer transitions 33/1145 dead transitions. [2023-11-17 16:22:34,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 1145 transitions, 20497 flow [2023-11-17 16:22:34,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-17 16:22:34,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-11-17 16:22:34,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2357 transitions. [2023-11-17 16:22:34,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2518162393162393 [2023-11-17 16:22:34,339 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2357 transitions. [2023-11-17 16:22:34,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2357 transitions. [2023-11-17 16:22:34,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:34,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2357 transitions. [2023-11-17 16:22:34,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 98.20833333333333) internal successors, (2357), 24 states have internal predecessors, (2357), 0 states have call successors, (0), 0 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 16:22:34,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 390.0) internal successors, (9750), 25 states have internal predecessors, (9750), 0 states have call successors, (0), 0 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 16:22:34,349 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 390.0) internal successors, (9750), 25 states have internal predecessors, (9750), 0 states have call successors, (0), 0 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 16:22:34,350 INFO L175 Difference]: Start difference. First operand has 253 places, 809 transitions, 12912 flow. Second operand 24 states and 2357 transitions. [2023-11-17 16:22:34,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 1145 transitions, 20497 flow [2023-11-17 16:22:36,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 1145 transitions, 20250 flow, removed 86 selfloop flow, removed 11 redundant places. [2023-11-17 16:22:36,942 INFO L231 Difference]: Finished difference. Result has 271 places, 959 transitions, 17490 flow [2023-11-17 16:22:36,943 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=12697, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=809, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=460, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=17490, PETRI_PLACES=271, PETRI_TRANSITIONS=959} [2023-11-17 16:22:36,943 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 246 predicate places. [2023-11-17 16:22:36,943 INFO L495 AbstractCegarLoop]: Abstraction has has 271 places, 959 transitions, 17490 flow [2023-11-17 16:22:36,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 94.06060606060606) internal successors, (3104), 33 states have internal predecessors, (3104), 0 states have call successors, (0), 0 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 16:22:36,944 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:36,944 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:22:36,949 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 16:22:37,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:37,145 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:22:37,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:37,146 INFO L85 PathProgramCache]: Analyzing trace with hash 479240845, now seen corresponding path program 8 times [2023-11-17 16:22:37,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:37,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618178913] [2023-11-17 16:22:37,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:37,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:39,407 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:22:39,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:39,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618178913] [2023-11-17 16:22:39,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618178913] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:39,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32071835] [2023-11-17 16:22:39,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:22:39,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:39,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:39,409 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 16:22:39,411 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 16:22:39,524 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:22:39,524 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:22:39,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-17 16:22:39,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:39,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:22:39,924 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-17 16:22:39,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2023-11-17 16:22:39,931 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 27 treesize of output 15 [2023-11-17 16:22:40,065 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 23 treesize of output 7 [2023-11-17 16:22:40,097 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:22:40,097 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:40,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:22:40,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 131 [2023-11-17 16:22:40,464 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 38 treesize of output 32 [2023-11-17 16:22:40,807 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-17 16:22:40,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32071835] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:22:40,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:22:40,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 8] total 32 [2023-11-17 16:22:40,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703232353] [2023-11-17 16:22:40,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:22:40,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-17 16:22:40,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:40,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-17 16:22:40,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=946, Unknown=2, NotChecked=0, Total=1122 [2023-11-17 16:22:40,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 390 [2023-11-17 16:22:40,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 959 transitions, 17490 flow. Second operand has 34 states, 34 states have (on average 98.02941176470588) internal successors, (3333), 34 states have internal predecessors, (3333), 0 states have call successors, (0), 0 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 16:22:40,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:40,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 390 [2023-11-17 16:22:40,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:46,992 INFO L124 PetriNetUnfolderBase]: 8177/13917 cut-off events. [2023-11-17 16:22:46,992 INFO L125 PetriNetUnfolderBase]: For 468499/468503 co-relation queries the response was YES. [2023-11-17 16:22:47,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133252 conditions, 13917 events. 8177/13917 cut-off events. For 468499/468503 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 101174 event pairs, 714 based on Foata normal form. 8/13923 useless extension candidates. Maximal degree in co-relation 131368. Up to 5073 conditions per place. [2023-11-17 16:22:47,133 INFO L140 encePairwiseOnDemand]: 375/390 looper letters, 561 selfloop transitions, 681 changer transitions 28/1271 dead transitions. [2023-11-17 16:22:47,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 1271 transitions, 24660 flow [2023-11-17 16:22:47,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-17 16:22:47,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-11-17 16:22:47,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2447 transitions. [2023-11-17 16:22:47,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.26143162393162395 [2023-11-17 16:22:47,146 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2447 transitions. [2023-11-17 16:22:47,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2447 transitions. [2023-11-17 16:22:47,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:47,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2447 transitions. [2023-11-17 16:22:47,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 101.95833333333333) internal successors, (2447), 24 states have internal predecessors, (2447), 0 states have call successors, (0), 0 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 16:22:47,157 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 390.0) internal successors, (9750), 25 states have internal predecessors, (9750), 0 states have call successors, (0), 0 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 16:22:47,158 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 390.0) internal successors, (9750), 25 states have internal predecessors, (9750), 0 states have call successors, (0), 0 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 16:22:47,158 INFO L175 Difference]: Start difference. First operand has 271 places, 959 transitions, 17490 flow. Second operand 24 states and 2447 transitions. [2023-11-17 16:22:47,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 1271 transitions, 24660 flow [2023-11-17 16:22:50,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 1271 transitions, 23749 flow, removed 155 selfloop flow, removed 10 redundant places. [2023-11-17 16:22:50,490 INFO L231 Difference]: Finished difference. Result has 294 places, 1045 transitions, 20723 flow [2023-11-17 16:22:50,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=16742, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=959, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=595, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=20723, PETRI_PLACES=294, PETRI_TRANSITIONS=1045} [2023-11-17 16:22:50,491 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 269 predicate places. [2023-11-17 16:22:50,491 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 1045 transitions, 20723 flow [2023-11-17 16:22:50,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 98.02941176470588) internal successors, (3333), 34 states have internal predecessors, (3333), 0 states have call successors, (0), 0 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 16:22:50,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:50,492 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:22:50,496 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 16:22:50,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:50,693 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:22:50,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:50,693 INFO L85 PathProgramCache]: Analyzing trace with hash -142691029, now seen corresponding path program 9 times [2023-11-17 16:22:50,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:50,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920785264] [2023-11-17 16:22:50,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:50,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:50,824 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-17 16:22:50,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:50,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920785264] [2023-11-17 16:22:50,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920785264] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:50,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735391919] [2023-11-17 16:22:50,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:22:50,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:50,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:50,826 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 16:22:50,846 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 16:22:50,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 16:22:50,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:22:50,942 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:22:50,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:51,036 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:22:51,036 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:51,176 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:22:51,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735391919] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:22:51,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:22:51,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2023-11-17 16:22:51,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953120940] [2023-11-17 16:22:51,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:22:51,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-17 16:22:51,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:51,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-17 16:22:51,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-11-17 16:22:51,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 390 [2023-11-17 16:22:51,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 1045 transitions, 20723 flow. Second operand has 14 states, 14 states have (on average 144.64285714285714) internal successors, (2025), 14 states have internal predecessors, (2025), 0 states have call successors, (0), 0 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 16:22:51,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:51,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 390 [2023-11-17 16:22:51,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:54,765 INFO L124 PetriNetUnfolderBase]: 6328/10909 cut-off events. [2023-11-17 16:22:54,765 INFO L125 PetriNetUnfolderBase]: For 436352/436356 co-relation queries the response was YES. [2023-11-17 16:22:54,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110045 conditions, 10909 events. 6328/10909 cut-off events. For 436352/436356 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 77362 event pairs, 1253 based on Foata normal form. 129/11036 useless extension candidates. Maximal degree in co-relation 109889. Up to 8132 conditions per place. [2023-11-17 16:22:55,002 INFO L140 encePairwiseOnDemand]: 385/390 looper letters, 543 selfloop transitions, 38 changer transitions 322/904 dead transitions. [2023-11-17 16:22:55,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 904 transitions, 20111 flow [2023-11-17 16:22:55,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 16:22:55,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 16:22:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1192 transitions. [2023-11-17 16:22:55,004 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.382051282051282 [2023-11-17 16:22:55,005 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1192 transitions. [2023-11-17 16:22:55,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1192 transitions. [2023-11-17 16:22:55,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:55,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1192 transitions. [2023-11-17 16:22:55,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 149.0) internal successors, (1192), 8 states have internal predecessors, (1192), 0 states have call successors, (0), 0 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 16:22:55,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 390.0) internal successors, (3510), 9 states have internal predecessors, (3510), 0 states have call successors, (0), 0 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 16:22:55,009 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 390.0) internal successors, (3510), 9 states have internal predecessors, (3510), 0 states have call successors, (0), 0 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 16:22:55,009 INFO L175 Difference]: Start difference. First operand has 294 places, 1045 transitions, 20723 flow. Second operand 8 states and 1192 transitions. [2023-11-17 16:22:55,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 904 transitions, 20111 flow [2023-11-17 16:22:57,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 904 transitions, 19233 flow, removed 206 selfloop flow, removed 18 redundant places. [2023-11-17 16:22:57,887 INFO L231 Difference]: Finished difference. Result has 273 places, 578 transitions, 11660 flow [2023-11-17 16:22:57,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=16402, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=850, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=812, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=11660, PETRI_PLACES=273, PETRI_TRANSITIONS=578} [2023-11-17 16:22:57,888 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 248 predicate places. [2023-11-17 16:22:57,888 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 578 transitions, 11660 flow [2023-11-17 16:22:57,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 144.64285714285714) internal successors, (2025), 14 states have internal predecessors, (2025), 0 states have call successors, (0), 0 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 16:22:57,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:57,889 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:22:57,893 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 16:22:58,089 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,SelfDestructingSolverStorable13 [2023-11-17 16:22:58,090 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:22:58,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:58,090 INFO L85 PathProgramCache]: Analyzing trace with hash -968045866, now seen corresponding path program 10 times [2023-11-17 16:22:58,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:58,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635290280] [2023-11-17 16:22:58,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:58,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:22:58,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:58,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635290280] [2023-11-17 16:22:58,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635290280] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:58,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917214951] [2023-11-17 16:22:58,204 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 16:22:58,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:58,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:58,205 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 16:22:58,226 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 16:22:58,325 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 16:22:58,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:22:58,327 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:22:58,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:58,416 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:22:58,417 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:58,476 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:22:58,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917214951] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:22:58,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:22:58,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-11-17 16:22:58,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127232304] [2023-11-17 16:22:58,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:22:58,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-17 16:22:58,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:58,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-17 16:22:58,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2023-11-17 16:22:58,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 390 [2023-11-17 16:22:58,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 578 transitions, 11660 flow. Second operand has 15 states, 15 states have (on average 142.33333333333334) internal successors, (2135), 15 states have internal predecessors, (2135), 0 states have call successors, (0), 0 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 16:22:58,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:58,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 390 [2023-11-17 16:22:58,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:23:00,292 INFO L124 PetriNetUnfolderBase]: 3888/6828 cut-off events. [2023-11-17 16:23:00,292 INFO L125 PetriNetUnfolderBase]: For 257840/257840 co-relation queries the response was YES. [2023-11-17 16:23:00,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68910 conditions, 6828 events. 3888/6828 cut-off events. For 257840/257840 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 44885 event pairs, 433 based on Foata normal form. 166/6994 useless extension candidates. Maximal degree in co-relation 68810. Up to 3638 conditions per place. [2023-11-17 16:23:00,366 INFO L140 encePairwiseOnDemand]: 382/390 looper letters, 453 selfloop transitions, 31 changer transitions 199/684 dead transitions. [2023-11-17 16:23:00,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 684 transitions, 15963 flow [2023-11-17 16:23:00,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 16:23:00,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 16:23:00,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1312 transitions. [2023-11-17 16:23:00,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3737891737891738 [2023-11-17 16:23:00,368 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1312 transitions. [2023-11-17 16:23:00,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1312 transitions. [2023-11-17 16:23:00,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:23:00,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1312 transitions. [2023-11-17 16:23:00,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 145.77777777777777) internal successors, (1312), 9 states have internal predecessors, (1312), 0 states have call successors, (0), 0 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 16:23:00,372 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 390.0) internal successors, (3900), 10 states have internal predecessors, (3900), 0 states have call successors, (0), 0 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 16:23:00,373 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 390.0) internal successors, (3900), 10 states have internal predecessors, (3900), 0 states have call successors, (0), 0 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 16:23:00,373 INFO L175 Difference]: Start difference. First operand has 273 places, 578 transitions, 11660 flow. Second operand 9 states and 1312 transitions. [2023-11-17 16:23:00,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 684 transitions, 15963 flow [2023-11-17 16:23:01,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 684 transitions, 14368 flow, removed 590 selfloop flow, removed 41 redundant places. [2023-11-17 16:23:01,372 INFO L231 Difference]: Finished difference. Result has 182 places, 365 transitions, 6896 flow [2023-11-17 16:23:01,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=390, PETRI_DIFFERENCE_MINUEND_FLOW=8082, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6896, PETRI_PLACES=182, PETRI_TRANSITIONS=365} [2023-11-17 16:23:01,373 INFO L281 CegarLoopForPetriNet]: 25 programPoint places, 157 predicate places. [2023-11-17 16:23:01,373 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 365 transitions, 6896 flow [2023-11-17 16:23:01,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 142.33333333333334) internal successors, (2135), 15 states have internal predecessors, (2135), 0 states have call successors, (0), 0 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 16:23:01,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:23:01,373 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:23:01,382 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 16:23:01,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-17 16:23:01,580 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-17 16:23:01,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:23:01,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1527888969, now seen corresponding path program 11 times [2023-11-17 16:23:01,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:23:01,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215141711] [2023-11-17 16:23:01,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:23:01,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:23:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:23:02,904 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:23:02,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:23:02,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215141711] [2023-11-17 16:23:02,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215141711] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:23:02,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478948314] [2023-11-17 16:23:02,904 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 16:23:02,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:23:02,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:23:02,905 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 16:23:02,907 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 16:23:03,013 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-17 16:23:03,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:23:03,015 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-17 16:23:03,017 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:23:03,756 INFO L349 Elim1Store]: treesize reduction 42, result has 54.8 percent of original size [2023-11-17 16:23:03,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 66 [2023-11-17 16:23:03,795 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-17 16:23:03,795 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:23:06,435 INFO L349 Elim1Store]: treesize reduction 20, result has 98.3 percent of original size [2023-11-17 16:23:06,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 237 treesize of output 1241 [2023-11-17 16:25:14,934 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 16:25:14,934 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 16:25:14,935 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-17 16:25:14,940 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 16:25:15,136 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,SelfDestructingSolverStorable15 [2023-11-17 16:25:15,137 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$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2023-11-17 16:25:15,140 INFO L158 Benchmark]: Toolchain (without parser) took 301541.58ms. Allocated memory was 199.2MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 147.0MB in the beginning and 1.9GB in the end (delta: -1.8GB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. [2023-11-17 16:25:15,140 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 199.2MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 16:25:15,140 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.74ms. Allocated memory is still 199.2MB. Free memory was 147.0MB in the beginning and 134.7MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-11-17 16:25:15,140 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.74ms. Allocated memory is still 199.2MB. Free memory was 134.7MB in the beginning and 132.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 16:25:15,140 INFO L158 Benchmark]: Boogie Preprocessor took 29.81ms. Allocated memory is still 199.2MB. Free memory was 132.6MB in the beginning and 130.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 16:25:15,141 INFO L158 Benchmark]: RCFGBuilder took 596.25ms. Allocated memory was 199.2MB in the beginning and 289.4MB in the end (delta: 90.2MB). Free memory was 130.9MB in the beginning and 256.2MB in the end (delta: -125.3MB). Peak memory consumption was 33.2MB. Max. memory is 8.0GB. [2023-11-17 16:25:15,141 INFO L158 Benchmark]: TraceAbstraction took 300623.87ms. Allocated memory was 289.4MB in the beginning and 3.8GB in the end (delta: 3.5GB). Free memory was 255.6MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. [2023-11-17 16:25:15,142 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 199.2MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 231.74ms. Allocated memory is still 199.2MB. Free memory was 147.0MB in the beginning and 134.7MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.74ms. Allocated memory is still 199.2MB. Free memory was 134.7MB in the beginning and 132.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.81ms. Allocated memory is still 199.2MB. Free memory was 132.6MB in the beginning and 130.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 596.25ms. Allocated memory was 199.2MB in the beginning and 289.4MB in the end (delta: 90.2MB). Free memory was 130.9MB in the beginning and 256.2MB in the end (delta: -125.3MB). Peak memory consumption was 33.2MB. Max. memory is 8.0GB. * TraceAbstraction took 300623.87ms. Allocated memory was 289.4MB in the beginning and 3.8GB in the end (delta: 3.5GB). Free memory was 255.6MB in the beginning and 1.9GB in the end (delta: -1.7GB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.4s, 175 PlacesBefore, 25 PlacesAfterwards, 183 TransitionsBefore, 23 TransitionsAfterwards, 772 CoEnabledTransitionPairs, 7 FixpointIterations, 131 TrivialSequentialCompositions, 20 ConcurrentSequentialCompositions, 30 TrivialYvCompositions, 5 ConcurrentYvCompositions, 10 ChoiceCompositions, 196 TotalNumberOfCompositions, 1117 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 845, independent: 791, independent conditional: 0, independent unconditional: 791, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 530, independent: 514, independent conditional: 0, independent unconditional: 514, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 530, independent: 513, independent conditional: 0, independent unconditional: 513, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 42, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 845, independent: 277, independent conditional: 0, independent unconditional: 277, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 530, unknown conditional: 0, unknown unconditional: 530] , Statistics on independence cache: Total cache size (in pairs): 51, Positive cache size: 42, Positive conditional cache size: 0, Positive unconditional cache size: 42, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, 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...