/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 00:33:21,737 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 00:33:21,801 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-VariableLbe.epf [2023-08-24 00:33:21,804 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 00:33:21,809 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 00:33:21,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 00:33:21,836 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 00:33:21,836 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 00:33:21,837 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 00:33:21,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 00:33:21,840 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 00:33:21,840 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 00:33:21,840 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 00:33:21,841 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 00:33:21,841 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 00:33:21,841 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 00:33:21,842 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 00:33:21,842 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 00:33:21,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 00:33:21,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 00:33:21,842 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 00:33:21,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 00:33:21,843 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 00:33:21,843 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 00:33:21,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 00:33:21,843 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 00:33:21,844 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 00:33:21,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 00:33:21,844 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 00:33:21,844 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 00:33:21,845 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 00:33:21,845 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 00:33:21,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 00:33:21,845 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 00:33:21,845 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 00:33:21,845 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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-08-24 00:33:22,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 00:33:22,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 00:33:22,094 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 00:33:22,095 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 00:33:22,095 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 00:33:22,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2023-08-24 00:33:23,050 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 00:33:23,211 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 00:33:23,211 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2023-08-24 00:33:23,218 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aebc9f03/4b06dc340de3439e9e3695332d65f4ab/FLAG3303d0940 [2023-08-24 00:33:23,229 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7aebc9f03/4b06dc340de3439e9e3695332d65f4ab [2023-08-24 00:33:23,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 00:33:23,234 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 00:33:23,234 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 00:33:23,235 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 00:33:23,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 00:33:23,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 12:33:23" (1/1) ... [2023-08-24 00:33:23,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a7be84d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:33:23, skipping insertion in model container [2023-08-24 00:33:23,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 12:33:23" (1/1) ... [2023-08-24 00:33:23,252 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 00:33:23,381 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c[2237,2250] [2023-08-24 00:33:23,385 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 00:33:23,392 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 00:33:23,422 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c[2237,2250] [2023-08-24 00:33:23,423 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 00:33:23,432 INFO L206 MainTranslator]: Completed translation [2023-08-24 00:33:23,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:33:23 WrapperNode [2023-08-24 00:33:23,432 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 00:33:23,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 00:33:23,435 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 00:33:23,435 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 00:33:23,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:33:23" (1/1) ... [2023-08-24 00:33:23,452 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:33:23" (1/1) ... [2023-08-24 00:33:23,473 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2023-08-24 00:33:23,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 00:33:23,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 00:33:23,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 00:33:23,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 00:33:23,480 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:33:23" (1/1) ... [2023-08-24 00:33:23,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:33:23" (1/1) ... [2023-08-24 00:33:23,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:33:23" (1/1) ... [2023-08-24 00:33:23,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:33:23" (1/1) ... [2023-08-24 00:33:23,496 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:33:23" (1/1) ... [2023-08-24 00:33:23,500 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:33:23" (1/1) ... [2023-08-24 00:33:23,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:33:23" (1/1) ... [2023-08-24 00:33:23,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:33:23" (1/1) ... [2023-08-24 00:33:23,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 00:33:23,508 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 00:33:23,508 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 00:33:23,508 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 00:33:23,509 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:33:23" (1/1) ... [2023-08-24 00:33:23,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 00:33:23,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 00:33:23,531 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-08-24 00:33:23,552 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-08-24 00:33:23,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 00:33:23,559 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 00:33:23,559 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 00:33:23,559 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 00:33:23,560 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 00:33:23,560 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-24 00:33:23,560 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-24 00:33:23,560 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-24 00:33:23,560 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-24 00:33:23,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 00:33:23,561 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 00:33:23,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 00:33:23,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 00:33:23,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 00:33:23,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 00:33:23,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 00:33:23,562 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 00:33:23,631 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 00:33:23,632 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 00:33:23,792 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 00:33:23,797 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 00:33:23,797 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-24 00:33:23,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 12:33:23 BoogieIcfgContainer [2023-08-24 00:33:23,799 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 00:33:23,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 00:33:23,800 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 00:33:23,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 00:33:23,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 12:33:23" (1/3) ... [2023-08-24 00:33:23,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b38772a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 12:33:23, skipping insertion in model container [2023-08-24 00:33:23,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 12:33:23" (2/3) ... [2023-08-24 00:33:23,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b38772a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 12:33:23, skipping insertion in model container [2023-08-24 00:33:23,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 12:33:23" (3/3) ... [2023-08-24 00:33:23,804 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2023-08-24 00:33:23,815 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 00:33:23,815 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 00:33:23,815 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 00:33:23,903 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-24 00:33:23,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 123 transitions, 278 flow [2023-08-24 00:33:23,997 INFO L124 PetriNetUnfolderBase]: 10/119 cut-off events. [2023-08-24 00:33:23,998 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 00:33:24,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 119 events. 10/119 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-08-24 00:33:24,002 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 123 transitions, 278 flow [2023-08-24 00:33:24,006 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 107 transitions, 238 flow [2023-08-24 00:33:24,013 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 00:33:24,023 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 107 transitions, 238 flow [2023-08-24 00:33:24,026 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 107 transitions, 238 flow [2023-08-24 00:33:24,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 107 transitions, 238 flow [2023-08-24 00:33:24,061 INFO L124 PetriNetUnfolderBase]: 10/107 cut-off events. [2023-08-24 00:33:24,061 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 00:33:24,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 107 events. 10/107 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-08-24 00:33:24,064 INFO L119 LiptonReduction]: Number of co-enabled transitions 1224 [2023-08-24 00:33:27,079 INFO L134 LiptonReduction]: Checked pairs total: 1522 [2023-08-24 00:33:27,079 INFO L136 LiptonReduction]: Total number of compositions: 93 [2023-08-24 00:33:27,088 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 00:33:27,092 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=LoopsAndPotentialCycles, 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;@4f62faf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 00:33:27,092 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-24 00:33:27,096 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 00:33:27,096 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2023-08-24 00:33:27,096 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 00:33:27,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:33:27,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:33:27,097 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 00:33:27,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:33:27,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1000817363, now seen corresponding path program 1 times [2023-08-24 00:33:27,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:33:27,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888645923] [2023-08-24 00:33:27,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:33:27,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:33:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:33:27,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:33:27,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:33:27,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888645923] [2023-08-24 00:33:27,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888645923] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 00:33:27,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 00:33:27,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 00:33:27,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888215010] [2023-08-24 00:33:27,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 00:33:27,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 00:33:27,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:33:27,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 00:33:27,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 00:33:27,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 216 [2023-08-24 00:33:27,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:27,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:33:27,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 216 [2023-08-24 00:33:27,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:33:27,615 INFO L124 PetriNetUnfolderBase]: 497/677 cut-off events. [2023-08-24 00:33:27,615 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2023-08-24 00:33:27,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 677 events. 497/677 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1778 event pairs, 117 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 1016. Up to 471 conditions per place. [2023-08-24 00:33:27,619 INFO L140 encePairwiseOnDemand]: 210/216 looper letters, 41 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2023-08-24 00:33:27,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 233 flow [2023-08-24 00:33:27,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 00:33:27,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 00:33:27,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2023-08-24 00:33:27,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2023-08-24 00:33:27,629 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 306 transitions. [2023-08-24 00:33:27,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 306 transitions. [2023-08-24 00:33:27,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:33:27,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 306 transitions. [2023-08-24 00:33:27,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:27,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:27,637 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:27,638 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 74 flow. Second operand 3 states and 306 transitions. [2023-08-24 00:33:27,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 233 flow [2023-08-24 00:33:27,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 47 transitions, 203 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-24 00:33:27,642 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 91 flow [2023-08-24 00:33:27,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=29, PETRI_TRANSITIONS=29} [2023-08-24 00:33:27,645 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2023-08-24 00:33:27,645 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 91 flow [2023-08-24 00:33:27,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:27,645 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:33:27,646 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-08-24 00:33:27,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 00:33:27,646 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 00:33:27,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:33:27,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1019366599, now seen corresponding path program 1 times [2023-08-24 00:33:27,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:33:27,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193782706] [2023-08-24 00:33:27,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:33:27,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:33:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:33:27,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:33:27,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:33:27,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193782706] [2023-08-24 00:33:27,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193782706] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 00:33:27,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 00:33:27,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 00:33:27,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288769817] [2023-08-24 00:33:27,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 00:33:27,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 00:33:27,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:33:27,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 00:33:27,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 00:33:27,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 216 [2023-08-24 00:33:27,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 29 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:27,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:33:27,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 216 [2023-08-24 00:33:27,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:33:27,969 INFO L124 PetriNetUnfolderBase]: 693/951 cut-off events. [2023-08-24 00:33:27,969 INFO L125 PetriNetUnfolderBase]: For 342/342 co-relation queries the response was YES. [2023-08-24 00:33:27,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2416 conditions, 951 events. 693/951 cut-off events. For 342/342 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2792 event pairs, 67 based on Foata normal form. 32/983 useless extension candidates. Maximal degree in co-relation 766. Up to 371 conditions per place. [2023-08-24 00:33:27,975 INFO L140 encePairwiseOnDemand]: 211/216 looper letters, 68 selfloop transitions, 10 changer transitions 0/78 dead transitions. [2023-08-24 00:33:27,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 78 transitions, 387 flow [2023-08-24 00:33:27,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 00:33:27,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 00:33:27,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 522 transitions. [2023-08-24 00:33:27,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2023-08-24 00:33:27,980 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 522 transitions. [2023-08-24 00:33:27,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 522 transitions. [2023-08-24 00:33:27,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:33:27,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 522 transitions. [2023-08-24 00:33:27,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:27,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:27,986 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:27,986 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 91 flow. Second operand 5 states and 522 transitions. [2023-08-24 00:33:27,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 78 transitions, 387 flow [2023-08-24 00:33:27,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 78 transitions, 379 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 00:33:27,988 INFO L231 Difference]: Finished difference. Result has 34 places, 36 transitions, 151 flow [2023-08-24 00:33:27,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=34, PETRI_TRANSITIONS=36} [2023-08-24 00:33:27,989 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2023-08-24 00:33:27,989 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 36 transitions, 151 flow [2023-08-24 00:33:27,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:27,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:33:27,990 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-08-24 00:33:27,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 00:33:27,992 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 00:33:27,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:33:27,993 INFO L85 PathProgramCache]: Analyzing trace with hash 539503439, now seen corresponding path program 1 times [2023-08-24 00:33:27,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:33:27,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915430940] [2023-08-24 00:33:27,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:33:27,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:33:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:33:28,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:33:28,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:33:28,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915430940] [2023-08-24 00:33:28,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915430940] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 00:33:28,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998249632] [2023-08-24 00:33:28,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:33:28,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 00:33:28,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 00:33:28,062 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-08-24 00:33:28,065 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-08-24 00:33:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:33:28,132 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 00:33:28,135 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 00:33:28,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:33:28,223 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 00:33:28,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:33:28,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998249632] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 00:33:28,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 00:33:28,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-24 00:33:28,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811805448] [2023-08-24 00:33:28,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 00:33:28,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 00:33:28,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:33:28,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 00:33:28,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-24 00:33:28,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 216 [2023-08-24 00:33:28,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 36 transitions, 151 flow. Second operand has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:28,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:33:28,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 216 [2023-08-24 00:33:28,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:33:28,501 INFO L124 PetriNetUnfolderBase]: 1309/1809 cut-off events. [2023-08-24 00:33:28,501 INFO L125 PetriNetUnfolderBase]: For 1975/1975 co-relation queries the response was YES. [2023-08-24 00:33:28,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5608 conditions, 1809 events. 1309/1809 cut-off events. For 1975/1975 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6397 event pairs, 291 based on Foata normal form. 68/1877 useless extension candidates. Maximal degree in co-relation 2898. Up to 757 conditions per place. [2023-08-24 00:33:28,508 INFO L140 encePairwiseOnDemand]: 211/216 looper letters, 98 selfloop transitions, 8 changer transitions 0/106 dead transitions. [2023-08-24 00:33:28,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 106 transitions, 641 flow [2023-08-24 00:33:28,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 00:33:28,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 00:33:28,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 532 transitions. [2023-08-24 00:33:28,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4925925925925926 [2023-08-24 00:33:28,509 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 532 transitions. [2023-08-24 00:33:28,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 532 transitions. [2023-08-24 00:33:28,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:33:28,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 532 transitions. [2023-08-24 00:33:28,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:28,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:28,513 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:28,513 INFO L175 Difference]: Start difference. First operand has 34 places, 36 transitions, 151 flow. Second operand 5 states and 532 transitions. [2023-08-24 00:33:28,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 106 transitions, 641 flow [2023-08-24 00:33:28,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 106 transitions, 641 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 00:33:28,518 INFO L231 Difference]: Finished difference. Result has 41 places, 41 transitions, 206 flow [2023-08-24 00:33:28,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=41, PETRI_TRANSITIONS=41} [2023-08-24 00:33:28,519 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2023-08-24 00:33:28,519 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 41 transitions, 206 flow [2023-08-24 00:33:28,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.83333333333333) internal successors, (569), 6 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:28,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:33:28,520 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-08-24 00:33:28,527 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-08-24 00:33:28,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 00:33:28,728 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 00:33:28,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:33:28,728 INFO L85 PathProgramCache]: Analyzing trace with hash -905361945, now seen corresponding path program 2 times [2023-08-24 00:33:28,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:33:28,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582016566] [2023-08-24 00:33:28,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:33:28,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:33:28,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:33:28,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:33:28,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:33:28,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582016566] [2023-08-24 00:33:28,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582016566] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 00:33:28,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 00:33:28,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 00:33:28,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671029009] [2023-08-24 00:33:28,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 00:33:28,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 00:33:28,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:33:28,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 00:33:28,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 00:33:28,815 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 216 [2023-08-24 00:33:28,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 41 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:28,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:33:28,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 216 [2023-08-24 00:33:28,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:33:28,968 INFO L124 PetriNetUnfolderBase]: 1105/1509 cut-off events. [2023-08-24 00:33:28,968 INFO L125 PetriNetUnfolderBase]: For 2593/2593 co-relation queries the response was YES. [2023-08-24 00:33:28,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5565 conditions, 1509 events. 1105/1509 cut-off events. For 2593/2593 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5157 event pairs, 89 based on Foata normal form. 26/1535 useless extension candidates. Maximal degree in co-relation 3052. Up to 620 conditions per place. [2023-08-24 00:33:28,975 INFO L140 encePairwiseOnDemand]: 211/216 looper letters, 94 selfloop transitions, 11 changer transitions 0/105 dead transitions. [2023-08-24 00:33:28,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 105 transitions, 697 flow [2023-08-24 00:33:28,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 00:33:28,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 00:33:28,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 526 transitions. [2023-08-24 00:33:28,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48703703703703705 [2023-08-24 00:33:28,977 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 526 transitions. [2023-08-24 00:33:28,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 526 transitions. [2023-08-24 00:33:28,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:33:28,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 526 transitions. [2023-08-24 00:33:28,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:28,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:28,980 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:28,980 INFO L175 Difference]: Start difference. First operand has 41 places, 41 transitions, 206 flow. Second operand 5 states and 526 transitions. [2023-08-24 00:33:28,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 105 transitions, 697 flow [2023-08-24 00:33:28,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 105 transitions, 697 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 00:33:28,985 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 267 flow [2023-08-24 00:33:28,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=267, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2023-08-24 00:33:28,985 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2023-08-24 00:33:28,986 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 267 flow [2023-08-24 00:33:28,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:28,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:33:28,986 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-08-24 00:33:28,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 00:33:28,986 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 00:33:28,986 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:33:28,987 INFO L85 PathProgramCache]: Analyzing trace with hash -114084107, now seen corresponding path program 1 times [2023-08-24 00:33:28,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:33:28,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875722085] [2023-08-24 00:33:28,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:33:28,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:33:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:33:29,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:33:29,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:33:29,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875722085] [2023-08-24 00:33:29,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875722085] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 00:33:29,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 00:33:29,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 00:33:29,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169925270] [2023-08-24 00:33:29,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 00:33:29,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 00:33:29,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:33:29,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 00:33:29,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 00:33:29,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 216 [2023-08-24 00:33:29,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 267 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:29,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:33:29,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 216 [2023-08-24 00:33:29,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:33:29,221 INFO L124 PetriNetUnfolderBase]: 1063/1467 cut-off events. [2023-08-24 00:33:29,221 INFO L125 PetriNetUnfolderBase]: For 3395/3395 co-relation queries the response was YES. [2023-08-24 00:33:29,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5790 conditions, 1467 events. 1063/1467 cut-off events. For 3395/3395 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5166 event pairs, 83 based on Foata normal form. 42/1509 useless extension candidates. Maximal degree in co-relation 3213. Up to 619 conditions per place. [2023-08-24 00:33:29,229 INFO L140 encePairwiseOnDemand]: 211/216 looper letters, 93 selfloop transitions, 8 changer transitions 2/103 dead transitions. [2023-08-24 00:33:29,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 103 transitions, 710 flow [2023-08-24 00:33:29,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 00:33:29,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 00:33:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 525 transitions. [2023-08-24 00:33:29,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861111111111111 [2023-08-24 00:33:29,231 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 525 transitions. [2023-08-24 00:33:29,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 525 transitions. [2023-08-24 00:33:29,231 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:33:29,231 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 525 transitions. [2023-08-24 00:33:29,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:29,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:29,234 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:29,234 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 267 flow. Second operand 5 states and 525 transitions. [2023-08-24 00:33:29,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 103 transitions, 710 flow [2023-08-24 00:33:29,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 103 transitions, 699 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-24 00:33:29,239 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 270 flow [2023-08-24 00:33:29,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=270, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2023-08-24 00:33:29,240 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2023-08-24 00:33:29,240 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 270 flow [2023-08-24 00:33:29,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:29,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:33:29,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, 1, 1, 1] [2023-08-24 00:33:29,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 00:33:29,241 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 00:33:29,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:33:29,241 INFO L85 PathProgramCache]: Analyzing trace with hash 555709242, now seen corresponding path program 1 times [2023-08-24 00:33:29,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:33:29,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707593223] [2023-08-24 00:33:29,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:33:29,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:33:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:33:29,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:33:29,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:33:29,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707593223] [2023-08-24 00:33:29,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707593223] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 00:33:29,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377368396] [2023-08-24 00:33:29,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:33:29,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 00:33:29,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 00:33:29,373 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-08-24 00:33:29,375 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-08-24 00:33:29,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:33:29,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 00:33:29,445 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 00:33:29,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:33:29,528 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 00:33:29,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:33:29,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377368396] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 00:33:29,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 00:33:29,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-24 00:33:29,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288633517] [2023-08-24 00:33:29,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 00:33:29,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 00:33:29,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:33:29,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 00:33:29,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-24 00:33:29,592 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 216 [2023-08-24 00:33:29,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 270 flow. Second operand has 6 states, 6 states have (on average 95.66666666666667) internal successors, (574), 6 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:29,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:33:29,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 216 [2023-08-24 00:33:29,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:33:29,809 INFO L124 PetriNetUnfolderBase]: 1407/1959 cut-off events. [2023-08-24 00:33:29,810 INFO L125 PetriNetUnfolderBase]: For 4939/4939 co-relation queries the response was YES. [2023-08-24 00:33:29,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8040 conditions, 1959 events. 1407/1959 cut-off events. For 4939/4939 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7090 event pairs, 287 based on Foata normal form. 72/2031 useless extension candidates. Maximal degree in co-relation 4020. Up to 786 conditions per place. [2023-08-24 00:33:29,820 INFO L140 encePairwiseOnDemand]: 211/216 looper letters, 104 selfloop transitions, 10 changer transitions 0/114 dead transitions. [2023-08-24 00:33:29,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 114 transitions, 893 flow [2023-08-24 00:33:29,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 00:33:29,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 00:33:29,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 524 transitions. [2023-08-24 00:33:29,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48518518518518516 [2023-08-24 00:33:29,823 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 524 transitions. [2023-08-24 00:33:29,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 524 transitions. [2023-08-24 00:33:29,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:33:29,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 524 transitions. [2023-08-24 00:33:29,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:29,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:29,825 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:29,825 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 270 flow. Second operand 5 states and 524 transitions. [2023-08-24 00:33:29,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 114 transitions, 893 flow [2023-08-24 00:33:29,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 114 transitions, 860 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-24 00:33:29,830 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 315 flow [2023-08-24 00:33:29,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=315, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2023-08-24 00:33:29,832 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2023-08-24 00:33:29,832 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 315 flow [2023-08-24 00:33:29,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.66666666666667) internal successors, (574), 6 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:29,833 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:33:29,833 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-08-24 00:33:29,840 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-08-24 00:33:30,039 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,SelfDestructingSolverStorable5 [2023-08-24 00:33:30,039 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 00:33:30,040 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:33:30,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1193580880, now seen corresponding path program 2 times [2023-08-24 00:33:30,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:33:30,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156005272] [2023-08-24 00:33:30,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:33:30,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:33:30,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:33:30,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:33:30,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:33:30,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156005272] [2023-08-24 00:33:30,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156005272] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 00:33:30,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 00:33:30,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 00:33:30,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504313946] [2023-08-24 00:33:30,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 00:33:30,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 00:33:30,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:33:30,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 00:33:30,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 00:33:30,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 216 [2023-08-24 00:33:30,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 315 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:30,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:33:30,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 216 [2023-08-24 00:33:30,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:33:30,265 INFO L124 PetriNetUnfolderBase]: 1237/1713 cut-off events. [2023-08-24 00:33:30,265 INFO L125 PetriNetUnfolderBase]: For 4450/4450 co-relation queries the response was YES. [2023-08-24 00:33:30,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7555 conditions, 1713 events. 1237/1713 cut-off events. For 4450/4450 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 6045 event pairs, 65 based on Foata normal form. 34/1747 useless extension candidates. Maximal degree in co-relation 5277. Up to 672 conditions per place. [2023-08-24 00:33:30,277 INFO L140 encePairwiseOnDemand]: 211/216 looper letters, 98 selfloop transitions, 9 changer transitions 4/111 dead transitions. [2023-08-24 00:33:30,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 111 transitions, 875 flow [2023-08-24 00:33:30,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 00:33:30,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 00:33:30,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 521 transitions. [2023-08-24 00:33:30,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4824074074074074 [2023-08-24 00:33:30,279 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 521 transitions. [2023-08-24 00:33:30,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 521 transitions. [2023-08-24 00:33:30,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:33:30,280 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 521 transitions. [2023-08-24 00:33:30,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:30,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:30,282 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:30,282 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 315 flow. Second operand 5 states and 521 transitions. [2023-08-24 00:33:30,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 111 transitions, 875 flow [2023-08-24 00:33:30,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 111 transitions, 866 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-24 00:33:30,289 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 319 flow [2023-08-24 00:33:30,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=319, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2023-08-24 00:33:30,290 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2023-08-24 00:33:30,290 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 319 flow [2023-08-24 00:33:30,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:30,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:33:30,290 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-08-24 00:33:30,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 00:33:30,291 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 00:33:30,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:33:30,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1446487525, now seen corresponding path program 2 times [2023-08-24 00:33:30,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:33:30,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316417744] [2023-08-24 00:33:30,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:33:30,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:33:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:33:30,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:33:30,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:33:30,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316417744] [2023-08-24 00:33:30,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316417744] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 00:33:30,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997768950] [2023-08-24 00:33:30,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 00:33:30,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 00:33:30,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 00:33:30,412 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-08-24 00:33:30,436 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-08-24 00:33:30,499 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 00:33:30,499 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 00:33:30,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 00:33:30,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 00:33:30,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:33:30,576 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 00:33:30,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:33:30,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997768950] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 00:33:30,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 00:33:30,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-24 00:33:30,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238009017] [2023-08-24 00:33:30,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 00:33:30,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 00:33:30,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:33:30,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 00:33:30,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-24 00:33:30,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 216 [2023-08-24 00:33:30,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 319 flow. Second operand has 7 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:30,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:33:30,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 216 [2023-08-24 00:33:30,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:33:30,884 INFO L124 PetriNetUnfolderBase]: 1441/1985 cut-off events. [2023-08-24 00:33:30,885 INFO L125 PetriNetUnfolderBase]: For 5224/5224 co-relation queries the response was YES. [2023-08-24 00:33:30,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9185 conditions, 1985 events. 1441/1985 cut-off events. For 5224/5224 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7183 event pairs, 129 based on Foata normal form. 68/2053 useless extension candidates. Maximal degree in co-relation 5914. Up to 1119 conditions per place. [2023-08-24 00:33:30,895 INFO L140 encePairwiseOnDemand]: 209/216 looper letters, 114 selfloop transitions, 10 changer transitions 3/127 dead transitions. [2023-08-24 00:33:30,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 127 transitions, 994 flow [2023-08-24 00:33:30,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 00:33:30,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 00:33:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 594 transitions. [2023-08-24 00:33:30,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2023-08-24 00:33:30,897 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 594 transitions. [2023-08-24 00:33:30,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 594 transitions. [2023-08-24 00:33:30,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:33:30,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 594 transitions. [2023-08-24 00:33:30,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.0) internal successors, (594), 6 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:30,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:30,899 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 216.0) internal successors, (1512), 7 states have internal predecessors, (1512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:30,899 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 319 flow. Second operand 6 states and 594 transitions. [2023-08-24 00:33:30,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 127 transitions, 994 flow [2023-08-24 00:33:30,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 127 transitions, 985 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 00:33:30,905 INFO L231 Difference]: Finished difference. Result has 65 places, 50 transitions, 370 flow [2023-08-24 00:33:30,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=370, PETRI_PLACES=65, PETRI_TRANSITIONS=50} [2023-08-24 00:33:30,905 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2023-08-24 00:33:30,906 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 50 transitions, 370 flow [2023-08-24 00:33:30,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:30,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:33:30,906 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-08-24 00:33:30,914 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-08-24 00:33:31,112 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-08-24 00:33:31,113 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 00:33:31,113 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:33:31,113 INFO L85 PathProgramCache]: Analyzing trace with hash -2141398155, now seen corresponding path program 2 times [2023-08-24 00:33:31,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:33:31,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668020099] [2023-08-24 00:33:31,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:33:31,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:33:31,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:33:31,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:33:31,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:33:31,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668020099] [2023-08-24 00:33:31,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668020099] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 00:33:31,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 00:33:31,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 00:33:31,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400016064] [2023-08-24 00:33:31,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 00:33:31,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 00:33:31,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:33:31,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 00:33:31,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 00:33:31,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 216 [2023-08-24 00:33:31,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 50 transitions, 370 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:31,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:33:31,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 216 [2023-08-24 00:33:31,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:33:31,378 INFO L124 PetriNetUnfolderBase]: 1657/2269 cut-off events. [2023-08-24 00:33:31,378 INFO L125 PetriNetUnfolderBase]: For 8538/8538 co-relation queries the response was YES. [2023-08-24 00:33:31,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11206 conditions, 2269 events. 1657/2269 cut-off events. For 8538/8538 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8107 event pairs, 481 based on Foata normal form. 68/2337 useless extension candidates. Maximal degree in co-relation 9738. Up to 1331 conditions per place. [2023-08-24 00:33:31,390 INFO L140 encePairwiseOnDemand]: 211/216 looper letters, 117 selfloop transitions, 8 changer transitions 0/125 dead transitions. [2023-08-24 00:33:31,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 125 transitions, 1158 flow [2023-08-24 00:33:31,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 00:33:31,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 00:33:31,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 522 transitions. [2023-08-24 00:33:31,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2023-08-24 00:33:31,392 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 522 transitions. [2023-08-24 00:33:31,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 522 transitions. [2023-08-24 00:33:31,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:33:31,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 522 transitions. [2023-08-24 00:33:31,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:31,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:31,395 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 216.0) internal successors, (1296), 6 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:31,395 INFO L175 Difference]: Start difference. First operand has 65 places, 50 transitions, 370 flow. Second operand 5 states and 522 transitions. [2023-08-24 00:33:31,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 125 transitions, 1158 flow [2023-08-24 00:33:31,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 125 transitions, 1105 flow, removed 24 selfloop flow, removed 1 redundant places. [2023-08-24 00:33:31,404 INFO L231 Difference]: Finished difference. Result has 70 places, 53 transitions, 404 flow [2023-08-24 00:33:31,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=404, PETRI_PLACES=70, PETRI_TRANSITIONS=53} [2023-08-24 00:33:31,405 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 36 predicate places. [2023-08-24 00:33:31,405 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 53 transitions, 404 flow [2023-08-24 00:33:31,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:31,405 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:33:31,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:33:31,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 00:33:31,406 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 00:33:31,406 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:33:31,406 INFO L85 PathProgramCache]: Analyzing trace with hash -567521946, now seen corresponding path program 1 times [2023-08-24 00:33:31,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:33:31,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651398997] [2023-08-24 00:33:31,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:33:31,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:33:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:33:31,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:33:31,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:33:31,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651398997] [2023-08-24 00:33:31,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651398997] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 00:33:31,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742981316] [2023-08-24 00:33:31,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:33:31,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 00:33:31,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 00:33:31,753 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-08-24 00:33:31,755 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-08-24 00:33:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:33:32,070 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-24 00:33:32,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 00:33:35,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:33:35,411 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 00:33:37,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:33:37,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742981316] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 00:33:37,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 00:33:37,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2023-08-24 00:33:37,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528151030] [2023-08-24 00:33:37,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 00:33:37,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-24 00:33:37,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:33:37,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-24 00:33:37,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2023-08-24 00:33:37,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 216 [2023-08-24 00:33:37,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 53 transitions, 404 flow. Second operand has 14 states, 14 states have (on average 88.42857142857143) internal successors, (1238), 14 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:33:37,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:33:37,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 216 [2023-08-24 00:33:37,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:33:41,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:33:43,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:33:46,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:33:50,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:33:52,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:33:55,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:33:56,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:34:00,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:34:02,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:34:04,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:34:07,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:34:09,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:34:11,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:34:14,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:34:16,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:34:18,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:34:20,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:34:25,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:34:26,266 INFO L124 PetriNetUnfolderBase]: 2979/4106 cut-off events. [2023-08-24 00:34:26,266 INFO L125 PetriNetUnfolderBase]: For 14804/14804 co-relation queries the response was YES. [2023-08-24 00:34:26,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21391 conditions, 4106 events. 2979/4106 cut-off events. For 14804/14804 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 16874 event pairs, 347 based on Foata normal form. 3/4109 useless extension candidates. Maximal degree in co-relation 19139. Up to 2337 conditions per place. [2023-08-24 00:34:26,287 INFO L140 encePairwiseOnDemand]: 208/216 looper letters, 206 selfloop transitions, 93 changer transitions 10/309 dead transitions. [2023-08-24 00:34:26,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 309 transitions, 2693 flow [2023-08-24 00:34:26,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-24 00:34:26,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-24 00:34:26,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1476 transitions. [2023-08-24 00:34:26,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45555555555555555 [2023-08-24 00:34:26,291 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1476 transitions. [2023-08-24 00:34:26,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1476 transitions. [2023-08-24 00:34:26,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:34:26,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1476 transitions. [2023-08-24 00:34:26,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 98.4) internal successors, (1476), 15 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:34:26,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 216.0) internal successors, (3456), 16 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:34:26,297 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 216.0) internal successors, (3456), 16 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:34:26,297 INFO L175 Difference]: Start difference. First operand has 70 places, 53 transitions, 404 flow. Second operand 15 states and 1476 transitions. [2023-08-24 00:34:26,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 309 transitions, 2693 flow [2023-08-24 00:34:26,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 309 transitions, 2535 flow, removed 56 selfloop flow, removed 2 redundant places. [2023-08-24 00:34:26,323 INFO L231 Difference]: Finished difference. Result has 89 places, 145 transitions, 1477 flow [2023-08-24 00:34:26,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1477, PETRI_PLACES=89, PETRI_TRANSITIONS=145} [2023-08-24 00:34:26,324 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 55 predicate places. [2023-08-24 00:34:26,324 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 145 transitions, 1477 flow [2023-08-24 00:34:26,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 88.42857142857143) internal successors, (1238), 14 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:34:26,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:34:26,325 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:34:26,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-24 00:34:26,530 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-08-24 00:34:26,530 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 00:34:26,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:34:26,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1310504207, now seen corresponding path program 1 times [2023-08-24 00:34:26,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:34:26,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95125770] [2023-08-24 00:34:26,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:34:26,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:34:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:34:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:34:26,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:34:26,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95125770] [2023-08-24 00:34:26,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95125770] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 00:34:26,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816277183] [2023-08-24 00:34:26,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:34:26,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 00:34:26,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 00:34:26,884 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-08-24 00:34:26,885 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-08-24 00:34:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:34:27,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-24 00:34:27,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 00:34:53,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:34:53,132 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 00:35:02,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:35:02,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816277183] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 00:35:02,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 00:35:02,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2023-08-24 00:35:02,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809793834] [2023-08-24 00:35:02,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 00:35:02,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-24 00:35:02,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:35:02,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-24 00:35:02,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=211, Unknown=11, NotChecked=0, Total=306 [2023-08-24 00:35:02,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 216 [2023-08-24 00:35:02,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 145 transitions, 1477 flow. Second operand has 18 states, 18 states have (on average 87.38888888888889) internal successors, (1573), 18 states have internal predecessors, (1573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:35:02,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:35:02,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 216 [2023-08-24 00:35:02,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:35:26,826 WARN L234 SmtUtils]: Spent 16.90s on a formula simplification. DAG size of input: 81 DAG size of output: 65 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 00:35:38,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:35:39,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:35:41,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:35:44,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:35:48,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:35:50,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:35:52,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:35:54,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:36:06,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:36:08,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:36:21,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:36:23,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:36:25,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:36:28,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:36:30,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:36:32,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:36:35,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:36:36,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:36:40,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:36:43,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:36:47,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:36:49,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:36:52,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:36:55,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:36:56,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:36:58,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:36:59,730 INFO L124 PetriNetUnfolderBase]: 5869/8298 cut-off events. [2023-08-24 00:36:59,730 INFO L125 PetriNetUnfolderBase]: For 47879/47879 co-relation queries the response was YES. [2023-08-24 00:36:59,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46366 conditions, 8298 events. 5869/8298 cut-off events. For 47879/47879 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 41555 event pairs, 145 based on Foata normal form. 17/8315 useless extension candidates. Maximal degree in co-relation 44430. Up to 4699 conditions per place. [2023-08-24 00:36:59,834 INFO L140 encePairwiseOnDemand]: 206/216 looper letters, 363 selfloop transitions, 163 changer transitions 45/571 dead transitions. [2023-08-24 00:36:59,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 571 transitions, 5593 flow [2023-08-24 00:36:59,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-24 00:36:59,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-24 00:36:59,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2079 transitions. [2023-08-24 00:36:59,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2023-08-24 00:36:59,838 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 2079 transitions. [2023-08-24 00:36:59,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 2079 transitions. [2023-08-24 00:36:59,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:36:59,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2079 transitions. [2023-08-24 00:36:59,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 99.0) internal successors, (2079), 21 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:36:59,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 216.0) internal successors, (4752), 22 states have internal predecessors, (4752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:36:59,847 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 216.0) internal successors, (4752), 22 states have internal predecessors, (4752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:36:59,847 INFO L175 Difference]: Start difference. First operand has 89 places, 145 transitions, 1477 flow. Second operand 21 states and 2079 transitions. [2023-08-24 00:36:59,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 571 transitions, 5593 flow [2023-08-24 00:36:59,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 571 transitions, 5144 flow, removed 221 selfloop flow, removed 1 redundant places. [2023-08-24 00:36:59,960 INFO L231 Difference]: Finished difference. Result has 120 places, 308 transitions, 3459 flow [2023-08-24 00:36:59,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=1206, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3459, PETRI_PLACES=120, PETRI_TRANSITIONS=308} [2023-08-24 00:36:59,960 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 86 predicate places. [2023-08-24 00:36:59,960 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 308 transitions, 3459 flow [2023-08-24 00:36:59,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 87.38888888888889) internal successors, (1573), 18 states have internal predecessors, (1573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:36:59,961 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:36:59,961 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:36:59,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-24 00:37:00,167 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-08-24 00:37:00,168 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 00:37:00,168 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:37:00,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1071057526, now seen corresponding path program 2 times [2023-08-24 00:37:00,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:37:00,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224725039] [2023-08-24 00:37:00,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:37:00,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:37:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:37:00,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:37:00,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:37:00,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224725039] [2023-08-24 00:37:00,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224725039] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 00:37:00,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923786876] [2023-08-24 00:37:00,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 00:37:00,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 00:37:00,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 00:37:00,519 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-08-24 00:37:00,520 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-08-24 00:37:01,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 00:37:01,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 00:37:01,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-24 00:37:01,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 00:37:04,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:37:04,602 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 00:37:07,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:37:07,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923786876] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 00:37:07,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 00:37:07,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-08-24 00:37:07,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111270208] [2023-08-24 00:37:07,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 00:37:07,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-24 00:37:07,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:37:07,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-24 00:37:07,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2023-08-24 00:37:07,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 216 [2023-08-24 00:37:07,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 308 transitions, 3459 flow. Second operand has 15 states, 15 states have (on average 87.33333333333333) internal successors, (1310), 15 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:37:07,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:37:07,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 216 [2023-08-24 00:37:07,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:37:09,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:14,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:15,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:17,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:19,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:25,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:32,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:35,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:35,254 INFO L124 PetriNetUnfolderBase]: 8136/11545 cut-off events. [2023-08-24 00:37:35,255 INFO L125 PetriNetUnfolderBase]: For 97257/97257 co-relation queries the response was YES. [2023-08-24 00:37:35,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71568 conditions, 11545 events. 8136/11545 cut-off events. For 97257/97257 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 60550 event pairs, 685 based on Foata normal form. 56/11601 useless extension candidates. Maximal degree in co-relation 71283. Up to 8165 conditions per place. [2023-08-24 00:37:35,318 INFO L140 encePairwiseOnDemand]: 208/216 looper letters, 468 selfloop transitions, 168 changer transitions 15/651 dead transitions. [2023-08-24 00:37:35,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 651 transitions, 7744 flow [2023-08-24 00:37:35,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-24 00:37:35,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-24 00:37:35,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1589 transitions. [2023-08-24 00:37:35,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4597800925925926 [2023-08-24 00:37:35,322 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1589 transitions. [2023-08-24 00:37:35,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1589 transitions. [2023-08-24 00:37:35,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:37:35,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1589 transitions. [2023-08-24 00:37:35,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 99.3125) internal successors, (1589), 16 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:37:35,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 216.0) internal successors, (3672), 17 states have internal predecessors, (3672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:37:35,329 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 216.0) internal successors, (3672), 17 states have internal predecessors, (3672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:37:35,329 INFO L175 Difference]: Start difference. First operand has 120 places, 308 transitions, 3459 flow. Second operand 16 states and 1589 transitions. [2023-08-24 00:37:35,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 651 transitions, 7744 flow [2023-08-24 00:37:35,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 651 transitions, 7285 flow, removed 225 selfloop flow, removed 3 redundant places. [2023-08-24 00:37:35,586 INFO L231 Difference]: Finished difference. Result has 138 places, 450 transitions, 5472 flow [2023-08-24 00:37:35,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=3074, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5472, PETRI_PLACES=138, PETRI_TRANSITIONS=450} [2023-08-24 00:37:35,587 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 104 predicate places. [2023-08-24 00:37:35,587 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 450 transitions, 5472 flow [2023-08-24 00:37:35,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 87.33333333333333) internal successors, (1310), 15 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:37:35,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:37:35,587 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:37:35,594 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-08-24 00:37:35,787 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-08-24 00:37:35,788 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 00:37:35,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:37:35,788 INFO L85 PathProgramCache]: Analyzing trace with hash 828655483, now seen corresponding path program 2 times [2023-08-24 00:37:35,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:37:35,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665031736] [2023-08-24 00:37:35,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:37:35,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:37:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:37:36,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:37:36,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:37:36,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665031736] [2023-08-24 00:37:36,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665031736] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 00:37:36,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22481674] [2023-08-24 00:37:36,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 00:37:36,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 00:37:36,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 00:37:36,146 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-08-24 00:37:36,148 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-08-24 00:37:36,427 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 00:37:36,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 00:37:36,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-24 00:37:36,430 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 00:37:48,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:37:48,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 00:37:49,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:37:49,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22481674] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 00:37:49,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 00:37:49,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-08-24 00:37:49,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639656926] [2023-08-24 00:37:49,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 00:37:49,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-24 00:37:49,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:37:49,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-24 00:37:49,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=157, Unknown=2, NotChecked=0, Total=240 [2023-08-24 00:37:49,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 216 [2023-08-24 00:37:49,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 450 transitions, 5472 flow. Second operand has 16 states, 16 states have (on average 87.8125) internal successors, (1405), 16 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:37:49,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:37:49,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 216 [2023-08-24 00:37:49,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:37:56,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:37:58,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:38:00,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:38:02,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:38:04,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:38:06,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:38:08,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:38:10,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:38:13,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:38:19,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:38:21,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:38:24,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:38:26,403 INFO L124 PetriNetUnfolderBase]: 9434/13397 cut-off events. [2023-08-24 00:38:26,403 INFO L125 PetriNetUnfolderBase]: For 142377/142377 co-relation queries the response was YES. [2023-08-24 00:38:26,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88142 conditions, 13397 events. 9434/13397 cut-off events. For 142377/142377 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 72125 event pairs, 977 based on Foata normal form. 38/13435 useless extension candidates. Maximal degree in co-relation 86149. Up to 11546 conditions per place. [2023-08-24 00:38:26,485 INFO L140 encePairwiseOnDemand]: 208/216 looper letters, 595 selfloop transitions, 110 changer transitions 15/720 dead transitions. [2023-08-24 00:38:26,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 720 transitions, 9107 flow [2023-08-24 00:38:26,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-24 00:38:26,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-24 00:38:26,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1495 transitions. [2023-08-24 00:38:26,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46141975308641975 [2023-08-24 00:38:26,488 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1495 transitions. [2023-08-24 00:38:26,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1495 transitions. [2023-08-24 00:38:26,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:38:26,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1495 transitions. [2023-08-24 00:38:26,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 99.66666666666667) internal successors, (1495), 15 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:38:26,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 216.0) internal successors, (3456), 16 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:38:26,495 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 216.0) internal successors, (3456), 16 states have internal predecessors, (3456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:38:26,495 INFO L175 Difference]: Start difference. First operand has 138 places, 450 transitions, 5472 flow. Second operand 15 states and 1495 transitions. [2023-08-24 00:38:26,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 720 transitions, 9107 flow [2023-08-24 00:38:27,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 720 transitions, 8534 flow, removed 283 selfloop flow, removed 1 redundant places. [2023-08-24 00:38:27,023 INFO L231 Difference]: Finished difference. Result has 158 places, 539 transitions, 6592 flow [2023-08-24 00:38:27,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=4927, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=6592, PETRI_PLACES=158, PETRI_TRANSITIONS=539} [2023-08-24 00:38:27,023 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 124 predicate places. [2023-08-24 00:38:27,023 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 539 transitions, 6592 flow [2023-08-24 00:38:27,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 87.8125) internal successors, (1405), 16 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:38:27,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:38:27,024 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:38:27,031 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-08-24 00:38:27,228 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-08-24 00:38:27,229 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 00:38:27,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:38:27,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1234127592, now seen corresponding path program 3 times [2023-08-24 00:38:27,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:38:27,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351632565] [2023-08-24 00:38:27,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:38:27,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:38:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:38:27,434 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:38:27,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:38:27,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351632565] [2023-08-24 00:38:27,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351632565] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 00:38:27,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922029654] [2023-08-24 00:38:27,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 00:38:27,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 00:38:27,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 00:38:27,437 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-08-24 00:38:27,439 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-08-24 00:38:28,297 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 00:38:28,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 00:38:28,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-24 00:38:28,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 00:39:16,197 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x1~0 4294967296)) (.cse2 (div c_~x4~0 2)) (.cse1 (mod (* 4294967295 (div (* (- 1) c_~x3~0) 2)) 4294967296)) (.cse3 (mod c_~n~0 4294967296))) (and (< 0 .cse0) (= .cse1 (mod (* 4294967295 (div (* (- 1) .cse2) 2)) 4294967296)) (= .cse0 (mod c_~x2~0 4294967296)) (= (mod .cse2 2) 0) (<= .cse3 (mod c_~x3~0 4294967296)) (< (mod .cse2 4294967296) .cse3) (< .cse1 .cse3) (= (mod c_~x4~0 2) 0) (= (mod c_~x3~0 2) 0))) is different from false [2023-08-24 00:39:50,474 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (div c_~x4~0 2))) (let ((.cse0 (mod c_~x1~0 4294967296)) (.cse3 (+ (mod .cse2 4294967296) 1)) (.cse1 (mod (* 4294967295 (div (* (- 1) c_~x3~0) 2)) 4294967296)) (.cse4 (mod c_~x4~0 4294967296))) (and (< 0 .cse0) (= .cse1 (mod (* 4294967295 (div (* (- 1) .cse2) 2)) 4294967296)) (= .cse0 (mod c_~x2~0 4294967296)) (= (mod .cse2 2) 0) (<= .cse3 (mod c_~x3~0 4294967296)) (<= .cse3 .cse4) (<= (+ .cse1 1) .cse4) (= (mod c_~x4~0 2) 0) (= (mod c_~x3~0 2) 0)))) is different from false [2023-08-24 00:41:27,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-24 00:41:27,901 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 00:41:57,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:41:57,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922029654] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 00:41:57,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 00:41:57,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2023-08-24 00:41:57,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548695197] [2023-08-24 00:41:57,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 00:41:57,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-24 00:41:57,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:41:57,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-24 00:41:57,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=200, Unknown=24, NotChecked=62, Total=342 [2023-08-24 00:41:57,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 216 [2023-08-24 00:41:57,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 539 transitions, 6592 flow. Second operand has 19 states, 19 states have (on average 87.78947368421052) internal successors, (1668), 19 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:41:57,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:41:57,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 216 [2023-08-24 00:41:57,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:42:00,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:42:02,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:43:23,742 WARN L234 SmtUtils]: Spent 1.32m on a formula simplification. DAG size of input: 72 DAG size of output: 51 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 00:43:33,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:43:35,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:43:36,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:43:38,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:43:56,291 WARN L234 SmtUtils]: Spent 15.01s on a formula simplification. DAG size of input: 81 DAG size of output: 39 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 00:43:58,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:00,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:02,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:04,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:06,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:07,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:09,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:11,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:14,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:15,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:17,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:19,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:21,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:26,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:31,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:32,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:34,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:36,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:45,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:47,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:52,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:54,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:56,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:44:58,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:45:00,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:45:02,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:45:04,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:45:07,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:45:09,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:45:22,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:45:24,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:45:29,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:45:32,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:45:36,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:45:39,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 00:45:44,240 INFO L124 PetriNetUnfolderBase]: 11457/16270 cut-off events. [2023-08-24 00:45:44,240 INFO L125 PetriNetUnfolderBase]: For 187133/187133 co-relation queries the response was YES. [2023-08-24 00:45:44,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108192 conditions, 16270 events. 11457/16270 cut-off events. For 187133/187133 co-relation queries the response was YES. Maximal size of possible extension queue 666. Compared 90596 event pairs, 445 based on Foata normal form. 228/16498 useless extension candidates. Maximal degree in co-relation 106852. Up to 4795 conditions per place. [2023-08-24 00:45:44,344 INFO L140 encePairwiseOnDemand]: 208/216 looper letters, 809 selfloop transitions, 309 changer transitions 48/1166 dead transitions. [2023-08-24 00:45:44,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 1166 transitions, 15439 flow [2023-08-24 00:45:44,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-24 00:45:44,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-24 00:45:44,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1975 transitions. [2023-08-24 00:45:44,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45717592592592593 [2023-08-24 00:45:44,360 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1975 transitions. [2023-08-24 00:45:44,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1975 transitions. [2023-08-24 00:45:44,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 00:45:44,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1975 transitions. [2023-08-24 00:45:44,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 98.75) internal successors, (1975), 20 states have internal predecessors, (1975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:45:44,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 216.0) internal successors, (4536), 21 states have internal predecessors, (4536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:45:44,398 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 216.0) internal successors, (4536), 21 states have internal predecessors, (4536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:45:44,398 INFO L175 Difference]: Start difference. First operand has 158 places, 539 transitions, 6592 flow. Second operand 20 states and 1975 transitions. [2023-08-24 00:45:44,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 1166 transitions, 15439 flow [2023-08-24 00:45:44,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 1166 transitions, 14632 flow, removed 393 selfloop flow, removed 2 redundant places. [2023-08-24 00:45:44,950 INFO L231 Difference]: Finished difference. Result has 183 places, 667 transitions, 9080 flow [2023-08-24 00:45:44,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=6021, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=9080, PETRI_PLACES=183, PETRI_TRANSITIONS=667} [2023-08-24 00:45:44,951 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 149 predicate places. [2023-08-24 00:45:44,951 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 667 transitions, 9080 flow [2023-08-24 00:45:44,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 87.78947368421052) internal successors, (1668), 19 states have internal predecessors, (1668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:45:44,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 00:45:44,952 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 00:45:44,957 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-08-24 00:45:45,152 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-08-24 00:45:45,152 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 00:45:45,153 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 00:45:45,153 INFO L85 PathProgramCache]: Analyzing trace with hash 416423576, now seen corresponding path program 4 times [2023-08-24 00:45:45,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 00:45:45,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158989801] [2023-08-24 00:45:45,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 00:45:45,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 00:45:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 00:45:45,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:45:45,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 00:45:45,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158989801] [2023-08-24 00:45:45,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158989801] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 00:45:45,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202277255] [2023-08-24 00:45:45,350 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 00:45:45,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 00:45:45,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 00:45:45,351 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-08-24 00:45:45,353 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-08-24 00:45:45,632 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 00:45:45,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 00:45:45,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-24 00:45:45,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 00:46:20,488 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (* (- 1) c_~x4~0))) (let ((.cse0 (mod c_~x1~0 4294967296)) (.cse1 (mod (div c_~x3~0 2) 4294967296)) (.cse3 (mod c_~n~0 4294967296)) (.cse4 (div .cse2 2))) (and (< 0 .cse0) (= .cse0 (mod c_~x2~0 4294967296)) (= .cse1 (mod (* 4294967295 (div .cse2 4)) 4294967296)) (<= .cse3 (mod c_~x3~0 4294967296)) (< .cse1 .cse3) (< (mod (* .cse4 4294967295) 4294967296) .cse3) (= (mod c_~x4~0 2) 0) (= (mod c_~x3~0 2) 0) (= (mod .cse4 2) 0)))) is different from false [2023-08-24 00:46:35,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:46:35,958 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 00:46:55,975 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 00:46:55,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202277255] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 00:46:55,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 00:46:55,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2023-08-24 00:46:55,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664577578] [2023-08-24 00:46:55,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 00:46:55,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-24 00:46:55,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 00:46:55,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-24 00:46:55,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=175, Unknown=13, NotChecked=28, Total=272 [2023-08-24 00:46:55,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 216 [2023-08-24 00:46:55,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 667 transitions, 9080 flow. Second operand has 17 states, 17 states have (on average 88.11764705882354) internal successors, (1498), 17 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 00:46:55,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 00:46:55,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 216 [2023-08-24 00:46:55,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 00:46:59,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:47:10,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:47:15,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:47:18,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 00:47:26,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-08-24 00:48:01,172 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 00:48:01,172 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 00:48:02,182 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-08-24 00:48:02,373 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-24 00:48:02,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-08-24 00:48:02,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-24 00:48:02,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-24 00:48:02,380 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:167) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:376) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:482) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfoldingHelper(PetriNetUnfolderBase.java:226) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfolding(PetriNetUnfolderBase.java:183) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.(PetriNetUnfolderBase.java:123) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:72) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:128) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:481) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) 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) [2023-08-24 00:48:02,382 INFO L158 Benchmark]: Toolchain (without parser) took 879148.52ms. Allocated memory was 375.4MB in the beginning and 608.2MB in the end (delta: 232.8MB). Free memory was 351.1MB in the beginning and 327.4MB in the end (delta: 23.8MB). Peak memory consumption was 256.4MB. Max. memory is 16.0GB. [2023-08-24 00:48:02,382 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 375.4MB. Free memory was 353.3MB in the beginning and 353.2MB in the end (delta: 91.6kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 00:48:02,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.73ms. Allocated memory is still 375.4MB. Free memory was 351.1MB in the beginning and 339.7MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-24 00:48:02,383 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.57ms. Allocated memory is still 375.4MB. Free memory was 339.7MB in the beginning and 338.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 00:48:02,383 INFO L158 Benchmark]: Boogie Preprocessor took 33.23ms. Allocated memory is still 375.4MB. Free memory was 338.3MB in the beginning and 336.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 00:48:02,383 INFO L158 Benchmark]: RCFGBuilder took 290.71ms. Allocated memory is still 375.4MB. Free memory was 336.4MB in the beginning and 321.5MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-08-24 00:48:02,383 INFO L158 Benchmark]: TraceAbstraction took 878582.04ms. Allocated memory was 375.4MB in the beginning and 608.2MB in the end (delta: 232.8MB). Free memory was 320.9MB in the beginning and 327.4MB in the end (delta: -6.5MB). Peak memory consumption was 224.9MB. Max. memory is 16.0GB. [2023-08-24 00:48:02,386 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.09ms. Allocated memory is still 375.4MB. Free memory was 353.3MB in the beginning and 353.2MB in the end (delta: 91.6kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 197.73ms. Allocated memory is still 375.4MB. Free memory was 351.1MB in the beginning and 339.7MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 38.57ms. Allocated memory is still 375.4MB. Free memory was 339.7MB in the beginning and 338.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 33.23ms. Allocated memory is still 375.4MB. Free memory was 338.3MB in the beginning and 336.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 290.71ms. Allocated memory is still 375.4MB. Free memory was 336.4MB in the beginning and 321.5MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * TraceAbstraction took 878582.04ms. Allocated memory was 375.4MB in the beginning and 608.2MB in the end (delta: 232.8MB). Free memory was 320.9MB in the beginning and 327.4MB in the end (delta: -6.5MB). Peak memory consumption was 224.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 110 PlacesBefore, 34 PlacesAfterwards, 107 TransitionsBefore, 25 TransitionsAfterwards, 1224 CoEnabledTransitionPairs, 7 FixpointIterations, 49 TrivialSequentialCompositions, 25 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 8 ConcurrentYvCompositions, 6 ChoiceCompositions, 93 TotalNumberOfCompositions, 1522 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1522, independent: 1522, independent conditional: 0, independent unconditional: 1522, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 655, independent: 655, independent conditional: 0, independent unconditional: 655, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1522, independent: 867, independent conditional: 0, independent unconditional: 867, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 655, unknown conditional: 0, unknown unconditional: 655] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown