/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 --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 15:13:41,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 15:13:41,429 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 15:13:41,433 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 15:13:41,433 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 15:13:41,450 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 15:13:41,450 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 15:13:41,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 15:13:41,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 15:13:41,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 15:13:41,451 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 15:13:41,452 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 15:13:41,452 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 15:13:41,452 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 15:13:41,452 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 15:13:41,453 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 15:13:41,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 15:13:41,453 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 15:13:41,453 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 15:13:41,454 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 15:13:41,454 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 15:13:41,456 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 15:13:41,456 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 15:13:41,457 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 15:13:41,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 15:13:41,457 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 15:13:41,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 15:13:41,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 15:13:41,458 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 15:13:41,458 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 15:13:41,458 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 15:13:41,458 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 15:13:41,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 15:13:41,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 15:13:41,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 15:13:41,459 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-24 15:13:41,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 15:13:41,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 15:13:41,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 15:13:41,731 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 15:13:41,732 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 15:13:41,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2023-08-24 15:13:42,733 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 15:13:42,942 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 15:13:42,943 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2023-08-24 15:13:42,950 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a9016f0f/4f609a75f8484165a7327e039435142e/FLAGe76c202ba [2023-08-24 15:13:42,961 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a9016f0f/4f609a75f8484165a7327e039435142e [2023-08-24 15:13:42,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 15:13:42,964 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 15:13:42,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 15:13:42,964 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 15:13:42,966 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 15:13:42,967 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 03:13:42" (1/1) ... [2023-08-24 15:13:42,967 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408d7ebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:13:42, skipping insertion in model container [2023-08-24 15:13:42,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 03:13:42" (1/1) ... [2023-08-24 15:13:42,987 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 15:13:43,092 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c[3019,3032] [2023-08-24 15:13:43,095 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 15:13:43,101 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 15:13:43,117 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c[3019,3032] [2023-08-24 15:13:43,119 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 15:13:43,124 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 15:13:43,125 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 15:13:43,129 INFO L206 MainTranslator]: Completed translation [2023-08-24 15:13:43,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:13:43 WrapperNode [2023-08-24 15:13:43,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 15:13:43,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 15:13:43,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 15:13:43,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 15:13:43,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:13:43" (1/1) ... [2023-08-24 15:13:43,141 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:13:43" (1/1) ... [2023-08-24 15:13:43,167 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2023-08-24 15:13:43,168 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 15:13:43,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 15:13:43,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 15:13:43,168 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 15:13:43,174 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:13:43" (1/1) ... [2023-08-24 15:13:43,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:13:43" (1/1) ... [2023-08-24 15:13:43,189 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:13:43" (1/1) ... [2023-08-24 15:13:43,189 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:13:43" (1/1) ... [2023-08-24 15:13:43,199 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:13:43" (1/1) ... [2023-08-24 15:13:43,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:13:43" (1/1) ... [2023-08-24 15:13:43,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:13:43" (1/1) ... [2023-08-24 15:13:43,204 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:13:43" (1/1) ... [2023-08-24 15:13:43,205 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 15:13:43,206 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 15:13:43,206 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 15:13:43,206 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 15:13:43,207 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:13:43" (1/1) ... [2023-08-24 15:13:43,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 15:13:43,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:13:43,262 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 15:13:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 15:13:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 15:13:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 15:13:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 15:13:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 15:13:43,303 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 15:13:43,303 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 15:13:43,303 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 15:13:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-24 15:13:43,304 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-24 15:13:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-24 15:13:43,304 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-24 15:13:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 15:13:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 15:13:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 15:13:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-24 15:13:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 15:13:43,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 15:13:43,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 15:13:43,278 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 15:13:43,306 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 15:13:43,405 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 15:13:43,407 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 15:13:43,627 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 15:13:43,682 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 15:13:43,682 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-24 15:13:43,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 03:13:43 BoogieIcfgContainer [2023-08-24 15:13:43,684 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 15:13:43,686 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 15:13:43,686 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 15:13:43,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 15:13:43,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 03:13:42" (1/3) ... [2023-08-24 15:13:43,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bbff018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 03:13:43, skipping insertion in model container [2023-08-24 15:13:43,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 03:13:43" (2/3) ... [2023-08-24 15:13:43,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bbff018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 03:13:43, skipping insertion in model container [2023-08-24 15:13:43,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 03:13:43" (3/3) ... [2023-08-24 15:13:43,690 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-dec.wvr.c [2023-08-24 15:13:43,702 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 15:13:43,702 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 15:13:43,702 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 15:13:43,790 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-24 15:13:43,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 166 transitions, 364 flow [2023-08-24 15:13:43,914 INFO L124 PetriNetUnfolderBase]: 12/162 cut-off events. [2023-08-24 15:13:43,914 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 15:13:43,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 162 events. 12/162 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 132 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 130. Up to 2 conditions per place. [2023-08-24 15:13:43,919 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 166 transitions, 364 flow [2023-08-24 15:13:43,924 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 150 transitions, 324 flow [2023-08-24 15:13:43,927 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 15:13:43,938 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 150 transitions, 324 flow [2023-08-24 15:13:43,941 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 150 transitions, 324 flow [2023-08-24 15:13:43,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 150 transitions, 324 flow [2023-08-24 15:13:43,986 INFO L124 PetriNetUnfolderBase]: 12/150 cut-off events. [2023-08-24 15:13:43,986 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 15:13:43,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 150 events. 12/150 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 131 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 130. Up to 2 conditions per place. [2023-08-24 15:13:43,990 INFO L119 LiptonReduction]: Number of co-enabled transitions 2548 [2023-08-24 15:13:48,933 INFO L134 LiptonReduction]: Checked pairs total: 3658 [2023-08-24 15:13:48,934 INFO L136 LiptonReduction]: Total number of compositions: 137 [2023-08-24 15:13:48,943 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 15:13:48,947 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;@448b8c1f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 15:13:48,947 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-24 15:13:48,951 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 15:13:48,952 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2023-08-24 15:13:48,952 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 15:13:48,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:13:48,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:13:48,952 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 15:13:48,955 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:13:48,955 INFO L85 PathProgramCache]: Analyzing trace with hash -924532907, now seen corresponding path program 1 times [2023-08-24 15:13:48,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:13:48,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481383759] [2023-08-24 15:13:48,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:13:48,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:13:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:13:49,317 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 15:13:49,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:13:49,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481383759] [2023-08-24 15:13:49,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481383759] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:13:49,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:13:49,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 15:13:49,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218216614] [2023-08-24 15:13:49,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:13:49,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 15:13:49,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:13:49,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 15:13:49,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 15:13:49,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 303 [2023-08-24 15:13:49,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:13:49,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:13:49,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 303 [2023-08-24 15:13:49,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:13:49,520 INFO L124 PetriNetUnfolderBase]: 1410/1888 cut-off events. [2023-08-24 15:13:49,521 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2023-08-24 15:13:49,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3978 conditions, 1888 events. 1410/1888 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7213 event pairs, 760 based on Foata normal form. 0/1422 useless extension candidates. Maximal degree in co-relation 3477. Up to 1542 conditions per place. [2023-08-24 15:13:49,531 INFO L140 encePairwiseOnDemand]: 299/303 looper letters, 42 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2023-08-24 15:13:49,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 215 flow [2023-08-24 15:13:49,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 15:13:49,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 15:13:49,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 566 transitions. [2023-08-24 15:13:49,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.466996699669967 [2023-08-24 15:13:49,542 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 566 transitions. [2023-08-24 15:13:49,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 566 transitions. [2023-08-24 15:13:49,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:13:49,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 566 transitions. [2023-08-24 15:13:49,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 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 15:13:49,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 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 15:13:49,551 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 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 15:13:49,552 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 86 flow. Second operand 4 states and 566 transitions. [2023-08-24 15:13:49,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 215 flow [2023-08-24 15:13:49,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 193 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-24 15:13:49,558 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 84 flow [2023-08-24 15:13:49,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2023-08-24 15:13:49,561 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2023-08-24 15:13:49,561 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 84 flow [2023-08-24 15:13:49,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:13:49,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:13:49,562 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:13:49,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 15:13:49,562 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 15:13:49,562 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:13:49,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1308158109, now seen corresponding path program 1 times [2023-08-24 15:13:49,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:13:49,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759044342] [2023-08-24 15:13:49,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:13:49,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:13:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:13:49,670 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 15:13:49,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:13:49,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759044342] [2023-08-24 15:13:49,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759044342] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:13:49,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:13:49,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 15:13:49,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340220800] [2023-08-24 15:13:49,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:13:49,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 15:13:49,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:13:49,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 15:13:49,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 15:13:49,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 303 [2023-08-24 15:13:49,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 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 15:13:49,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:13:49,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 303 [2023-08-24 15:13:49,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:13:49,846 INFO L124 PetriNetUnfolderBase]: 1718/2336 cut-off events. [2023-08-24 15:13:49,846 INFO L125 PetriNetUnfolderBase]: For 527/527 co-relation queries the response was YES. [2023-08-24 15:13:49,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5313 conditions, 2336 events. 1718/2336 cut-off events. For 527/527 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8122 event pairs, 977 based on Foata normal form. 0/1943 useless extension candidates. Maximal degree in co-relation 1800. Up to 1790 conditions per place. [2023-08-24 15:13:49,856 INFO L140 encePairwiseOnDemand]: 299/303 looper letters, 47 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-08-24 15:13:49,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 233 flow [2023-08-24 15:13:49,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 15:13:49,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 15:13:49,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 569 transitions. [2023-08-24 15:13:49,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46947194719471946 [2023-08-24 15:13:49,860 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 569 transitions. [2023-08-24 15:13:49,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 569 transitions. [2023-08-24 15:13:49,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:13:49,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 569 transitions. [2023-08-24 15:13:49,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.25) internal successors, (569), 4 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 15:13:49,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 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 15:13:49,865 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 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 15:13:49,865 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 84 flow. Second operand 4 states and 569 transitions. [2023-08-24 15:13:49,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 233 flow [2023-08-24 15:13:49,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 223 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-24 15:13:49,868 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 92 flow [2023-08-24 15:13:49,869 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2023-08-24 15:13:49,871 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-08-24 15:13:49,872 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 92 flow [2023-08-24 15:13:49,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 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 15:13:49,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:13:49,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:13:49,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 15:13:49,877 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 15:13:49,878 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:13:49,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1319455662, now seen corresponding path program 1 times [2023-08-24 15:13:49,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:13:49,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946960576] [2023-08-24 15:13:49,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:13:49,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:13:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:13:49,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:13:49,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:13:49,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946960576] [2023-08-24 15:13:49,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946960576] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:13:49,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:13:49,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 15:13:49,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613561825] [2023-08-24 15:13:49,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:13:49,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 15:13:49,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:13:49,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 15:13:49,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 15:13:49,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 303 [2023-08-24 15:13:49,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 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 15:13:49,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:13:49,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 303 [2023-08-24 15:13:49,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:13:50,145 INFO L124 PetriNetUnfolderBase]: 1632/2234 cut-off events. [2023-08-24 15:13:50,145 INFO L125 PetriNetUnfolderBase]: For 531/686 co-relation queries the response was YES. [2023-08-24 15:13:50,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5582 conditions, 2234 events. 1632/2234 cut-off events. For 531/686 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8451 event pairs, 977 based on Foata normal form. 155/1997 useless extension candidates. Maximal degree in co-relation 1676. Up to 1790 conditions per place. [2023-08-24 15:13:50,155 INFO L140 encePairwiseOnDemand]: 299/303 looper letters, 46 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-08-24 15:13:50,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 240 flow [2023-08-24 15:13:50,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 15:13:50,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 15:13:50,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 566 transitions. [2023-08-24 15:13:50,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.466996699669967 [2023-08-24 15:13:50,156 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 566 transitions. [2023-08-24 15:13:50,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 566 transitions. [2023-08-24 15:13:50,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:13:50,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 566 transitions. [2023-08-24 15:13:50,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 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 15:13:50,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 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 15:13:50,160 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 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 15:13:50,160 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 92 flow. Second operand 4 states and 566 transitions. [2023-08-24 15:13:50,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 240 flow [2023-08-24 15:13:50,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 231 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-24 15:13:50,163 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 100 flow [2023-08-24 15:13:50,163 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2023-08-24 15:13:50,164 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-08-24 15:13:50,167 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 100 flow [2023-08-24 15:13:50,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 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 15:13:50,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:13:50,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:13:50,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 15:13:50,168 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 15:13:50,168 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:13:50,169 INFO L85 PathProgramCache]: Analyzing trace with hash 409706382, now seen corresponding path program 1 times [2023-08-24 15:13:50,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:13:50,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642571591] [2023-08-24 15:13:50,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:13:50,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:13:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:13:50,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:13:50,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:13:50,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642571591] [2023-08-24 15:13:50,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642571591] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:13:50,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:13:50,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 15:13:50,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680898193] [2023-08-24 15:13:50,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:13:50,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 15:13:50,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:13:50,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 15:13:50,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 15:13:50,330 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 303 [2023-08-24 15:13:50,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 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 15:13:50,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:13:50,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 303 [2023-08-24 15:13:50,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:13:50,457 INFO L124 PetriNetUnfolderBase]: 1632/2235 cut-off events. [2023-08-24 15:13:50,457 INFO L125 PetriNetUnfolderBase]: For 884/1039 co-relation queries the response was YES. [2023-08-24 15:13:50,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5797 conditions, 2235 events. 1632/2235 cut-off events. For 884/1039 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8181 event pairs, 1243 based on Foata normal form. 155/1994 useless extension candidates. Maximal degree in co-relation 1879. Up to 2223 conditions per place. [2023-08-24 15:13:50,466 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 32 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-08-24 15:13:50,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 170 flow [2023-08-24 15:13:50,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 15:13:50,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 15:13:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-08-24 15:13:50,468 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43784378437843785 [2023-08-24 15:13:50,468 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-08-24 15:13:50,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-08-24 15:13:50,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:13:50,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-08-24 15:13:50,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 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 15:13:50,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 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 15:13:50,470 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 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 15:13:50,470 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 100 flow. Second operand 3 states and 398 transitions. [2023-08-24 15:13:50,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 170 flow [2023-08-24 15:13:50,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 164 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-24 15:13:50,472 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 106 flow [2023-08-24 15:13:50,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2023-08-24 15:13:50,472 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-08-24 15:13:50,472 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 106 flow [2023-08-24 15:13:50,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 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 15:13:50,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:13:50,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:13:50,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 15:13:50,473 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 15:13:50,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:13:50,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1402270999, now seen corresponding path program 1 times [2023-08-24 15:13:50,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:13:50,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781916090] [2023-08-24 15:13:50,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:13:50,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:13:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:13:50,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:13:50,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:13:50,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781916090] [2023-08-24 15:13:50,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781916090] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:13:50,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062816959] [2023-08-24 15:13:50,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:13:50,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:13:50,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:13:50,760 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 15:13:50,777 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 15:13:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:13:50,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-24 15:13:50,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:13:51,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:13:51,007 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-08-24 15:13:51,097 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-08-24 15:13:51,137 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2023-08-24 15:13:51,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:13:51,173 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:13:53,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:13:53,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062816959] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:13:53,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:13:53,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 10] total 25 [2023-08-24 15:13:53,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83111384] [2023-08-24 15:13:53,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:13:53,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-24 15:13:53,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:13:53,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-24 15:13:53,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=498, Unknown=2, NotChecked=0, Total=650 [2023-08-24 15:13:53,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 303 [2023-08-24 15:13:53,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 106 flow. Second operand has 26 states, 26 states have (on average 104.23076923076923) internal successors, (2710), 26 states have internal predecessors, (2710), 0 states have call successors, (0), 0 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 15:13:53,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:13:53,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 303 [2023-08-24 15:13:53,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:13:58,526 INFO L124 PetriNetUnfolderBase]: 19766/27044 cut-off events. [2023-08-24 15:13:58,529 INFO L125 PetriNetUnfolderBase]: For 7499/7499 co-relation queries the response was YES. [2023-08-24 15:13:58,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69987 conditions, 27044 events. 19766/27044 cut-off events. For 7499/7499 co-relation queries the response was YES. Maximal size of possible extension queue 978. Compared 149115 event pairs, 1040 based on Foata normal form. 14/21400 useless extension candidates. Maximal degree in co-relation 69973. Up to 5638 conditions per place. [2023-08-24 15:13:58,693 INFO L140 encePairwiseOnDemand]: 289/303 looper letters, 345 selfloop transitions, 129 changer transitions 473/947 dead transitions. [2023-08-24 15:13:58,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 947 transitions, 4714 flow [2023-08-24 15:13:58,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-08-24 15:13:58,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2023-08-24 15:13:58,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 6724 transitions. [2023-08-24 15:13:58,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38261067486058953 [2023-08-24 15:13:58,715 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 6724 transitions. [2023-08-24 15:13:58,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 6724 transitions. [2023-08-24 15:13:58,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:13:58,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 6724 transitions. [2023-08-24 15:13:58,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 115.93103448275862) internal successors, (6724), 58 states have internal predecessors, (6724), 0 states have call successors, (0), 0 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 15:13:58,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 303.0) internal successors, (17877), 59 states have internal predecessors, (17877), 0 states have call successors, (0), 0 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 15:13:58,752 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 303.0) internal successors, (17877), 59 states have internal predecessors, (17877), 0 states have call successors, (0), 0 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 15:13:58,752 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 106 flow. Second operand 58 states and 6724 transitions. [2023-08-24 15:13:58,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 947 transitions, 4714 flow [2023-08-24 15:13:58,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 947 transitions, 4710 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 15:13:58,853 INFO L231 Difference]: Finished difference. Result has 141 places, 196 transitions, 1280 flow [2023-08-24 15:13:58,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=1280, PETRI_PLACES=141, PETRI_TRANSITIONS=196} [2023-08-24 15:13:58,854 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 101 predicate places. [2023-08-24 15:13:58,854 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 196 transitions, 1280 flow [2023-08-24 15:13:58,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 104.23076923076923) internal successors, (2710), 26 states have internal predecessors, (2710), 0 states have call successors, (0), 0 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 15:13:58,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:13:58,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:13:58,863 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 15:13:59,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:13:59,061 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 15:13:59,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:13:59,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1959356175, now seen corresponding path program 2 times [2023-08-24 15:13:59,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:13:59,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857905384] [2023-08-24 15:13:59,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:13:59,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:13:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:13:59,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 15:13:59,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:13:59,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857905384] [2023-08-24 15:13:59,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857905384] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:13:59,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:13:59,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 15:13:59,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392828149] [2023-08-24 15:13:59,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:13:59,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 15:13:59,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:13:59,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 15:13:59,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 15:13:59,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 303 [2023-08-24 15:13:59,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 196 transitions, 1280 flow. Second operand has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 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 15:13:59,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:13:59,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 303 [2023-08-24 15:13:59,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:14:01,363 INFO L124 PetriNetUnfolderBase]: 13138/18484 cut-off events. [2023-08-24 15:14:01,363 INFO L125 PetriNetUnfolderBase]: For 312079/313917 co-relation queries the response was YES. [2023-08-24 15:14:01,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101377 conditions, 18484 events. 13138/18484 cut-off events. For 312079/313917 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 105044 event pairs, 1579 based on Foata normal form. 1515/19664 useless extension candidates. Maximal degree in co-relation 101314. Up to 10991 conditions per place. [2023-08-24 15:14:01,507 INFO L140 encePairwiseOnDemand]: 299/303 looper letters, 157 selfloop transitions, 4 changer transitions 338/500 dead transitions. [2023-08-24 15:14:01,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 500 transitions, 4304 flow [2023-08-24 15:14:01,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:14:01,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:14:01,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 767 transitions. [2023-08-24 15:14:01,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5062706270627063 [2023-08-24 15:14:01,510 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 767 transitions. [2023-08-24 15:14:01,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 767 transitions. [2023-08-24 15:14:01,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:14:01,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 767 transitions. [2023-08-24 15:14:01,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 153.4) internal successors, (767), 5 states have internal predecessors, (767), 0 states have call successors, (0), 0 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 15:14:01,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 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 15:14:01,513 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 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 15:14:01,513 INFO L175 Difference]: Start difference. First operand has 141 places, 196 transitions, 1280 flow. Second operand 5 states and 767 transitions. [2023-08-24 15:14:01,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 500 transitions, 4304 flow [2023-08-24 15:14:02,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 500 transitions, 4175 flow, removed 64 selfloop flow, removed 20 redundant places. [2023-08-24 15:14:02,262 INFO L231 Difference]: Finished difference. Result has 99 places, 122 transitions, 725 flow [2023-08-24 15:14:02,263 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=1213, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=725, PETRI_PLACES=99, PETRI_TRANSITIONS=122} [2023-08-24 15:14:02,263 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 59 predicate places. [2023-08-24 15:14:02,263 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 122 transitions, 725 flow [2023-08-24 15:14:02,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 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 15:14:02,264 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:14:02,264 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:14:02,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 15:14:02,264 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 15:14:02,264 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:14:02,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1437768239, now seen corresponding path program 3 times [2023-08-24 15:14:02,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:14:02,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949180544] [2023-08-24 15:14:02,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:14:02,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:14:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:14:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 15:14:02,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:14:02,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949180544] [2023-08-24 15:14:02,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949180544] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:14:02,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239371128] [2023-08-24 15:14:02,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 15:14:02,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:14:02,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:14:02,651 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 15:14:02,652 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 15:14:02,822 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-24 15:14:02,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:14:02,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-24 15:14:02,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:14:02,905 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-24 15:14:02,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:14:02,961 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 15:14:03,053 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-08-24 15:14:03,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:14:03,075 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:14:11,604 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_282 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_282) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (+ .cse0 1))))) is different from false [2023-08-24 15:14:11,611 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:14:11,611 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 45 [2023-08-24 15:14:11,615 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2023-08-24 15:14:11,619 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-08-24 15:14:11,622 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2023-08-24 15:14:11,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:14:11,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239371128] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:14:11,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:14:11,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 11] total 27 [2023-08-24 15:14:11,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853475482] [2023-08-24 15:14:11,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:14:11,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-24 15:14:11,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:14:11,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-24 15:14:11,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=609, Unknown=12, NotChecked=52, Total=812 [2023-08-24 15:14:11,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 303 [2023-08-24 15:14:11,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 122 transitions, 725 flow. Second operand has 29 states, 29 states have (on average 104.0) internal successors, (3016), 29 states have internal predecessors, (3016), 0 states have call successors, (0), 0 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 15:14:11,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:14:11,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 303 [2023-08-24 15:14:11,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:14:20,304 INFO L124 PetriNetUnfolderBase]: 31337/42953 cut-off events. [2023-08-24 15:14:20,304 INFO L125 PetriNetUnfolderBase]: For 643247/643247 co-relation queries the response was YES. [2023-08-24 15:14:20,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228210 conditions, 42953 events. 31337/42953 cut-off events. For 643247/643247 co-relation queries the response was YES. Maximal size of possible extension queue 1527. Compared 251344 event pairs, 1614 based on Foata normal form. 23/42125 useless extension candidates. Maximal degree in co-relation 228163. Up to 9103 conditions per place. [2023-08-24 15:14:20,644 INFO L140 encePairwiseOnDemand]: 290/303 looper letters, 530 selfloop transitions, 229 changer transitions 1226/1985 dead transitions. [2023-08-24 15:14:20,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 1985 transitions, 17215 flow [2023-08-24 15:14:20,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2023-08-24 15:14:20,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2023-08-24 15:14:20,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 10007 transitions. [2023-08-24 15:14:20,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3753000300030003 [2023-08-24 15:14:20,659 INFO L72 ComplementDD]: Start complementDD. Operand 88 states and 10007 transitions. [2023-08-24 15:14:20,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 10007 transitions. [2023-08-24 15:14:20,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:14:20,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 88 states and 10007 transitions. [2023-08-24 15:14:20,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 89 states, 88 states have (on average 113.7159090909091) internal successors, (10007), 88 states have internal predecessors, (10007), 0 states have call successors, (0), 0 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 15:14:20,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 89 states, 89 states have (on average 303.0) internal successors, (26967), 89 states have internal predecessors, (26967), 0 states have call successors, (0), 0 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 15:14:20,722 INFO L81 ComplementDD]: Finished complementDD. Result has 89 states, 89 states have (on average 303.0) internal successors, (26967), 89 states have internal predecessors, (26967), 0 states have call successors, (0), 0 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 15:14:20,723 INFO L175 Difference]: Start difference. First operand has 99 places, 122 transitions, 725 flow. Second operand 88 states and 10007 transitions. [2023-08-24 15:14:20,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 1985 transitions, 17215 flow [2023-08-24 15:14:23,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 1985 transitions, 15275 flow, removed 930 selfloop flow, removed 12 redundant places. [2023-08-24 15:14:23,139 INFO L231 Difference]: Finished difference. Result has 233 places, 315 transitions, 3184 flow [2023-08-24 15:14:23,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=88, PETRI_FLOW=3184, PETRI_PLACES=233, PETRI_TRANSITIONS=315} [2023-08-24 15:14:23,140 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 193 predicate places. [2023-08-24 15:14:23,140 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 315 transitions, 3184 flow [2023-08-24 15:14:23,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 104.0) internal successors, (3016), 29 states have internal predecessors, (3016), 0 states have call successors, (0), 0 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 15:14:23,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:14:23,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:14:23,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-24 15:14:23,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-08-24 15:14:23,346 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 15:14:23,347 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:14:23,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1175093357, now seen corresponding path program 4 times [2023-08-24 15:14:23,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:14:23,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229340151] [2023-08-24 15:14:23,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:14:23,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:14:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:14:23,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:14:23,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:14:23,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229340151] [2023-08-24 15:14:23,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229340151] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:14:23,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389712472] [2023-08-24 15:14:23,950 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 15:14:23,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:14:23,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:14:23,951 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 15:14:23,953 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 15:14:24,055 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 15:14:24,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:14:24,057 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 45 conjunts are in the unsatisfiable core [2023-08-24 15:14:24,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:14:24,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:14:24,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:14:24,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:14:24,068 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-24 15:14:24,095 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-24 15:14:24,129 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 15:14:24,156 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 15:14:24,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:14:24,243 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 15:14:24,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:14:24,272 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 15:14:24,321 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:14:24,322 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 36 [2023-08-24 15:14:24,371 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:14:24,371 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:14:24,602 WARN L839 $PredicateComparison]: unable to prove that (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse0 (select .cse1 (+ c_~A~0.offset (* thread2Thread1of1ForFork0_~i~1 4))))) (or (< .cse0 (select .cse1 c_~A~0.offset)) (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1)))))) is different from false [2023-08-24 15:14:24,864 WARN L839 $PredicateComparison]: unable to prove that (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse0 (select .cse1 (+ c_~A~0.offset (* thread2Thread1of1ForFork0_~i~1 4))))) (or (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (+ .cse0 1)) (< .cse0 (select .cse1 c_~A~0.offset)) (<= 2147483647 .cse0))))) is different from false [2023-08-24 15:14:24,888 WARN L839 $PredicateComparison]: unable to prove that (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_355))) (let ((.cse2 (select (store (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse1 (select .cse2 (+ c_~A~0.offset (* thread2Thread1of1ForFork0_~i~1 4))))) (or (<= (select (select .cse0 c_~A~0.base) c_~A~0.offset) (+ .cse1 1)) (< .cse1 (select .cse2 c_~A~0.offset)) (<= 2147483647 .cse1)))))) is different from false [2023-08-24 15:14:24,910 WARN L839 $PredicateComparison]: unable to prove that (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_354 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_354) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_355))) (let ((.cse1 (select (store (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse1 (+ (* thread2Thread1of1ForFork0_~i~1 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= 2147483647 .cse0) (< .cse0 (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (<= (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse0 1))))))) is different from false [2023-08-24 15:14:24,921 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:14:24,921 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 110 [2023-08-24 15:14:24,952 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:14:24,953 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58688 treesize of output 55304 [2023-08-24 15:14:25,036 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:14:25,036 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 462 treesize of output 442 [2023-08-24 15:14:25,058 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:14:25,059 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 920 treesize of output 848 [2023-08-24 15:14:25,083 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:14:25,084 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 840 treesize of output 688 [2023-08-24 15:14:25,109 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:14:25,110 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 367 treesize of output 319 [2023-08-24 15:14:26,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-08-24 15:14:26,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389712472] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:14:26,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:14:26,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 31 [2023-08-24 15:14:26,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185410959] [2023-08-24 15:14:26,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:14:26,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-24 15:14:26,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:14:26,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-24 15:14:26,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=677, Unknown=14, NotChecked=228, Total=1056 [2023-08-24 15:14:26,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 303 [2023-08-24 15:14:26,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 315 transitions, 3184 flow. Second operand has 33 states, 33 states have (on average 90.78787878787878) internal successors, (2996), 33 states have internal predecessors, (2996), 0 states have call successors, (0), 0 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 15:14:26,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:14:26,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 303 [2023-08-24 15:14:26,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:14:33,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:14:41,697 INFO L124 PetriNetUnfolderBase]: 30369/41996 cut-off events. [2023-08-24 15:14:41,697 INFO L125 PetriNetUnfolderBase]: For 3107118/3107118 co-relation queries the response was YES. [2023-08-24 15:14:42,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400878 conditions, 41996 events. 30369/41996 cut-off events. For 3107118/3107118 co-relation queries the response was YES. Maximal size of possible extension queue 1515. Compared 249628 event pairs, 2675 based on Foata normal form. 15/42010 useless extension candidates. Maximal degree in co-relation 400767. Up to 10312 conditions per place. [2023-08-24 15:14:42,394 INFO L140 encePairwiseOnDemand]: 292/303 looper letters, 266 selfloop transitions, 184 changer transitions 956/1406 dead transitions. [2023-08-24 15:14:42,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 1406 transitions, 21500 flow [2023-08-24 15:14:42,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-08-24 15:14:42,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-08-24 15:14:42,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 4604 transitions. [2023-08-24 15:14:42,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3303199885205912 [2023-08-24 15:14:42,413 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 4604 transitions. [2023-08-24 15:14:42,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 4604 transitions. [2023-08-24 15:14:42,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:14:42,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 4604 transitions. [2023-08-24 15:14:42,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 100.08695652173913) internal successors, (4604), 46 states have internal predecessors, (4604), 0 states have call successors, (0), 0 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 15:14:42,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 303.0) internal successors, (14241), 47 states have internal predecessors, (14241), 0 states have call successors, (0), 0 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 15:14:42,429 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 303.0) internal successors, (14241), 47 states have internal predecessors, (14241), 0 states have call successors, (0), 0 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 15:14:42,429 INFO L175 Difference]: Start difference. First operand has 233 places, 315 transitions, 3184 flow. Second operand 46 states and 4604 transitions. [2023-08-24 15:14:42,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 1406 transitions, 21500 flow [2023-08-24 15:15:01,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 1406 transitions, 16508 flow, removed 2358 selfloop flow, removed 45 redundant places. [2023-08-24 15:15:01,111 INFO L231 Difference]: Finished difference. Result has 216 places, 329 transitions, 4013 flow [2023-08-24 15:15:01,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=2809, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=4013, PETRI_PLACES=216, PETRI_TRANSITIONS=329} [2023-08-24 15:15:01,112 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 176 predicate places. [2023-08-24 15:15:01,112 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 329 transitions, 4013 flow [2023-08-24 15:15:01,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 90.78787878787878) internal successors, (2996), 33 states have internal predecessors, (2996), 0 states have call successors, (0), 0 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 15:15:01,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:15:01,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:15:01,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-24 15:15:01,318 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 15:15:01,319 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 15:15:01,319 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:15:01,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1649871177, now seen corresponding path program 5 times [2023-08-24 15:15:01,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:15:01,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547169965] [2023-08-24 15:15:01,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:15:01,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:15:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:15:01,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 15:15:01,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:15:01,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547169965] [2023-08-24 15:15:01,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547169965] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 15:15:01,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 15:15:01,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 15:15:01,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497619267] [2023-08-24 15:15:01,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:15:01,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 15:15:01,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:15:01,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 15:15:01,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 15:15:01,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 303 [2023-08-24 15:15:01,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 329 transitions, 4013 flow. Second operand has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 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 15:15:01,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:15:01,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 303 [2023-08-24 15:15:01,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:15:05,995 INFO L124 PetriNetUnfolderBase]: 18729/26359 cut-off events. [2023-08-24 15:15:05,996 INFO L125 PetriNetUnfolderBase]: For 1615403/1618788 co-relation queries the response was YES. [2023-08-24 15:15:06,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233236 conditions, 26359 events. 18729/26359 cut-off events. For 1615403/1618788 co-relation queries the response was YES. Maximal size of possible extension queue 1051. Compared 153397 event pairs, 3931 based on Foata normal form. 1132/27205 useless extension candidates. Maximal degree in co-relation 233129. Up to 19625 conditions per place. [2023-08-24 15:15:06,328 INFO L140 encePairwiseOnDemand]: 299/303 looper letters, 327 selfloop transitions, 21 changer transitions 243/606 dead transitions. [2023-08-24 15:15:06,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 606 transitions, 8777 flow [2023-08-24 15:15:06,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 15:15:06,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 15:15:06,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 761 transitions. [2023-08-24 15:15:06,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5023102310231023 [2023-08-24 15:15:06,329 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 761 transitions. [2023-08-24 15:15:06,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 761 transitions. [2023-08-24 15:15:06,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:15:06,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 761 transitions. [2023-08-24 15:15:06,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 152.2) internal successors, (761), 5 states have internal predecessors, (761), 0 states have call successors, (0), 0 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 15:15:06,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 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 15:15:06,331 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 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 15:15:06,331 INFO L175 Difference]: Start difference. First operand has 216 places, 329 transitions, 4013 flow. Second operand 5 states and 761 transitions. [2023-08-24 15:15:06,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 606 transitions, 8777 flow [2023-08-24 15:15:14,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 606 transitions, 8047 flow, removed 343 selfloop flow, removed 38 redundant places. [2023-08-24 15:15:14,511 INFO L231 Difference]: Finished difference. Result has 149 places, 317 transitions, 3535 flow [2023-08-24 15:15:14,511 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=3621, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3535, PETRI_PLACES=149, PETRI_TRANSITIONS=317} [2023-08-24 15:15:14,512 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 109 predicate places. [2023-08-24 15:15:14,512 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 317 transitions, 3535 flow [2023-08-24 15:15:14,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 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 15:15:14,513 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:15:14,513 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:15:14,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 15:15:14,513 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 15:15:14,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:15:14,513 INFO L85 PathProgramCache]: Analyzing trace with hash -152982893, now seen corresponding path program 6 times [2023-08-24 15:15:14,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:15:14,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337634993] [2023-08-24 15:15:14,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:15:14,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:15:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:15:14,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 15:15:14,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:15:14,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337634993] [2023-08-24 15:15:14,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337634993] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:15:14,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448301640] [2023-08-24 15:15:14,707 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 15:15:14,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:15:14,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:15:14,708 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 15:15:14,710 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 15:15:14,946 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-24 15:15:14,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:15:14,948 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-24 15:15:14,950 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:15:15,046 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-08-24 15:15:15,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:15:15,070 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:15:15,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:15:15,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448301640] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:15:15,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:15:15,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 7] total 19 [2023-08-24 15:15:15,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983767949] [2023-08-24 15:15:15,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:15:15,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-24 15:15:15,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:15:15,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-24 15:15:15,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2023-08-24 15:15:15,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 303 [2023-08-24 15:15:15,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 317 transitions, 3535 flow. Second operand has 20 states, 20 states have (on average 115.0) internal successors, (2300), 20 states have internal predecessors, (2300), 0 states have call successors, (0), 0 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 15:15:15,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:15:15,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 303 [2023-08-24 15:15:15,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:15:27,977 INFO L124 PetriNetUnfolderBase]: 59315/82609 cut-off events. [2023-08-24 15:15:27,977 INFO L125 PetriNetUnfolderBase]: For 2446188/2448780 co-relation queries the response was YES. [2023-08-24 15:15:28,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596550 conditions, 82609 events. 59315/82609 cut-off events. For 2446188/2448780 co-relation queries the response was YES. Maximal size of possible extension queue 3273. Compared 548452 event pairs, 5753 based on Foata normal form. 2073/84519 useless extension candidates. Maximal degree in co-relation 596476. Up to 20914 conditions per place. [2023-08-24 15:15:28,979 INFO L140 encePairwiseOnDemand]: 291/303 looper letters, 486 selfloop transitions, 162 changer transitions 1689/2350 dead transitions. [2023-08-24 15:15:28,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 2350 transitions, 31609 flow [2023-08-24 15:15:28,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-08-24 15:15:28,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2023-08-24 15:15:28,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 6247 transitions. [2023-08-24 15:15:28,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41234323432343234 [2023-08-24 15:15:28,992 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 6247 transitions. [2023-08-24 15:15:28,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 6247 transitions. [2023-08-24 15:15:28,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:15:28,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 6247 transitions. [2023-08-24 15:15:28,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 124.94) internal successors, (6247), 50 states have internal predecessors, (6247), 0 states have call successors, (0), 0 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 15:15:29,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 303.0) internal successors, (15453), 51 states have internal predecessors, (15453), 0 states have call successors, (0), 0 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 15:15:29,035 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 303.0) internal successors, (15453), 51 states have internal predecessors, (15453), 0 states have call successors, (0), 0 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 15:15:29,035 INFO L175 Difference]: Start difference. First operand has 149 places, 317 transitions, 3535 flow. Second operand 50 states and 6247 transitions. [2023-08-24 15:15:29,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 2350 transitions, 31609 flow [2023-08-24 15:15:49,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 2350 transitions, 31377 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-24 15:15:49,650 INFO L231 Difference]: Finished difference. Result has 240 places, 401 transitions, 6139 flow [2023-08-24 15:15:49,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=3489, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=6139, PETRI_PLACES=240, PETRI_TRANSITIONS=401} [2023-08-24 15:15:49,651 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 200 predicate places. [2023-08-24 15:15:49,652 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 401 transitions, 6139 flow [2023-08-24 15:15:49,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 115.0) internal successors, (2300), 20 states have internal predecessors, (2300), 0 states have call successors, (0), 0 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 15:15:49,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:15:49,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:15:49,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-24 15:15:49,867 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 15:15:49,867 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 15:15:49,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:15:49,867 INFO L85 PathProgramCache]: Analyzing trace with hash 2060274039, now seen corresponding path program 7 times [2023-08-24 15:15:49,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:15:49,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45828166] [2023-08-24 15:15:49,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:15:49,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:15:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:15:50,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:15:50,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:15:50,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45828166] [2023-08-24 15:15:50,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45828166] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:15:50,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187573429] [2023-08-24 15:15:50,197 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 15:15:50,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:15:50,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:15:50,201 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 15:15:50,244 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 15:15:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:15:50,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 26 conjunts are in the unsatisfiable core [2023-08-24 15:15:50,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:15:50,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:15:50,441 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 15:15:50,482 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-08-24 15:15:50,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:15:50,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:15:50,737 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:15:50,737 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 85 [2023-08-24 15:15:50,741 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2023-08-24 15:15:50,744 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2023-08-24 15:15:50,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 15:15:50,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187573429] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-24 15:15:50,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-24 15:15:50,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7, 8] total 21 [2023-08-24 15:15:50,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108124670] [2023-08-24 15:15:50,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:15:50,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-24 15:15:50,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:15:50,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-24 15:15:50,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=407, Unknown=6, NotChecked=0, Total=506 [2023-08-24 15:15:50,796 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 303 [2023-08-24 15:15:50,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 401 transitions, 6139 flow. Second operand has 11 states, 11 states have (on average 115.72727272727273) internal successors, (1273), 11 states have internal predecessors, (1273), 0 states have call successors, (0), 0 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 15:15:50,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:15:50,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 303 [2023-08-24 15:15:50,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:16:01,067 INFO L124 PetriNetUnfolderBase]: 35539/50056 cut-off events. [2023-08-24 15:16:01,067 INFO L125 PetriNetUnfolderBase]: For 4450866/4452508 co-relation queries the response was YES. [2023-08-24 15:16:02,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537930 conditions, 50056 events. 35539/50056 cut-off events. For 4450866/4452508 co-relation queries the response was YES. Maximal size of possible extension queue 1976. Compared 316642 event pairs, 9943 based on Foata normal form. 1231/51221 useless extension candidates. Maximal degree in co-relation 537809. Up to 24568 conditions per place. [2023-08-24 15:16:02,286 INFO L140 encePairwiseOnDemand]: 295/303 looper letters, 453 selfloop transitions, 26 changer transitions 265/757 dead transitions. [2023-08-24 15:16:02,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 757 transitions, 13922 flow [2023-08-24 15:16:02,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 15:16:02,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 15:16:02,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1012 transitions. [2023-08-24 15:16:02,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4174917491749175 [2023-08-24 15:16:02,290 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1012 transitions. [2023-08-24 15:16:02,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1012 transitions. [2023-08-24 15:16:02,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:16:02,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1012 transitions. [2023-08-24 15:16:02,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.5) internal successors, (1012), 8 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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 15:16:02,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 303.0) internal successors, (2727), 9 states have internal predecessors, (2727), 0 states have call successors, (0), 0 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 15:16:02,298 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 303.0) internal successors, (2727), 9 states have internal predecessors, (2727), 0 states have call successors, (0), 0 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 15:16:02,298 INFO L175 Difference]: Start difference. First operand has 240 places, 401 transitions, 6139 flow. Second operand 8 states and 1012 transitions. [2023-08-24 15:16:02,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 757 transitions, 13922 flow [2023-08-24 15:16:23,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 757 transitions, 12936 flow, removed 466 selfloop flow, removed 27 redundant places. [2023-08-24 15:16:23,552 INFO L231 Difference]: Finished difference. Result has 189 places, 407 transitions, 5904 flow [2023-08-24 15:16:23,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=5663, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5904, PETRI_PLACES=189, PETRI_TRANSITIONS=407} [2023-08-24 15:16:23,552 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 149 predicate places. [2023-08-24 15:16:23,552 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 407 transitions, 5904 flow [2023-08-24 15:16:23,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 115.72727272727273) internal successors, (1273), 11 states have internal predecessors, (1273), 0 states have call successors, (0), 0 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 15:16:23,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:16:23,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:16:23,557 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 15:16:23,757 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 15:16:23,757 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 15:16:23,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:16:23,757 INFO L85 PathProgramCache]: Analyzing trace with hash -807789207, now seen corresponding path program 8 times [2023-08-24 15:16:23,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:16:23,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088706192] [2023-08-24 15:16:23,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:16:23,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:16:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:16:24,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:16:24,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:16:24,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088706192] [2023-08-24 15:16:24,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088706192] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:16:24,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670338140] [2023-08-24 15:16:24,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 15:16:24,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:16:24,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:16:24,035 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 15:16:24,037 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 15:16:24,235 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 15:16:24,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:16:24,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-24 15:16:24,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:16:24,246 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 74 [2023-08-24 15:16:24,344 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 15:16:24,425 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-08-24 15:16:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 15:16:24,452 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:16:24,733 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-08-24 15:16:24,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 15:16:24,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670338140] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-24 15:16:24,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-24 15:16:24,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7, 10] total 25 [2023-08-24 15:16:24,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525055425] [2023-08-24 15:16:24,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 15:16:24,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-24 15:16:24,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:16:24,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-24 15:16:24,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=559, Unknown=4, NotChecked=0, Total=702 [2023-08-24 15:16:24,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 303 [2023-08-24 15:16:24,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 407 transitions, 5904 flow. Second operand has 12 states, 12 states have (on average 109.5) internal successors, (1314), 12 states have internal predecessors, (1314), 0 states have call successors, (0), 0 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 15:16:24,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:16:24,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 303 [2023-08-24 15:16:24,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:16:33,455 INFO L124 PetriNetUnfolderBase]: 33032/46457 cut-off events. [2023-08-24 15:16:33,455 INFO L125 PetriNetUnfolderBase]: For 3042789/3043798 co-relation queries the response was YES. [2023-08-24 15:16:34,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458771 conditions, 46457 events. 33032/46457 cut-off events. For 3042789/3043798 co-relation queries the response was YES. Maximal size of possible extension queue 1837. Compared 290776 event pairs, 6147 based on Foata normal form. 752/47167 useless extension candidates. Maximal degree in co-relation 458671. Up to 13165 conditions per place. [2023-08-24 15:16:34,327 INFO L140 encePairwiseOnDemand]: 292/303 looper letters, 366 selfloop transitions, 95 changer transitions 512/986 dead transitions. [2023-08-24 15:16:34,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 986 transitions, 17447 flow [2023-08-24 15:16:34,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-24 15:16:34,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-24 15:16:34,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1453 transitions. [2023-08-24 15:16:34,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3996149614961496 [2023-08-24 15:16:34,329 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1453 transitions. [2023-08-24 15:16:34,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1453 transitions. [2023-08-24 15:16:34,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:16:34,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1453 transitions. [2023-08-24 15:16:34,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 121.08333333333333) internal successors, (1453), 12 states have internal predecessors, (1453), 0 states have call successors, (0), 0 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 15:16:34,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 303.0) internal successors, (3939), 13 states have internal predecessors, (3939), 0 states have call successors, (0), 0 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 15:16:34,333 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 303.0) internal successors, (3939), 13 states have internal predecessors, (3939), 0 states have call successors, (0), 0 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 15:16:34,333 INFO L175 Difference]: Start difference. First operand has 189 places, 407 transitions, 5904 flow. Second operand 12 states and 1453 transitions. [2023-08-24 15:16:34,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 986 transitions, 17447 flow [2023-08-24 15:16:50,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 986 transitions, 16703 flow, removed 356 selfloop flow, removed 11 redundant places. [2023-08-24 15:16:50,898 INFO L231 Difference]: Finished difference. Result has 198 places, 351 transitions, 5472 flow [2023-08-24 15:16:50,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=5708, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5472, PETRI_PLACES=198, PETRI_TRANSITIONS=351} [2023-08-24 15:16:50,899 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 158 predicate places. [2023-08-24 15:16:50,899 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 351 transitions, 5472 flow [2023-08-24 15:16:50,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 109.5) internal successors, (1314), 12 states have internal predecessors, (1314), 0 states have call successors, (0), 0 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 15:16:50,900 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:16:50,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:16:50,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-24 15:16:51,105 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 15:16:51,105 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 15:16:51,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:16:51,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1765596765, now seen corresponding path program 9 times [2023-08-24 15:16:51,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:16:51,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226332461] [2023-08-24 15:16:51,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:16:51,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:16:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:16:51,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:16:51,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:16:51,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226332461] [2023-08-24 15:16:51,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226332461] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:16:51,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172635800] [2023-08-24 15:16:51,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 15:16:51,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:16:51,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:16:51,456 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 15:16:51,458 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 15:16:51,635 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 15:16:51,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:16:51,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-24 15:16:51,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:16:51,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:16:51,760 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 15:16:51,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:16:51,783 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 15:16:51,835 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-08-24 15:16:51,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 15:16:51,861 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:16:52,179 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 113 [2023-08-24 15:16:52,182 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-08-24 15:16:52,185 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2023-08-24 15:16:52,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 15:16:52,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172635800] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:16:52,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:16:52,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 11] total 27 [2023-08-24 15:16:52,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016123194] [2023-08-24 15:16:52,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:16:52,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-24 15:16:52,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:16:52,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-24 15:16:52,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=655, Unknown=10, NotChecked=0, Total=812 [2023-08-24 15:16:52,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 303 [2023-08-24 15:16:52,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 351 transitions, 5472 flow. Second operand has 29 states, 29 states have (on average 107.0) internal successors, (3103), 29 states have internal predecessors, (3103), 0 states have call successors, (0), 0 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 15:16:52,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:16:52,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 303 [2023-08-24 15:16:52,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:17:00,385 INFO L124 PetriNetUnfolderBase]: 30742/43621 cut-off events. [2023-08-24 15:17:00,385 INFO L125 PetriNetUnfolderBase]: For 2608253/2609147 co-relation queries the response was YES. [2023-08-24 15:17:00,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414492 conditions, 43621 events. 30742/43621 cut-off events. For 2608253/2609147 co-relation queries the response was YES. Maximal size of possible extension queue 1801. Compared 276021 event pairs, 2011 based on Foata normal form. 737/44333 useless extension candidates. Maximal degree in co-relation 414391. Up to 11588 conditions per place. [2023-08-24 15:17:01,018 INFO L140 encePairwiseOnDemand]: 293/303 looper letters, 280 selfloop transitions, 112 changer transitions 620/1019 dead transitions. [2023-08-24 15:17:01,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 1019 transitions, 18576 flow [2023-08-24 15:17:01,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-08-24 15:17:01,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-08-24 15:17:01,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 3345 transitions. [2023-08-24 15:17:01,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806759986343462 [2023-08-24 15:17:01,021 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 3345 transitions. [2023-08-24 15:17:01,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 3345 transitions. [2023-08-24 15:17:01,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:17:01,022 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 3345 transitions. [2023-08-24 15:17:01,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 115.34482758620689) internal successors, (3345), 29 states have internal predecessors, (3345), 0 states have call successors, (0), 0 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 15:17:01,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 303.0) internal successors, (9090), 30 states have internal predecessors, (9090), 0 states have call successors, (0), 0 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 15:17:01,029 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 303.0) internal successors, (9090), 30 states have internal predecessors, (9090), 0 states have call successors, (0), 0 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 15:17:01,029 INFO L175 Difference]: Start difference. First operand has 198 places, 351 transitions, 5472 flow. Second operand 29 states and 3345 transitions. [2023-08-24 15:17:01,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 1019 transitions, 18576 flow [2023-08-24 15:17:07,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 1019 transitions, 17813 flow, removed 290 selfloop flow, removed 16 redundant places. [2023-08-24 15:17:07,755 INFO L231 Difference]: Finished difference. Result has 228 places, 280 transitions, 5056 flow [2023-08-24 15:17:07,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=5295, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=5056, PETRI_PLACES=228, PETRI_TRANSITIONS=280} [2023-08-24 15:17:07,756 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 188 predicate places. [2023-08-24 15:17:07,756 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 280 transitions, 5056 flow [2023-08-24 15:17:07,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 107.0) internal successors, (3103), 29 states have internal predecessors, (3103), 0 states have call successors, (0), 0 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 15:17:07,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:17:07,757 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:17:07,764 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 15:17:07,961 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 15:17:07,961 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 15:17:07,961 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:17:07,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1315853358, now seen corresponding path program 10 times [2023-08-24 15:17:07,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:17:07,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238465289] [2023-08-24 15:17:07,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:17:07,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:17:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:17:08,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 15:17:08,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:17:08,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238465289] [2023-08-24 15:17:08,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238465289] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:17:08,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066747846] [2023-08-24 15:17:08,040 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 15:17:08,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:17:08,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:17:08,041 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 15:17:08,043 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 15:17:08,149 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 15:17:08,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:17:08,150 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-24 15:17:08,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:17:08,194 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 15:17:08,194 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:17:08,232 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 15:17:08,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066747846] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:17:08,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:17:08,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 15 [2023-08-24 15:17:08,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526821099] [2023-08-24 15:17:08,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:17:08,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-24 15:17:08,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:17:08,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-24 15:17:08,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-08-24 15:17:08,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 303 [2023-08-24 15:17:08,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 280 transitions, 5056 flow. Second operand has 15 states, 15 states have (on average 117.6) internal successors, (1764), 15 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:17:08,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:17:08,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 303 [2023-08-24 15:17:08,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:17:16,248 INFO L124 PetriNetUnfolderBase]: 30008/42332 cut-off events. [2023-08-24 15:17:16,249 INFO L125 PetriNetUnfolderBase]: For 3406459/3406459 co-relation queries the response was YES. [2023-08-24 15:17:16,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456437 conditions, 42332 events. 30008/42332 cut-off events. For 3406459/3406459 co-relation queries the response was YES. Maximal size of possible extension queue 1700. Compared 261821 event pairs, 7389 based on Foata normal form. 929/43259 useless extension candidates. Maximal degree in co-relation 455995. Up to 17685 conditions per place. [2023-08-24 15:17:16,994 INFO L140 encePairwiseOnDemand]: 294/303 looper letters, 636 selfloop transitions, 170 changer transitions 221/1027 dead transitions. [2023-08-24 15:17:16,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 1027 transitions, 20841 flow [2023-08-24 15:17:16,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-08-24 15:17:16,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-08-24 15:17:16,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 3948 transitions. [2023-08-24 15:17:16,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40717821782178215 [2023-08-24 15:17:16,997 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 3948 transitions. [2023-08-24 15:17:16,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 3948 transitions. [2023-08-24 15:17:16,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:17:16,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 3948 transitions. [2023-08-24 15:17:17,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 123.375) internal successors, (3948), 32 states have internal predecessors, (3948), 0 states have call successors, (0), 0 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 15:17:17,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 303.0) internal successors, (9999), 33 states have internal predecessors, (9999), 0 states have call successors, (0), 0 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 15:17:17,006 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 303.0) internal successors, (9999), 33 states have internal predecessors, (9999), 0 states have call successors, (0), 0 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 15:17:17,006 INFO L175 Difference]: Start difference. First operand has 228 places, 280 transitions, 5056 flow. Second operand 32 states and 3948 transitions. [2023-08-24 15:17:17,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 1027 transitions, 20841 flow [2023-08-24 15:17:23,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 1027 transitions, 18218 flow, removed 1080 selfloop flow, removed 34 redundant places. [2023-08-24 15:17:23,939 INFO L231 Difference]: Finished difference. Result has 214 places, 371 transitions, 6617 flow [2023-08-24 15:17:23,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=4418, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=6617, PETRI_PLACES=214, PETRI_TRANSITIONS=371} [2023-08-24 15:17:23,939 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 174 predicate places. [2023-08-24 15:17:23,939 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 371 transitions, 6617 flow [2023-08-24 15:17:23,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 117.6) internal successors, (1764), 15 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:17:23,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:17:23,940 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:17:23,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-24 15:17:24,144 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 15:17:24,144 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 15:17:24,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:17:24,144 INFO L85 PathProgramCache]: Analyzing trace with hash -248644329, now seen corresponding path program 11 times [2023-08-24 15:17:24,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:17:24,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793507992] [2023-08-24 15:17:24,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:17:24,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:17:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:17:24,231 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 15:17:24,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:17:24,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793507992] [2023-08-24 15:17:24,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793507992] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:17:24,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652219851] [2023-08-24 15:17:24,232 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 15:17:24,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:17:24,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:17:24,233 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 15:17:24,235 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 15:17:24,345 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 15:17:24,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:17:24,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-24 15:17:24,347 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:17:24,396 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 15:17:24,396 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:17:24,437 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 15:17:24,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652219851] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:17:24,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:17:24,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2023-08-24 15:17:24,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933875851] [2023-08-24 15:17:24,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:17:24,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-24 15:17:24,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:17:24,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-24 15:17:24,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-08-24 15:17:24,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 303 [2023-08-24 15:17:24,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 371 transitions, 6617 flow. Second operand has 16 states, 16 states have (on average 117.5) internal successors, (1880), 16 states have internal predecessors, (1880), 0 states have call successors, (0), 0 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 15:17:24,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:17:24,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 303 [2023-08-24 15:17:24,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:17:29,976 INFO L124 PetriNetUnfolderBase]: 22989/31915 cut-off events. [2023-08-24 15:17:29,976 INFO L125 PetriNetUnfolderBase]: For 1627254/1627254 co-relation queries the response was YES. [2023-08-24 15:17:30,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334412 conditions, 31915 events. 22989/31915 cut-off events. For 1627254/1627254 co-relation queries the response was YES. Maximal size of possible extension queue 1339. Compared 183490 event pairs, 7141 based on Foata normal form. 1535/33449 useless extension candidates. Maximal degree in co-relation 334300. Up to 20390 conditions per place. [2023-08-24 15:17:30,527 INFO L140 encePairwiseOnDemand]: 295/303 looper letters, 434 selfloop transitions, 112 changer transitions 0/546 dead transitions. [2023-08-24 15:17:30,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 546 transitions, 11435 flow [2023-08-24 15:17:30,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 15:17:30,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 15:17:30,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1229 transitions. [2023-08-24 15:17:30,529 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4056105610561056 [2023-08-24 15:17:30,529 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1229 transitions. [2023-08-24 15:17:30,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1229 transitions. [2023-08-24 15:17:30,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:17:30,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1229 transitions. [2023-08-24 15:17:30,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.9) internal successors, (1229), 10 states have internal predecessors, (1229), 0 states have call successors, (0), 0 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 15:17:30,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 303.0) internal successors, (3333), 11 states have internal predecessors, (3333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:17:30,533 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 303.0) internal successors, (3333), 11 states have internal predecessors, (3333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 15:17:30,533 INFO L175 Difference]: Start difference. First operand has 214 places, 371 transitions, 6617 flow. Second operand 10 states and 1229 transitions. [2023-08-24 15:17:30,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 546 transitions, 11435 flow [2023-08-24 15:17:35,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 546 transitions, 10386 flow, removed 485 selfloop flow, removed 18 redundant places. [2023-08-24 15:17:35,339 INFO L231 Difference]: Finished difference. Result has 192 places, 365 transitions, 6016 flow [2023-08-24 15:17:35,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=5792, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6016, PETRI_PLACES=192, PETRI_TRANSITIONS=365} [2023-08-24 15:17:35,340 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 152 predicate places. [2023-08-24 15:17:35,340 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 365 transitions, 6016 flow [2023-08-24 15:17:35,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 117.5) internal successors, (1880), 16 states have internal predecessors, (1880), 0 states have call successors, (0), 0 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 15:17:35,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:17:35,340 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:17:35,347 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 15:17:35,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-24 15:17:35,545 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 15:17:35,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:17:35,545 INFO L85 PathProgramCache]: Analyzing trace with hash 909702135, now seen corresponding path program 12 times [2023-08-24 15:17:35,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:17:35,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503932100] [2023-08-24 15:17:35,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:17:35,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:17:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:17:35,686 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 15:17:35,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:17:35,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503932100] [2023-08-24 15:17:35,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503932100] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:17:35,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824571218] [2023-08-24 15:17:35,687 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 15:17:35,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:17:35,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:17:35,688 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:17:35,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-24 15:17:35,977 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-24 15:17:35,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:17:35,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 15:17:35,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:17:36,059 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 15:17:36,059 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:17:36,120 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 15:17:36,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824571218] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:17:36,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:17:36,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2023-08-24 15:17:36,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132830798] [2023-08-24 15:17:36,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:17:36,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-24 15:17:36,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:17:36,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-24 15:17:36,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-08-24 15:17:36,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 303 [2023-08-24 15:17:36,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 365 transitions, 6016 flow. Second operand has 15 states, 15 states have (on average 120.86666666666666) internal successors, (1813), 15 states have internal predecessors, (1813), 0 states have call successors, (0), 0 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 15:17:36,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:17:36,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 303 [2023-08-24 15:17:36,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:17:41,386 INFO L124 PetriNetUnfolderBase]: 22729/31398 cut-off events. [2023-08-24 15:17:41,387 INFO L125 PetriNetUnfolderBase]: For 1143187/1143375 co-relation queries the response was YES. [2023-08-24 15:17:41,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310857 conditions, 31398 events. 22729/31398 cut-off events. For 1143187/1143375 co-relation queries the response was YES. Maximal size of possible extension queue 1281. Compared 178815 event pairs, 5107 based on Foata normal form. 2423/33801 useless extension candidates. Maximal degree in co-relation 310759. Up to 18255 conditions per place. [2023-08-24 15:17:41,702 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 452 selfloop transitions, 48 changer transitions 9/520 dead transitions. [2023-08-24 15:17:41,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 520 transitions, 9847 flow [2023-08-24 15:17:41,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 15:17:41,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 15:17:41,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1001 transitions. [2023-08-24 15:17:41,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41295379537953797 [2023-08-24 15:17:41,703 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1001 transitions. [2023-08-24 15:17:41,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1001 transitions. [2023-08-24 15:17:41,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:17:41,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1001 transitions. [2023-08-24 15:17:41,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.125) internal successors, (1001), 8 states have internal predecessors, (1001), 0 states have call successors, (0), 0 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 15:17:41,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 303.0) internal successors, (2727), 9 states have internal predecessors, (2727), 0 states have call successors, (0), 0 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 15:17:41,706 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 303.0) internal successors, (2727), 9 states have internal predecessors, (2727), 0 states have call successors, (0), 0 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 15:17:41,706 INFO L175 Difference]: Start difference. First operand has 192 places, 365 transitions, 6016 flow. Second operand 8 states and 1001 transitions. [2023-08-24 15:17:41,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 520 transitions, 9847 flow [2023-08-24 15:17:44,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 520 transitions, 9505 flow, removed 6 selfloop flow, removed 8 redundant places. [2023-08-24 15:17:44,284 INFO L231 Difference]: Finished difference. Result has 192 places, 366 transitions, 5944 flow [2023-08-24 15:17:44,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=5782, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5944, PETRI_PLACES=192, PETRI_TRANSITIONS=366} [2023-08-24 15:17:44,284 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 152 predicate places. [2023-08-24 15:17:44,284 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 366 transitions, 5944 flow [2023-08-24 15:17:44,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 120.86666666666666) internal successors, (1813), 15 states have internal predecessors, (1813), 0 states have call successors, (0), 0 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 15:17:44,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:17:44,285 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:17:44,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-24 15:17:44,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-24 15:17:44,489 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 15:17:44,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:17:44,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1021362029, now seen corresponding path program 13 times [2023-08-24 15:17:44,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:17:44,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380128177] [2023-08-24 15:17:44,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:17:44,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:17:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:17:44,919 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:17:44,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:17:44,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380128177] [2023-08-24 15:17:44,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380128177] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:17:44,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728224879] [2023-08-24 15:17:44,920 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 15:17:44,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:17:44,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:17:44,921 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:17:44,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-24 15:17:45,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:17:45,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-24 15:17:45,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:17:45,284 INFO L322 Elim1Store]: treesize reduction 14, result has 61.1 percent of original size [2023-08-24 15:17:45,284 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 40 [2023-08-24 15:17:45,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:17:45,316 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-08-24 15:17:45,342 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-08-24 15:17:45,367 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 15:17:45,368 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:18:06,128 WARN L234 SmtUtils]: Spent 16.11s on a formula simplification. DAG size of input: 71 DAG size of output: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 15:18:06,195 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 15:18:06,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728224879] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:18:06,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:18:06,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 32 [2023-08-24 15:18:06,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688860] [2023-08-24 15:18:06,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:18:06,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-24 15:18:06,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:18:06,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-24 15:18:06,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=904, Unknown=1, NotChecked=0, Total=1056 [2023-08-24 15:18:06,198 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 303 [2023-08-24 15:18:06,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 366 transitions, 5944 flow. Second operand has 33 states, 33 states have (on average 94.03030303030303) internal successors, (3103), 33 states have internal predecessors, (3103), 0 states have call successors, (0), 0 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 15:18:06,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:18:06,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 303 [2023-08-24 15:18:06,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 15:18:14,530 WARN L234 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 15:18:16,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:18:18,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:18:20,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:18:34,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:18:43,296 WARN L234 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 15:18:45,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:18:47,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:18:49,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:18:57,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:18:59,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:19:01,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:19:03,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:19:05,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:19:08,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:19:10,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:19:12,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:19:14,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:19:16,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:19:17,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:19:21,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:19:23,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:19:26,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:19:36,519 WARN L234 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 15:19:39,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:19:41,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:19:43,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:19:45,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:19:53,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:19:59,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:20:01,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:20:03,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:20:05,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:20:07,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:20:09,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:20:12,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:20:14,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:20:16,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:20:18,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:20:20,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:20:22,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:20:24,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:20:25,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:20:27,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:20:29,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:20:32,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:20:34,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:20:36,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:20:44,396 WARN L234 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 15:20:46,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:20:48,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:20:50,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:20:53,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:20:55,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:20:57,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:20:59,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:21:09,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:21:11,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:21:13,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:21:15,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:21:17,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:21:19,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:21:22,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:21:24,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:21:27,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:21:30,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:21:32,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:21:34,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:21:36,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:21:38,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:21:40,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:21:42,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:21:44,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:21:46,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:21:48,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:21:56,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:22:01,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 15:22:15,290 INFO L124 PetriNetUnfolderBase]: 85081/116864 cut-off events. [2023-08-24 15:22:15,290 INFO L125 PetriNetUnfolderBase]: For 4404540/4404540 co-relation queries the response was YES. [2023-08-24 15:22:16,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1184074 conditions, 116864 events. 85081/116864 cut-off events. For 4404540/4404540 co-relation queries the response was YES. Maximal size of possible extension queue 4367. Compared 779131 event pairs, 11599 based on Foata normal form. 48/116912 useless extension candidates. Maximal degree in co-relation 1183974. Up to 40208 conditions per place. [2023-08-24 15:22:17,194 INFO L140 encePairwiseOnDemand]: 288/303 looper letters, 658 selfloop transitions, 560 changer transitions 1672/2890 dead transitions. [2023-08-24 15:22:17,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 2890 transitions, 56060 flow [2023-08-24 15:22:17,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-08-24 15:22:17,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2023-08-24 15:22:17,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 8907 transitions. [2023-08-24 15:22:17,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3378855126892 [2023-08-24 15:22:17,207 INFO L72 ComplementDD]: Start complementDD. Operand 87 states and 8907 transitions. [2023-08-24 15:22:17,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 8907 transitions. [2023-08-24 15:22:17,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 15:22:17,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 87 states and 8907 transitions. [2023-08-24 15:22:17,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 88 states, 87 states have (on average 102.37931034482759) internal successors, (8907), 87 states have internal predecessors, (8907), 0 states have call successors, (0), 0 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 15:22:17,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 88 states, 88 states have (on average 303.0) internal successors, (26664), 88 states have internal predecessors, (26664), 0 states have call successors, (0), 0 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 15:22:17,236 INFO L81 ComplementDD]: Finished complementDD. Result has 88 states, 88 states have (on average 303.0) internal successors, (26664), 88 states have internal predecessors, (26664), 0 states have call successors, (0), 0 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 15:22:17,236 INFO L175 Difference]: Start difference. First operand has 192 places, 366 transitions, 5944 flow. Second operand 87 states and 8907 transitions. [2023-08-24 15:22:17,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 2890 transitions, 56060 flow [2023-08-24 15:22:37,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 2890 transitions, 55354 flow, removed 213 selfloop flow, removed 5 redundant places. [2023-08-24 15:22:37,426 INFO L231 Difference]: Finished difference. Result has 342 places, 815 transitions, 15999 flow [2023-08-24 15:22:37,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=5901, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=87, PETRI_FLOW=15999, PETRI_PLACES=342, PETRI_TRANSITIONS=815} [2023-08-24 15:22:37,427 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 302 predicate places. [2023-08-24 15:22:37,427 INFO L495 AbstractCegarLoop]: Abstraction has has 342 places, 815 transitions, 15999 flow [2023-08-24 15:22:37,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 94.03030303030303) internal successors, (3103), 33 states have internal predecessors, (3103), 0 states have call successors, (0), 0 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 15:22:37,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 15:22:37,427 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 15:22:37,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-08-24 15:22:37,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-24 15:22:37,632 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 15:22:37,632 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 15:22:37,632 INFO L85 PathProgramCache]: Analyzing trace with hash 854374735, now seen corresponding path program 14 times [2023-08-24 15:22:37,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 15:22:37,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704127627] [2023-08-24 15:22:37,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 15:22:37,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 15:22:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 15:22:38,277 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-24 15:22:38,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 15:22:38,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704127627] [2023-08-24 15:22:38,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704127627] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 15:22:38,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013423514] [2023-08-24 15:22:38,277 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 15:22:38,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 15:22:38,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 15:22:38,278 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 15:22:38,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-24 15:22:38,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 15:22:38,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 15:22:38,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-24 15:22:38,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 15:22:38,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 15:22:38,638 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 38 [2023-08-24 15:22:38,676 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:22:38,677 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 32 [2023-08-24 15:22:38,742 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:22:38,743 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 41 [2023-08-24 15:22:38,881 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:22:38,881 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 26 [2023-08-24 15:22:38,934 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:22:38,934 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 15:22:52,321 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:22:52,322 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 78 [2023-08-24 15:22:52,328 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 15:22:52,328 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 7 [2023-08-24 15:22:52,330 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 15:22:52,389 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 15:22:52,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013423514] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 15:22:52,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 15:22:52,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 38 [2023-08-24 15:22:52,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848581568] [2023-08-24 15:22:52,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 15:22:52,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-08-24 15:22:52,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 15:22:52,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-08-24 15:22:52,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=1284, Unknown=25, NotChecked=0, Total=1560 [2023-08-24 15:22:52,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 303 [2023-08-24 15:22:52,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 815 transitions, 15999 flow. Second operand has 40 states, 40 states have (on average 99.175) internal successors, (3967), 40 states have internal predecessors, (3967), 0 states have call successors, (0), 0 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 15:22:52,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 15:22:52,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 303 [2023-08-24 15:22:52,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand