/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 16:22:44,362 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 16:22:44,442 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 16:22:44,478 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 16:22:44,478 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 16:22:44,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 16:22:44,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 16:22:44,480 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 16:22:44,480 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 16:22:44,484 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 16:22:44,484 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 16:22:44,484 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 16:22:44,485 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 16:22:44,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 16:22:44,486 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 16:22:44,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 16:22:44,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 16:22:44,487 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 16:22:44,487 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 16:22:44,487 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 16:22:44,487 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 16:22:44,488 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 16:22:44,488 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 16:22:44,489 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 16:22:44,489 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 16:22:44,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:22:44,489 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 16:22:44,490 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 16:22:44,490 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 16:22:44,490 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 16:22:44,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 16:22:44,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 16:22:44,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-17 16:22:44,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 16:22:44,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 16:22:44,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 16:22:44,723 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 16:22:44,724 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 16:22:44,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c [2023-11-17 16:22:45,927 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 16:22:46,112 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 16:22:46,113 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c [2023-11-17 16:22:46,121 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee39ae3ea/91a4fca785574bcf8c88013e5162d5c6/FLAG98bbf633a [2023-11-17 16:22:46,496 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee39ae3ea/91a4fca785574bcf8c88013e5162d5c6 [2023-11-17 16:22:46,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 16:22:46,502 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 16:22:46,504 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 16:22:46,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 16:22:46,508 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 16:22:46,508 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:22:46" (1/1) ... [2023-11-17 16:22:46,509 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@456f025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:22:46, skipping insertion in model container [2023-11-17 16:22:46,509 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:22:46" (1/1) ... [2023-11-17 16:22:46,533 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 16:22:46,668 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c[2572,2585] [2023-11-17 16:22:46,680 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:22:46,687 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 16:22:46,704 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-mts.wvr.c[2572,2585] [2023-11-17 16:22:46,708 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:22:46,714 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 16:22:46,714 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 16:22:46,719 INFO L206 MainTranslator]: Completed translation [2023-11-17 16:22:46,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:22:46 WrapperNode [2023-11-17 16:22:46,719 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 16:22:46,720 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 16:22:46,720 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 16:22:46,720 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 16:22:46,726 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:22:46" (1/1) ... [2023-11-17 16:22:46,733 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:22:46" (1/1) ... [2023-11-17 16:22:46,760 INFO L138 Inliner]: procedures = 25, calls = 46, calls flagged for inlining = 13, calls inlined = 19, statements flattened = 234 [2023-11-17 16:22:46,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 16:22:46,761 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 16:22:46,761 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 16:22:46,762 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 16:22:46,769 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:22:46" (1/1) ... [2023-11-17 16:22:46,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:22:46" (1/1) ... [2023-11-17 16:22:46,772 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:22:46" (1/1) ... [2023-11-17 16:22:46,773 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:22:46" (1/1) ... [2023-11-17 16:22:46,780 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:22:46" (1/1) ... [2023-11-17 16:22:46,786 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:22:46" (1/1) ... [2023-11-17 16:22:46,788 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:22:46" (1/1) ... [2023-11-17 16:22:46,790 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:22:46" (1/1) ... [2023-11-17 16:22:46,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 16:22:46,793 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 16:22:46,793 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 16:22:46,793 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 16:22:46,794 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:22:46" (1/1) ... [2023-11-17 16:22:46,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:22:46,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:46,820 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 16:22:46,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 16:22:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 16:22:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 16:22:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 16:22:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 16:22:46,850 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 16:22:46,851 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 16:22:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 16:22:46,851 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 16:22:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-17 16:22:46,851 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-17 16:22:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 16:22:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 16:22:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 16:22:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 16:22:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 16:22:46,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 16:22:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 16:22:46,853 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 16:22:46,947 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 16:22:46,949 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 16:22:47,288 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 16:22:47,438 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 16:22:47,438 INFO L307 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-17 16:22:47,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:22:47 BoogieIcfgContainer [2023-11-17 16:22:47,440 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 16:22:47,443 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 16:22:47,443 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 16:22:47,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 16:22:47,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 04:22:46" (1/3) ... [2023-11-17 16:22:47,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5393f46b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:22:47, skipping insertion in model container [2023-11-17 16:22:47,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:22:46" (2/3) ... [2023-11-17 16:22:47,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5393f46b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:22:47, skipping insertion in model container [2023-11-17 16:22:47,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:22:47" (3/3) ... [2023-11-17 16:22:47,448 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2023-11-17 16:22:47,461 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 16:22:47,461 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 16:22:47,461 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 16:22:47,542 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-17 16:22:47,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 233 transitions, 487 flow [2023-11-17 16:22:47,681 INFO L124 PetriNetUnfolderBase]: 18/230 cut-off events. [2023-11-17 16:22:47,681 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 16:22:47,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 230 events. 18/230 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 342 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 190. Up to 2 conditions per place. [2023-11-17 16:22:47,696 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 233 transitions, 487 flow [2023-11-17 16:22:47,705 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 211 places, 219 transitions, 456 flow [2023-11-17 16:22:47,711 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 16:22:47,725 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 219 transitions, 456 flow [2023-11-17 16:22:47,728 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 211 places, 219 transitions, 456 flow [2023-11-17 16:22:47,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 211 places, 219 transitions, 456 flow [2023-11-17 16:22:47,786 INFO L124 PetriNetUnfolderBase]: 18/219 cut-off events. [2023-11-17 16:22:47,786 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 16:22:47,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 219 events. 18/219 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 341 event pairs, 0 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 190. Up to 2 conditions per place. [2023-11-17 16:22:47,796 INFO L119 LiptonReduction]: Number of co-enabled transitions 9720 [2023-11-17 16:22:53,617 INFO L134 LiptonReduction]: Checked pairs total: 9110 [2023-11-17 16:22:53,617 INFO L136 LiptonReduction]: Total number of compositions: 239 [2023-11-17 16:22:53,629 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 16:22:53,634 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1f70d16f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 16:22:53,635 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-17 16:22:53,639 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 16:22:53,639 INFO L124 PetriNetUnfolderBase]: 4/25 cut-off events. [2023-11-17 16:22:53,640 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 16:22:53,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:53,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:22:53,641 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:22:53,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:53,644 INFO L85 PathProgramCache]: Analyzing trace with hash -807965745, now seen corresponding path program 1 times [2023-11-17 16:22:53,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:53,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848361553] [2023-11-17 16:22:53,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:53,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:54,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:22:54,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:54,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848361553] [2023-11-17 16:22:54,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848361553] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:22:54,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:22:54,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 16:22:54,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438504202] [2023-11-17 16:22:54,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:22:54,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:22:54,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:54,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:22:54,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:22:54,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 472 [2023-11-17 16:22:54,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:54,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:54,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 472 [2023-11-17 16:22:54,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:54,331 INFO L124 PetriNetUnfolderBase]: 723/1054 cut-off events. [2023-11-17 16:22:54,331 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2023-11-17 16:22:54,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2223 conditions, 1054 events. 723/1054 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3719 event pairs, 253 based on Foata normal form. 1/826 useless extension candidates. Maximal degree in co-relation 1834. Up to 632 conditions per place. [2023-11-17 16:22:54,339 INFO L140 encePairwiseOnDemand]: 467/472 looper letters, 42 selfloop transitions, 4 changer transitions 1/47 dead transitions. [2023-11-17 16:22:54,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 47 transitions, 221 flow [2023-11-17 16:22:54,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:22:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:22:54,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 654 transitions. [2023-11-17 16:22:54,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.461864406779661 [2023-11-17 16:22:54,360 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 654 transitions. [2023-11-17 16:22:54,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 654 transitions. [2023-11-17 16:22:54,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:54,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 654 transitions. [2023-11-17 16:22:54,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:54,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 472.0) internal successors, (1888), 4 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:54,377 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 472.0) internal successors, (1888), 4 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:54,379 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 70 flow. Second operand 3 states and 654 transitions. [2023-11-17 16:22:54,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 47 transitions, 221 flow [2023-11-17 16:22:54,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 47 transitions, 199 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-17 16:22:54,386 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 84 flow [2023-11-17 16:22:54,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=29, PETRI_TRANSITIONS=29} [2023-11-17 16:22:54,390 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -3 predicate places. [2023-11-17 16:22:54,390 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 84 flow [2023-11-17 16:22:54,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:54,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:54,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:22:54,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 16:22:54,392 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:22:54,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:54,399 INFO L85 PathProgramCache]: Analyzing trace with hash -2070434521, now seen corresponding path program 1 times [2023-11-17 16:22:54,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:54,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635837587] [2023-11-17 16:22:54,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:54,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:54,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:54,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:22:54,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:54,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635837587] [2023-11-17 16:22:54,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635837587] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:22:54,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:22:54,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 16:22:54,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605563848] [2023-11-17 16:22:54,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:22:54,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:22:54,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:54,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:22:54,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:22:54,574 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 472 [2023-11-17 16:22:54,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 29 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:54,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:54,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 472 [2023-11-17 16:22:54,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:54,747 INFO L124 PetriNetUnfolderBase]: 723/1055 cut-off events. [2023-11-17 16:22:54,748 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2023-11-17 16:22:54,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2497 conditions, 1055 events. 723/1055 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3650 event pairs, 506 based on Foata normal form. 0/910 useless extension candidates. Maximal degree in co-relation 867. Up to 1055 conditions per place. [2023-11-17 16:22:54,754 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 28 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-11-17 16:22:54,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 30 transitions, 146 flow [2023-11-17 16:22:54,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:22:54,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:22:54,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 604 transitions. [2023-11-17 16:22:54,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4265536723163842 [2023-11-17 16:22:54,757 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 604 transitions. [2023-11-17 16:22:54,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 604 transitions. [2023-11-17 16:22:54,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:54,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 604 transitions. [2023-11-17 16:22:54,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:54,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 472.0) internal successors, (1888), 4 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:54,763 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 472.0) internal successors, (1888), 4 states have internal predecessors, (1888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:54,763 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 84 flow. Second operand 3 states and 604 transitions. [2023-11-17 16:22:54,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 30 transitions, 146 flow [2023-11-17 16:22:54,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 142 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 16:22:54,766 INFO L231 Difference]: Finished difference. Result has 31 places, 30 transitions, 92 flow [2023-11-17 16:22:54,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=31, PETRI_TRANSITIONS=30} [2023-11-17 16:22:54,767 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2023-11-17 16:22:54,767 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 30 transitions, 92 flow [2023-11-17 16:22:54,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:54,768 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:54,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:22:54,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 16:22:54,772 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:22:54,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:54,779 INFO L85 PathProgramCache]: Analyzing trace with hash 863099602, now seen corresponding path program 1 times [2023-11-17 16:22:54,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:54,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926802932] [2023-11-17 16:22:54,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:54,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:54,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:54,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:22:54,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:54,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926802932] [2023-11-17 16:22:54,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926802932] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:54,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100584106] [2023-11-17 16:22:54,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:54,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:54,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:54,911 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:22:54,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-17 16:22:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:55,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 16:22:55,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:55,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:22:55,122 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:55,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:22:55,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100584106] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:55,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-17 16:22:55,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2023-11-17 16:22:55,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680811373] [2023-11-17 16:22:55,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:22:55,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 16:22:55,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:55,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 16:22:55,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-17 16:22:55,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 472 [2023-11-17 16:22:55,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 30 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 190.4) internal successors, (952), 5 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:55,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:55,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 472 [2023-11-17 16:22:55,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:55,328 INFO L124 PetriNetUnfolderBase]: 658/953 cut-off events. [2023-11-17 16:22:55,328 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2023-11-17 16:22:55,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2167 conditions, 953 events. 658/953 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3454 event pairs, 220 based on Foata normal form. 0/848 useless extension candidates. Maximal degree in co-relation 2154. Up to 493 conditions per place. [2023-11-17 16:22:55,334 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 39 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2023-11-17 16:22:55,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 45 transitions, 222 flow [2023-11-17 16:22:55,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:22:55,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 16:22:55,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 971 transitions. [2023-11-17 16:22:55,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4114406779661017 [2023-11-17 16:22:55,338 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 971 transitions. [2023-11-17 16:22:55,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 971 transitions. [2023-11-17 16:22:55,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:55,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 971 transitions. [2023-11-17 16:22:55,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 194.2) internal successors, (971), 5 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:55,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 472.0) internal successors, (2832), 6 states have internal predecessors, (2832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:55,346 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 472.0) internal successors, (2832), 6 states have internal predecessors, (2832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:55,346 INFO L175 Difference]: Start difference. First operand has 31 places, 30 transitions, 92 flow. Second operand 5 states and 971 transitions. [2023-11-17 16:22:55,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 45 transitions, 222 flow [2023-11-17 16:22:55,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 45 transitions, 216 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-17 16:22:55,350 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 113 flow [2023-11-17 16:22:55,350 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2023-11-17 16:22:55,351 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2023-11-17 16:22:55,351 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 113 flow [2023-11-17 16:22:55,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 190.4) internal successors, (952), 5 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:55,352 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:55,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:22:55,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-17 16:22:55,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:55,559 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:22:55,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:55,559 INFO L85 PathProgramCache]: Analyzing trace with hash 118150923, now seen corresponding path program 1 times [2023-11-17 16:22:55,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:55,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209483280] [2023-11-17 16:22:55,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:55,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:55,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:22:55,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:55,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209483280] [2023-11-17 16:22:55,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209483280] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:22:55,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:22:55,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 16:22:55,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940052058] [2023-11-17 16:22:55,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:22:55,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 16:22:55,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:22:55,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 16:22:55,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 16:22:55,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 472 [2023-11-17 16:22:55,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 202.75) internal successors, (811), 4 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:55,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:22:55,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 472 [2023-11-17 16:22:55,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:22:55,821 INFO L124 PetriNetUnfolderBase]: 706/1023 cut-off events. [2023-11-17 16:22:55,822 INFO L125 PetriNetUnfolderBase]: For 773/773 co-relation queries the response was YES. [2023-11-17 16:22:55,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2802 conditions, 1023 events. 706/1023 cut-off events. For 773/773 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3507 event pairs, 355 based on Foata normal form. 70/1016 useless extension candidates. Maximal degree in co-relation 2781. Up to 782 conditions per place. [2023-11-17 16:22:55,828 INFO L140 encePairwiseOnDemand]: 468/472 looper letters, 44 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2023-11-17 16:22:55,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 48 transitions, 275 flow [2023-11-17 16:22:55,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:22:55,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 16:22:55,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 829 transitions. [2023-11-17 16:22:55,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4390889830508475 [2023-11-17 16:22:55,831 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 829 transitions. [2023-11-17 16:22:55,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 829 transitions. [2023-11-17 16:22:55,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:22:55,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 829 transitions. [2023-11-17 16:22:55,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 207.25) internal successors, (829), 4 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:55,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 472.0) internal successors, (2360), 5 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:55,838 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 472.0) internal successors, (2360), 5 states have internal predecessors, (2360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:55,838 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 113 flow. Second operand 4 states and 829 transitions. [2023-11-17 16:22:55,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 48 transitions, 275 flow [2023-11-17 16:22:55,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 48 transitions, 264 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 16:22:55,840 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 125 flow [2023-11-17 16:22:55,841 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2023-11-17 16:22:55,841 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2023-11-17 16:22:55,841 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 125 flow [2023-11-17 16:22:55,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 202.75) internal successors, (811), 4 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:22:55,842 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:22:55,842 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:22:55,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 16:22:55,842 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:22:55,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:22:55,843 INFO L85 PathProgramCache]: Analyzing trace with hash -482094159, now seen corresponding path program 1 times [2023-11-17 16:22:55,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:22:55,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258484320] [2023-11-17 16:22:55,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:55,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:22:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:56,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:22:56,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:22:56,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258484320] [2023-11-17 16:22:56,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258484320] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:22:56,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033097783] [2023-11-17 16:22:56,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:22:56,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:22:56,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:22:56,963 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:22:56,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-17 16:22:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:22:57,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-17 16:22:57,078 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:22:57,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 16:22:57,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 16:22:57,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 16:22:57,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:22:57,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 16:22:57,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 46 [2023-11-17 16:22:57,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:22:57,996 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:22:58,715 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (let ((.cse0 (+ |c_thread1Thread1of1ForFork2_plus_~a#1| |c_thread1Thread1of1ForFork2_plus_~b#1|))) (or (< .cse0 0) (let ((.cse1 (+ c_~sum~0 c_~mts2~0)) (.cse4 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4)))) (and (or (< .cse1 (+ c_~mts3~0 1)) (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse2 (select .cse3 .cse5))) (or (< (+ c_~mts3~0 .cse2) 0) (= (+ c_~mts1~0 (select .cse3 .cse4)) (+ c_~sum~0 c_~mts2~0 .cse2))))))) (or (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse6 (+ c_~mts3~0 (select .cse7 .cse5)))) (or (< .cse6 0) (= (+ c_~mts1~0 (select .cse7 .cse4)) .cse6))))) (< c_~mts3~0 .cse1)) (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse8 (select .cse10 .cse5))) (let ((.cse9 (+ c_~sum~0 c_~mts2~0 .cse8))) (or (< 0 (+ c_~mts3~0 .cse8 1)) (< .cse9 1) (= (+ c_~mts1~0 (select .cse10 .cse4)) .cse9)))))) (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse12 (+ c_~mts1~0 (select .cse13 .cse4))) (.cse11 (select .cse13 .cse5))) (or (< 0 (+ c_~mts3~0 .cse11 1)) (= .cse12 0) (= .cse12 (+ c_~sum~0 c_~mts2~0 .cse11)))))) (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse16 (select .cse17 .cse5))) (let ((.cse14 (+ c_~mts3~0 .cse16)) (.cse15 (+ c_~mts1~0 (select .cse17 .cse4)))) (or (< .cse14 0) (= .cse15 .cse14) (= .cse15 (+ c_~sum~0 c_~mts2~0 .cse16))))))) (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse5))) (or (< 0 (+ c_~sum~0 c_~mts2~0 .cse18)) (< 0 (+ c_~mts3~0 .cse18 1)) (= (+ c_~mts1~0 (select .cse19 .cse4)) 0))))))) (< 2147483647 .cse0))) (or (and (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse20 (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base) .cse5)))) (or (< .cse20 0) (= .cse20 0)))) (forall ((v_ArrVal_112 (Array Int Int))) (<= (+ c_~sum~0 c_~mts2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base) .cse5)) 0))) (< (+ |c_thread1Thread1of1ForFork2_plus_~a#1| |c_thread1Thread1of1ForFork2_plus_~b#1| 2147483648) 0) (< 0 (+ |c_thread1Thread1of1ForFork2_plus_~a#1| |c_thread1Thread1of1ForFork2_plus_~b#1| 1))))) is different from false [2023-11-17 16:22:59,608 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (+ c_~sum~0 c_~mts2~0)) (.cse5 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_111 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111))) (let ((.cse0 (+ c_~mts1~0 (select (select .cse6 c_~A~0.base) c_~A~0.offset)))) (or (< 2147483647 .cse0) (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse4 (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse2 (select .cse4 .cse5))) (let ((.cse1 (+ (select .cse4 c_~A~0.offset) c_~mts1~0)) (.cse3 (+ c_~mts3~0 .cse2))) (or (= .cse1 (+ c_~sum~0 .cse2 c_~mts2~0)) (= .cse1 .cse3) (< .cse3 0)))))) (< .cse0 0))))) (forall ((v_ArrVal_111 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111))) (let ((.cse7 (+ c_~mts1~0 (select (select .cse11 c_~A~0.base) c_~A~0.offset)))) (or (< 2147483647 .cse7) (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse10 (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse8 (select .cse10 .cse5)) (.cse9 (+ (select .cse10 c_~A~0.offset) c_~mts1~0))) (or (< 0 (+ c_~mts3~0 .cse8 1)) (= .cse9 (+ c_~sum~0 .cse8 c_~mts2~0)) (= .cse9 0))))) (< .cse7 0))))) (or (< c_~mts3~0 .cse12) (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111))) (let ((.cse14 (select (store .cse16 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse13 (+ c_~mts1~0 (select (select .cse16 c_~A~0.base) c_~A~0.offset))) (.cse15 (+ c_~mts3~0 (select .cse14 .cse5)))) (or (< 2147483647 .cse13) (= (+ (select .cse14 c_~A~0.offset) c_~mts1~0) .cse15) (< .cse13 0) (< .cse15 0))))))) (forall ((v_ArrVal_111 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111))) (let ((.cse18 (select (select .cse17 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_112 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base) .cse5) c_~mts2~0) 0)) (< 0 (+ c_~mts1~0 .cse18 1)) (< (+ c_~mts1~0 .cse18 2147483648) 0))))) (forall ((v_ArrVal_111 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111))) (let ((.cse21 (select (select .cse20 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse19 (+ c_~mts3~0 (select (select (store .cse20 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base) .cse5)))) (or (= .cse19 0) (< .cse19 0)))) (< 0 (+ c_~mts1~0 .cse21 1)) (< (+ c_~mts1~0 .cse21 2147483648) 0))))) (forall ((v_ArrVal_111 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111))) (let ((.cse22 (+ c_~mts1~0 (select (select .cse25 c_~A~0.base) c_~A~0.offset)))) (or (< 2147483647 .cse22) (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse24 (select (store .cse25 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse23 (select .cse24 .cse5))) (or (< 0 (+ c_~mts3~0 .cse23 1)) (< 0 (+ c_~sum~0 .cse23 c_~mts2~0)) (= (+ (select .cse24 c_~A~0.offset) c_~mts1~0) 0))))) (< .cse22 0))))) (forall ((v_ArrVal_111 (Array Int Int))) (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111))) (let ((.cse26 (+ c_~mts1~0 (select (select .cse30 c_~A~0.base) c_~A~0.offset)))) (or (< 2147483647 .cse26) (< .cse26 0) (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse28 (select (store .cse30 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse27 (select .cse28 .cse5))) (let ((.cse29 (+ c_~sum~0 .cse27 c_~mts2~0))) (or (< 0 (+ c_~mts3~0 .cse27 1)) (= (+ (select .cse28 c_~A~0.offset) c_~mts1~0) .cse29) (< .cse29 1)))))))))) (or (< .cse12 (+ c_~mts3~0 1)) (forall ((v_ArrVal_111 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111))) (let ((.cse31 (select (store .cse34 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_112) c_~A~0.base))) (let ((.cse33 (+ c_~mts1~0 (select (select .cse34 c_~A~0.base) c_~A~0.offset))) (.cse32 (select .cse31 .cse5))) (or (= (+ (select .cse31 c_~A~0.offset) c_~mts1~0) (+ c_~sum~0 .cse32 c_~mts2~0)) (< 2147483647 .cse33) (< .cse33 0) (< (+ c_~mts3~0 .cse32) 0))))))))) is different from false [2023-11-17 16:23:00,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:00,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 102 [2023-11-17 16:23:00,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:00,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 985 treesize of output 937 [2023-11-17 16:23:00,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:00,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 341 treesize of output 293 [2023-11-17 16:23:00,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:00,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 193 treesize of output 183 [2023-11-17 16:23:00,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:00,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 207 treesize of output 179 [2023-11-17 16:23:01,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:01,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 103 [2023-11-17 16:23:01,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:01,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1001 treesize of output 953 [2023-11-17 16:23:01,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:01,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 349 treesize of output 301 [2023-11-17 16:23:01,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:01,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 187 [2023-11-17 16:23:01,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:01,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 211 treesize of output 183 [2023-11-17 16:23:02,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:02,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 89 [2023-11-17 16:23:02,787 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:23:02,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 785 treesize of output 749 [2023-11-17 16:23:02,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:23:02,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 203 [2023-11-17 16:23:02,842 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:23:02,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 409 treesize of output 381 [2023-11-17 16:23:02,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 275 treesize of output 227 [2023-11-17 16:23:03,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:03,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 107 [2023-11-17 16:23:03,142 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:23:03,150 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:23:03,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 336 treesize of output 312 [2023-11-17 16:23:03,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:23:03,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 143 [2023-11-17 16:23:03,189 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:23:03,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 290 treesize of output 258 [2023-11-17 16:23:03,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:03,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 187 treesize of output 127 [2023-11-17 16:23:03,338 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:23:03,349 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:23:03,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 374 treesize of output 342 [2023-11-17 16:23:03,380 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:23:03,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 335 treesize of output 291 [2023-11-17 16:23:03,418 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:23:03,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 132 [2023-11-17 16:23:03,533 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:23:03,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 1 [2023-11-17 16:23:03,543 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:23:03,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 1 [2023-11-17 16:23:03,553 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:23:03,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 212 treesize of output 1 [2023-11-17 16:23:03,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:23:03,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033097783] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:23:03,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:23:03,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2023-11-17 16:23:03,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868945573] [2023-11-17 16:23:03,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:23:03,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-17 16:23:03,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:23:03,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-17 16:23:03,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=694, Unknown=2, NotChecked=110, Total=930 [2023-11-17 16:23:03,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 472 [2023-11-17 16:23:03,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 125 flow. Second operand has 31 states, 31 states have (on average 137.32258064516128) internal successors, (4257), 31 states have internal predecessors, (4257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:03,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:23:03,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 472 [2023-11-17 16:23:03,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:23:05,976 INFO L124 PetriNetUnfolderBase]: 1437/2069 cut-off events. [2023-11-17 16:23:05,977 INFO L125 PetriNetUnfolderBase]: For 1541/1541 co-relation queries the response was YES. [2023-11-17 16:23:05,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6167 conditions, 2069 events. 1437/2069 cut-off events. For 1541/1541 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8143 event pairs, 145 based on Foata normal form. 1/1922 useless extension candidates. Maximal degree in co-relation 5355. Up to 1072 conditions per place. [2023-11-17 16:23:05,989 INFO L140 encePairwiseOnDemand]: 459/472 looper letters, 105 selfloop transitions, 32 changer transitions 1/138 dead transitions. [2023-11-17 16:23:05,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 138 transitions, 760 flow [2023-11-17 16:23:05,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-17 16:23:05,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-17 16:23:05,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1618 transitions. [2023-11-17 16:23:05,995 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31163328197226503 [2023-11-17 16:23:05,995 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1618 transitions. [2023-11-17 16:23:05,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1618 transitions. [2023-11-17 16:23:05,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:23:05,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1618 transitions. [2023-11-17 16:23:05,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 147.0909090909091) internal successors, (1618), 11 states have internal predecessors, (1618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:06,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 472.0) internal successors, (5664), 12 states have internal predecessors, (5664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:06,006 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 472.0) internal successors, (5664), 12 states have internal predecessors, (5664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:06,006 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 125 flow. Second operand 11 states and 1618 transitions. [2023-11-17 16:23:06,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 138 transitions, 760 flow [2023-11-17 16:23:06,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 138 transitions, 729 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-11-17 16:23:06,014 INFO L231 Difference]: Finished difference. Result has 51 places, 59 transitions, 362 flow [2023-11-17 16:23:06,014 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=362, PETRI_PLACES=51, PETRI_TRANSITIONS=59} [2023-11-17 16:23:06,017 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2023-11-17 16:23:06,017 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 59 transitions, 362 flow [2023-11-17 16:23:06,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 137.32258064516128) internal successors, (4257), 31 states have internal predecessors, (4257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:06,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:23:06,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:23:06,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-17 16:23:06,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:23:06,225 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:23:06,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:23:06,225 INFO L85 PathProgramCache]: Analyzing trace with hash -882043591, now seen corresponding path program 2 times [2023-11-17 16:23:06,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:23:06,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479811100] [2023-11-17 16:23:06,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:23:06,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:23:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:23:07,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:23:07,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:23:07,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479811100] [2023-11-17 16:23:07,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479811100] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:23:07,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191907057] [2023-11-17 16:23:07,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:23:07,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:23:07,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:23:07,072 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:23:07,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-17 16:23:07,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:23:07,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:23:07,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-17 16:23:07,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:23:07,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 46 [2023-11-17 16:23:07,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:23:07,736 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:23:08,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:08,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 89 [2023-11-17 16:23:08,291 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 16:23:08,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 1 [2023-11-17 16:23:08,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:23:08,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191907057] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:23:08,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:23:08,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 25 [2023-11-17 16:23:08,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861913225] [2023-11-17 16:23:08,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:23:08,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-17 16:23:08,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:23:08,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-17 16:23:08,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2023-11-17 16:23:08,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 472 [2023-11-17 16:23:08,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 59 transitions, 362 flow. Second operand has 27 states, 27 states have (on average 144.66666666666666) internal successors, (3906), 27 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:08,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:23:08,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 472 [2023-11-17 16:23:08,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:23:10,256 INFO L124 PetriNetUnfolderBase]: 2243/3208 cut-off events. [2023-11-17 16:23:10,256 INFO L125 PetriNetUnfolderBase]: For 4906/4906 co-relation queries the response was YES. [2023-11-17 16:23:10,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11624 conditions, 3208 events. 2243/3208 cut-off events. For 4906/4906 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 13865 event pairs, 208 based on Foata normal form. 1/3018 useless extension candidates. Maximal degree in co-relation 9870. Up to 1930 conditions per place. [2023-11-17 16:23:10,279 INFO L140 encePairwiseOnDemand]: 458/472 looper letters, 146 selfloop transitions, 102 changer transitions 1/249 dead transitions. [2023-11-17 16:23:10,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 249 transitions, 1850 flow [2023-11-17 16:23:10,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-17 16:23:10,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-11-17 16:23:10,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3895 transitions. [2023-11-17 16:23:10,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31738917861799215 [2023-11-17 16:23:10,291 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 3895 transitions. [2023-11-17 16:23:10,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 3895 transitions. [2023-11-17 16:23:10,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:23:10,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 3895 transitions. [2023-11-17 16:23:10,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 149.80769230769232) internal successors, (3895), 26 states have internal predecessors, (3895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:10,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 472.0) internal successors, (12744), 27 states have internal predecessors, (12744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:10,318 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 472.0) internal successors, (12744), 27 states have internal predecessors, (12744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:10,318 INFO L175 Difference]: Start difference. First operand has 51 places, 59 transitions, 362 flow. Second operand 26 states and 3895 transitions. [2023-11-17 16:23:10,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 249 transitions, 1850 flow [2023-11-17 16:23:10,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 249 transitions, 1726 flow, removed 61 selfloop flow, removed 1 redundant places. [2023-11-17 16:23:10,331 INFO L231 Difference]: Finished difference. Result has 90 places, 152 transitions, 1296 flow [2023-11-17 16:23:10,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1296, PETRI_PLACES=90, PETRI_TRANSITIONS=152} [2023-11-17 16:23:10,334 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 58 predicate places. [2023-11-17 16:23:10,334 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 152 transitions, 1296 flow [2023-11-17 16:23:10,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 144.66666666666666) internal successors, (3906), 27 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:10,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:23:10,336 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:23:10,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-17 16:23:10,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:23:10,545 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:23:10,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:23:10,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1617055715, now seen corresponding path program 3 times [2023-11-17 16:23:10,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:23:10,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999845788] [2023-11-17 16:23:10,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:23:10,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:23:10,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:23:11,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:23:11,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:23:11,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999845788] [2023-11-17 16:23:11,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999845788] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:23:11,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445752301] [2023-11-17 16:23:11,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:23:11,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:23:11,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:23:11,510 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:23:11,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-17 16:23:11,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-17 16:23:11,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:23:11,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-17 16:23:11,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:23:11,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 16:23:11,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 16:23:11,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 16:23:12,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:23:12,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 16:23:12,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 52 [2023-11-17 16:23:12,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:23:12,467 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:23:13,190 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse26 (+ |c_thread1Thread1of1ForFork2_plus_~a#1| |c_thread1Thread1of1ForFork2_plus_~b#1|))) (let ((.cse14 (< .cse26 0)) (.cse15 (< 2147483647 .cse26)) (.cse8 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (.cse1 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse2 (< (+ |c_thread1Thread1of1ForFork2_plus_~a#1| |c_thread1Thread1of1ForFork2_plus_~b#1| 2147483648) 0)) (.cse3 (< 0 (+ |c_thread1Thread1of1ForFork2_plus_~a#1| |c_thread1Thread1of1ForFork2_plus_~b#1| 1)))) (and (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base) .cse1))) (or (< (+ c_~sum~0 c_~mts2~0 .cse0) 1) (< 0 (+ c_~mts3~0 .cse0 1))))) .cse2 .cse3) (or (let ((.cse9 (+ c_~sum~0 c_~mts2~0))) (and (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (let ((.cse6 (select .cse7 .cse1))) (let ((.cse4 (+ c_~mts3~0 .cse6)) (.cse5 (+ c_~mts1~0 (select .cse7 .cse8)))) (or (< .cse4 0) (= .cse4 .cse5) (= .cse5 (+ c_~sum~0 c_~mts2~0 .cse6))))))) (or (< .cse9 (+ c_~mts3~0 1)) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (let ((.cse10 (select .cse11 .cse1))) (or (< (+ c_~mts3~0 .cse10) 0) (= (+ c_~mts1~0 (select .cse11 .cse8)) (+ c_~sum~0 c_~mts2~0 .cse10))))))) (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (let ((.cse12 (+ c_~mts3~0 (select .cse13 .cse1)))) (or (< .cse12 0) (= .cse12 (+ c_~mts1~0 (select .cse13 .cse8))))))) (< c_~mts3~0 .cse9)))) .cse14 .cse15) (or .cse14 .cse15 (and (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (let ((.cse16 (select .cse17 .cse1))) (or (< 0 (+ c_~sum~0 c_~mts2~0 .cse16)) (= (+ c_~mts1~0 (select .cse17 .cse8)) 0) (< 0 (+ c_~mts3~0 .cse16 1)))))) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (let ((.cse18 (+ c_~mts1~0 (select .cse20 .cse8))) (.cse19 (select .cse20 .cse1))) (or (= .cse18 0) (= .cse18 (+ c_~sum~0 c_~mts2~0 .cse19)) (< 0 (+ c_~mts3~0 .cse19 1)))))) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (let ((.cse23 (select .cse22 .cse1))) (let ((.cse21 (+ c_~sum~0 c_~mts2~0 .cse23))) (or (< .cse21 1) (= (+ c_~mts1~0 (select .cse22 .cse8)) .cse21) (< 0 (+ c_~mts3~0 .cse23 1))))))))) (or (and (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse24 (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base) .cse1)))) (or (= .cse24 0) (< .cse24 0)))) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse25 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base) .cse1))) (or (< (+ c_~mts3~0 .cse25) 0) (< (+ c_~sum~0 c_~mts2~0 .cse25) 1))))) .cse2 .cse3)))) is different from false [2023-11-17 16:23:14,145 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~sum~0 c_~mts2~0)) (.cse5 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (< .cse0 (+ c_~mts3~0 1)) (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (let ((.cse1 (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (let ((.cse2 (select .cse1 .cse5)) (.cse3 (+ c_~mts1~0 (select (select .cse4 c_~A~0.base) c_~A~0.offset)))) (or (= (+ (select .cse1 c_~A~0.offset) c_~mts1~0) (+ c_~sum~0 .cse2 c_~mts2~0)) (< .cse3 0) (< (+ c_~mts3~0 .cse2) 0) (< 2147483647 .cse3))))))) (forall ((v_ArrVal_180 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (let ((.cse6 (select (select .cse8 c_~A~0.base) c_~A~0.offset))) (or (< 0 (+ c_~mts1~0 1 .cse6)) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse7 (select (select (store .cse8 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base) .cse5))) (or (< (+ c_~sum~0 .cse7 c_~mts2~0) 1) (< 0 (+ c_~mts3~0 .cse7 1))))) (< (+ c_~mts1~0 2147483648 .cse6) 0))))) (forall ((v_ArrVal_180 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (let ((.cse12 (+ c_~mts1~0 (select (select .cse11 c_~A~0.base) c_~A~0.offset)))) (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse10 (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (let ((.cse9 (select .cse10 .cse5))) (or (< 0 (+ c_~sum~0 .cse9 c_~mts2~0)) (< 0 (+ c_~mts3~0 .cse9 1)) (= (+ (select .cse10 c_~A~0.offset) c_~mts1~0) 0))))) (< .cse12 0) (< 2147483647 .cse12))))) (forall ((v_ArrVal_180 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (let ((.cse17 (+ c_~mts1~0 (select (select .cse16 c_~A~0.base) c_~A~0.offset)))) (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse14 (select (store .cse16 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (let ((.cse15 (select .cse14 .cse5))) (let ((.cse13 (+ c_~sum~0 .cse15 c_~mts2~0))) (or (< .cse13 1) (= (+ (select .cse14 c_~A~0.offset) c_~mts1~0) .cse13) (< 0 (+ c_~mts3~0 .cse15 1))))))) (< .cse17 0) (< 2147483647 .cse17))))) (or (forall ((v_ArrVal_180 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (let ((.cse19 (select (store .cse21 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (let ((.cse18 (+ c_~mts3~0 (select .cse19 .cse5))) (.cse20 (+ c_~mts1~0 (select (select .cse21 c_~A~0.base) c_~A~0.offset)))) (or (= .cse18 (+ (select .cse19 c_~A~0.offset) c_~mts1~0)) (< .cse20 0) (< .cse18 0) (< 2147483647 .cse20)))))) (< c_~mts3~0 .cse0)) (forall ((v_ArrVal_180 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (let ((.cse22 (select (select .cse24 c_~A~0.base) c_~A~0.offset))) (or (< 0 (+ c_~mts1~0 1 .cse22)) (< (+ c_~mts1~0 2147483648 .cse22) 0) (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse23 (+ c_~mts3~0 (select (select (store .cse24 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base) .cse5)))) (or (= .cse23 0) (< .cse23 0)))))))) (forall ((v_ArrVal_180 (Array Int Int))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (let ((.cse27 (select (select .cse26 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse25 (select (select (store .cse26 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base) .cse5))) (or (< (+ c_~sum~0 .cse25 c_~mts2~0) 1) (< (+ c_~mts3~0 .cse25) 0)))) (< 0 (+ c_~mts1~0 1 .cse27)) (< (+ c_~mts1~0 2147483648 .cse27) 0))))) (forall ((v_ArrVal_180 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (let ((.cse32 (+ c_~mts1~0 (select (select .cse31 c_~A~0.base) c_~A~0.offset)))) (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse30 (select (store .cse31 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (let ((.cse29 (select .cse30 .cse5)) (.cse28 (+ (select .cse30 c_~A~0.offset) c_~mts1~0))) (or (= .cse28 (+ c_~sum~0 .cse29 c_~mts2~0)) (< 0 (+ c_~mts3~0 .cse29 1)) (= .cse28 0))))) (< .cse32 0) (< 2147483647 .cse32))))) (forall ((v_ArrVal_180 (Array Int Int))) (let ((.cse37 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_180))) (let ((.cse38 (+ c_~mts1~0 (select (select .cse37 c_~A~0.base) c_~A~0.offset)))) (or (forall ((v_ArrVal_181 (Array Int Int))) (let ((.cse36 (select (store .cse37 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_181) c_~A~0.base))) (let ((.cse35 (select .cse36 .cse5))) (let ((.cse34 (+ (select .cse36 c_~A~0.offset) c_~mts1~0)) (.cse33 (+ c_~mts3~0 .cse35))) (or (= .cse33 .cse34) (= .cse34 (+ c_~sum~0 .cse35 c_~mts2~0)) (< .cse33 0)))))) (< .cse38 0) (< 2147483647 .cse38))))))) is different from false [2023-11-17 16:23:15,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:15,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 102 [2023-11-17 16:23:15,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:15,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1593 treesize of output 1513 [2023-11-17 16:23:15,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:15,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 279 treesize of output 251 [2023-11-17 16:23:15,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:15,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 181 [2023-11-17 16:23:15,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:15,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 129 [2023-11-17 16:23:15,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:15,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 90 [2023-11-17 16:23:15,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:15,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 949 treesize of output 909 [2023-11-17 16:23:16,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 319 treesize of output 271 [2023-11-17 16:23:16,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:16,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 187 treesize of output 179 [2023-11-17 16:23:16,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:16,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 199 treesize of output 175 [2023-11-17 16:23:16,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:16,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 212 treesize of output 140 [2023-11-17 16:23:16,922 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:23:16,935 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:23:16,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 384 treesize of output 348 [2023-11-17 16:23:16,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:23:16,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 154 [2023-11-17 16:23:16,976 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:23:16,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 312 treesize of output 264 [2023-11-17 16:23:17,107 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:17,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 187 treesize of output 127 [2023-11-17 16:23:17,113 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:23:17,124 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:23:17,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 802 treesize of output 734 [2023-11-17 16:23:17,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:23:17,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 125 [2023-11-17 16:23:17,205 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:23:17,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 137 [2023-11-17 16:23:17,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:17,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 91 [2023-11-17 16:23:17,320 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:23:17,331 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:23:17,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 613 treesize of output 569 [2023-11-17 16:23:17,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:23:17,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 105 [2023-11-17 16:23:17,405 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:23:17,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 105 [2023-11-17 16:23:17,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:17,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 122 [2023-11-17 16:23:17,477 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:23:17,489 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:23:17,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 762 treesize of output 702 [2023-11-17 16:23:17,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:23:17,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 123 [2023-11-17 16:23:17,548 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:23:17,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 135 [2023-11-17 16:23:17,646 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:23:17,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 1 [2023-11-17 16:23:17,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:17,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 103 [2023-11-17 16:23:17,669 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:23:17,681 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:23:17,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 625 treesize of output 573 [2023-11-17 16:23:17,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:23:17,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 101 [2023-11-17 16:23:17,767 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:23:17,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 112 [2023-11-17 16:23:17,808 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:23:17,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 1 [2023-11-17 16:23:17,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:23:17,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445752301] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:23:17,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:23:17,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2023-11-17 16:23:17,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94317108] [2023-11-17 16:23:17,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:23:17,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-17 16:23:17,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:23:17,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-17 16:23:17,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=682, Unknown=3, NotChecked=110, Total=930 [2023-11-17 16:23:17,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 472 [2023-11-17 16:23:17,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 152 transitions, 1296 flow. Second operand has 31 states, 31 states have (on average 137.32258064516128) internal successors, (4257), 31 states have internal predecessors, (4257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:17,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:23:17,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 472 [2023-11-17 16:23:17,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:23:19,700 INFO L124 PetriNetUnfolderBase]: 2507/3585 cut-off events. [2023-11-17 16:23:19,700 INFO L125 PetriNetUnfolderBase]: For 10849/10849 co-relation queries the response was YES. [2023-11-17 16:23:19,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15742 conditions, 3585 events. 2507/3585 cut-off events. For 10849/10849 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 15527 event pairs, 465 based on Foata normal form. 1/3554 useless extension candidates. Maximal degree in co-relation 14291. Up to 2916 conditions per place. [2023-11-17 16:23:19,730 INFO L140 encePairwiseOnDemand]: 462/472 looper letters, 166 selfloop transitions, 69 changer transitions 1/236 dead transitions. [2023-11-17 16:23:19,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 236 transitions, 2303 flow [2023-11-17 16:23:19,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 16:23:19,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 16:23:19,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1453 transitions. [2023-11-17 16:23:19,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30783898305084745 [2023-11-17 16:23:19,734 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1453 transitions. [2023-11-17 16:23:19,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1453 transitions. [2023-11-17 16:23:19,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:23:19,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1453 transitions. [2023-11-17 16:23:19,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 145.3) internal successors, (1453), 10 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-11-17 16:23:19,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 472.0) internal successors, (5192), 11 states have internal predecessors, (5192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:19,744 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 472.0) internal successors, (5192), 11 states have internal predecessors, (5192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:19,744 INFO L175 Difference]: Start difference. First operand has 90 places, 152 transitions, 1296 flow. Second operand 10 states and 1453 transitions. [2023-11-17 16:23:19,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 236 transitions, 2303 flow [2023-11-17 16:23:19,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 236 transitions, 2176 flow, removed 40 selfloop flow, removed 3 redundant places. [2023-11-17 16:23:19,827 INFO L231 Difference]: Finished difference. Result has 99 places, 175 transitions, 1619 flow [2023-11-17 16:23:19,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1202, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1619, PETRI_PLACES=99, PETRI_TRANSITIONS=175} [2023-11-17 16:23:19,827 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 67 predicate places. [2023-11-17 16:23:19,827 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 175 transitions, 1619 flow [2023-11-17 16:23:19,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 137.32258064516128) internal successors, (4257), 31 states have internal predecessors, (4257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:19,829 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:23:19,829 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:23:19,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-17 16:23:20,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:23:20,037 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:23:20,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:23:20,037 INFO L85 PathProgramCache]: Analyzing trace with hash -356395033, now seen corresponding path program 4 times [2023-11-17 16:23:20,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:23:20,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527266347] [2023-11-17 16:23:20,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:23:20,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:23:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:23:20,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:23:20,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:23:20,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527266347] [2023-11-17 16:23:20,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527266347] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:23:20,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626541216] [2023-11-17 16:23:20,798 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 16:23:20,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:23:20,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:23:20,800 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:23:20,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-17 16:23:20,911 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 16:23:20,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:23:20,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-17 16:23:20,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:23:20,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:23:20,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:23:20,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-17 16:23:20,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 16:23:21,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 16:23:21,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 16:23:21,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 16:23:21,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 52 [2023-11-17 16:23:21,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:23:21,483 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:23:23,511 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_219 (Array Int Int)) (v_ArrVal_220 (Array Int Int))) (let ((.cse9 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_218) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_219) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_220) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse10 (+ .cse9 c_~mts1~0))) (or (< (+ .cse9 c_~mts3~0) 0) (< 2147483647 .cse10) (< .cse10 0))))))) (and (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_219 (Array Int Int)) (v_ArrVal_220 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_218) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_219) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_220) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse0 c_~mts3~0) 0) (< (+ .cse0 c_~mts1~0 2147483648) 0) (< (+ .cse0 c_~sum~0 c_~mts2~0) 1) (< 0 (+ .cse0 c_~mts1~0 1))))) (or (< (+ c_~sum~0 c_~mts2~0) (+ c_~mts3~0 1)) .cse1) (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_219 (Array Int Int)) (v_ArrVal_220 (Array Int Int))) (let ((.cse3 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_218) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_219) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_220) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse2 (+ .cse3 c_~mts1~0))) (or (< 2147483647 .cse2) (< (+ .cse3 c_~sum~0 c_~mts2~0) 1) (< 0 (+ .cse3 c_~mts3~0 1)) (< .cse2 0))))) (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_219 (Array Int Int)) (v_ArrVal_220 (Array Int Int))) (let ((.cse5 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_218) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_219) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_220) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse4 (+ .cse5 c_~mts1~0))) (or (= .cse4 0) (< 2147483647 .cse4) (< 0 (+ .cse5 c_~mts3~0 1)) (< .cse4 0))))) (or (= c_~mts3~0 c_~mts1~0) .cse1) (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_219 (Array Int Int)) (v_ArrVal_220 (Array Int Int))) (let ((.cse7 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_218) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_219) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_220) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse6 (+ .cse7 c_~mts3~0))) (or (< .cse6 0) (< (+ .cse7 c_~mts1~0 2147483648) 0) (< 0 (+ .cse7 c_~mts1~0 1)) (= .cse6 0))))) (forall ((v_ArrVal_218 (Array Int Int)) (v_ArrVal_219 (Array Int Int)) (v_ArrVal_220 (Array Int Int))) (let ((.cse8 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_218) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_219) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_220) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse8 c_~mts1~0 2147483648) 0) (< (+ .cse8 c_~sum~0 c_~mts2~0) 1) (< 0 (+ .cse8 c_~mts1~0 1)) (< 0 (+ .cse8 c_~mts3~0 1))))))) is different from false [2023-11-17 16:23:23,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:23,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 86 [2023-11-17 16:23:23,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 517 treesize of output 501 [2023-11-17 16:23:23,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 501 treesize of output 469 [2023-11-17 16:23:23,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 469 treesize of output 453 [2023-11-17 16:23:23,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 221 [2023-11-17 16:23:23,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:23,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 67 [2023-11-17 16:23:23,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3280 treesize of output 3184 [2023-11-17 16:23:23,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 186 [2023-11-17 16:23:23,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 174 [2023-11-17 16:23:23,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 171 [2023-11-17 16:23:23,872 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:23:23,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 1 [2023-11-17 16:23:23,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:23,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 67 [2023-11-17 16:23:23,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1624 treesize of output 1576 [2023-11-17 16:23:23,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 186 [2023-11-17 16:23:23,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 174 [2023-11-17 16:23:23,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 171 [2023-11-17 16:23:24,012 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:23:24,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 1 [2023-11-17 16:23:24,017 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:23:24,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 1 [2023-11-17 16:23:24,023 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:23:24,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 1 [2023-11-17 16:23:24,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-17 16:23:24,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626541216] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:23:24,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:23:24,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 32 [2023-11-17 16:23:24,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956686447] [2023-11-17 16:23:24,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:23:24,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-17 16:23:24,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:23:24,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-17 16:23:24,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=898, Unknown=4, NotChecked=62, Total=1122 [2023-11-17 16:23:24,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 472 [2023-11-17 16:23:24,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 175 transitions, 1619 flow. Second operand has 34 states, 34 states have (on average 133.11764705882354) internal successors, (4526), 34 states have internal predecessors, (4526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:24,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:23:24,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 472 [2023-11-17 16:23:24,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:23:27,062 INFO L124 PetriNetUnfolderBase]: 2907/4163 cut-off events. [2023-11-17 16:23:27,062 INFO L125 PetriNetUnfolderBase]: For 13268/13268 co-relation queries the response was YES. [2023-11-17 16:23:27,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18971 conditions, 4163 events. 2907/4163 cut-off events. For 13268/13268 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 18937 event pairs, 371 based on Foata normal form. 1/4132 useless extension candidates. Maximal degree in co-relation 16754. Up to 2959 conditions per place. [2023-11-17 16:23:27,094 INFO L140 encePairwiseOnDemand]: 458/472 looper letters, 175 selfloop transitions, 144 changer transitions 1/320 dead transitions. [2023-11-17 16:23:27,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 320 transitions, 3178 flow [2023-11-17 16:23:27,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-17 16:23:27,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-11-17 16:23:27,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3471 transitions. [2023-11-17 16:23:27,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29415254237288135 [2023-11-17 16:23:27,103 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3471 transitions. [2023-11-17 16:23:27,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3471 transitions. [2023-11-17 16:23:27,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:23:27,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3471 transitions. [2023-11-17 16:23:27,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 138.84) internal successors, (3471), 25 states have internal predecessors, (3471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:27,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 472.0) internal successors, (12272), 26 states have internal predecessors, (12272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:27,124 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 472.0) internal successors, (12272), 26 states have internal predecessors, (12272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:27,124 INFO L175 Difference]: Start difference. First operand has 99 places, 175 transitions, 1619 flow. Second operand 25 states and 3471 transitions. [2023-11-17 16:23:27,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 320 transitions, 3178 flow [2023-11-17 16:23:27,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 320 transitions, 3115 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-11-17 16:23:27,171 INFO L231 Difference]: Finished difference. Result has 128 places, 223 transitions, 2467 flow [2023-11-17 16:23:27,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1564, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2467, PETRI_PLACES=128, PETRI_TRANSITIONS=223} [2023-11-17 16:23:27,172 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 96 predicate places. [2023-11-17 16:23:27,172 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 223 transitions, 2467 flow [2023-11-17 16:23:27,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 133.11764705882354) internal successors, (4526), 34 states have internal predecessors, (4526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:27,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:23:27,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:23:27,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-17 16:23:27,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:23:27,379 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:23:27,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:23:27,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1396851793, now seen corresponding path program 5 times [2023-11-17 16:23:27,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:23:27,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324701836] [2023-11-17 16:23:27,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:23:27,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:23:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:23:28,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:23:28,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:23:28,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324701836] [2023-11-17 16:23:28,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324701836] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:23:28,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619490620] [2023-11-17 16:23:28,227 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 16:23:28,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:23:28,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:23:28,228 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:23:28,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-17 16:23:28,332 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:23:28,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:23:28,334 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-17 16:23:28,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:23:28,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 46 [2023-11-17 16:23:28,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:23:28,925 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:23:29,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:29,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 72 [2023-11-17 16:23:29,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:29,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 360 treesize of output 344 [2023-11-17 16:23:42,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:23:42,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619490620] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:23:42,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:23:42,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2023-11-17 16:23:42,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485958791] [2023-11-17 16:23:42,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:23:42,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-17 16:23:42,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:23:42,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-17 16:23:42,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=515, Unknown=0, NotChecked=0, Total=650 [2023-11-17 16:23:42,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 472 [2023-11-17 16:23:42,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 223 transitions, 2467 flow. Second operand has 26 states, 26 states have (on average 148.76923076923077) internal successors, (3868), 26 states have internal predecessors, (3868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:42,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:23:42,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 472 [2023-11-17 16:23:42,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:23:44,363 INFO L124 PetriNetUnfolderBase]: 4055/5740 cut-off events. [2023-11-17 16:23:44,363 INFO L125 PetriNetUnfolderBase]: For 24946/24946 co-relation queries the response was YES. [2023-11-17 16:23:44,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29344 conditions, 5740 events. 4055/5740 cut-off events. For 24946/24946 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 26816 event pairs, 681 based on Foata normal form. 2/5742 useless extension candidates. Maximal degree in co-relation 28530. Up to 4189 conditions per place. [2023-11-17 16:23:44,410 INFO L140 encePairwiseOnDemand]: 458/472 looper letters, 259 selfloop transitions, 136 changer transitions 2/397 dead transitions. [2023-11-17 16:23:44,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 397 transitions, 4613 flow [2023-11-17 16:23:44,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-17 16:23:44,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-17 16:23:44,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2517 transitions. [2023-11-17 16:23:44,417 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3332891949152542 [2023-11-17 16:23:44,417 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2517 transitions. [2023-11-17 16:23:44,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2517 transitions. [2023-11-17 16:23:44,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:23:44,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2517 transitions. [2023-11-17 16:23:44,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 157.3125) internal successors, (2517), 16 states have internal predecessors, (2517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:44,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 472.0) internal successors, (8024), 17 states have internal predecessors, (8024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:44,430 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 472.0) internal successors, (8024), 17 states have internal predecessors, (8024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:44,430 INFO L175 Difference]: Start difference. First operand has 128 places, 223 transitions, 2467 flow. Second operand 16 states and 2517 transitions. [2023-11-17 16:23:44,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 397 transitions, 4613 flow [2023-11-17 16:23:44,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 397 transitions, 4502 flow, removed 43 selfloop flow, removed 6 redundant places. [2023-11-17 16:23:44,542 INFO L231 Difference]: Finished difference. Result has 145 places, 299 transitions, 3731 flow [2023-11-17 16:23:44,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=2356, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3731, PETRI_PLACES=145, PETRI_TRANSITIONS=299} [2023-11-17 16:23:44,543 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 113 predicate places. [2023-11-17 16:23:44,544 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 299 transitions, 3731 flow [2023-11-17 16:23:44,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 148.76923076923077) internal successors, (3868), 26 states have internal predecessors, (3868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:44,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:23:44,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:23:44,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-17 16:23:44,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:23:44,750 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:23:44,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:23:44,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1046114769, now seen corresponding path program 6 times [2023-11-17 16:23:44,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:23:44,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231034392] [2023-11-17 16:23:44,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:23:44,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:23:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:23:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:23:45,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:23:45,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231034392] [2023-11-17 16:23:45,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231034392] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:23:45,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685106583] [2023-11-17 16:23:45,567 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 16:23:45,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:23:45,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:23:45,568 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:23:45,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-17 16:23:45,677 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-17 16:23:45,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:23:45,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-17 16:23:45,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:23:45,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 16:23:45,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 16:23:45,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 16:23:46,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:23:46,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 41 [2023-11-17 16:23:46,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 46 [2023-11-17 16:23:46,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:23:46,413 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:23:46,927 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse18 (+ c_~sum~0 c_~mts2~0))) (let ((.cse6 (< c_~mts3~0 .cse18)) (.cse3 (< .cse18 (+ c_~mts3~0 1))) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (< (+ |c_thread1Thread1of1ForFork2_plus_~a#1| |c_thread1Thread1of1ForFork2_plus_~b#1| 2147483648) 0) (and (forall ((v_ArrVal_289 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289) c_~A~0.base) .cse2))) (let ((.cse1 (+ c_~mts3~0 .cse0))) (or (= (+ c_~sum~0 c_~mts2~0 .cse0) 0) (< .cse1 0) (= .cse1 0))))) (or .cse3 (forall ((v_ArrVal_289 (Array Int Int))) (< (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289) c_~A~0.base) .cse2)) 0))) (forall ((v_ArrVal_289 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289) c_~A~0.base) .cse2))) (or (< (+ c_~sum~0 c_~mts2~0 .cse4) 1) (< 0 (+ c_~mts3~0 .cse4 1))))) (or (forall ((v_ArrVal_289 (Array Int Int))) (let ((.cse5 (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289) c_~A~0.base) .cse2)))) (or (< .cse5 0) (= .cse5 0)))) .cse6)) (< 0 (+ |c_thread1Thread1of1ForFork2_plus_~a#1| |c_thread1Thread1of1ForFork2_plus_~b#1| 1))) (let ((.cse17 (+ |c_thread1Thread1of1ForFork2_plus_~a#1| |c_thread1Thread1of1ForFork2_plus_~b#1|))) (or (let ((.cse8 (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) c_~mts1~0))) (let ((.cse12 (= .cse8 0))) (and (forall ((v_ArrVal_289 (Array Int Int))) (let ((.cse7 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289) c_~A~0.base) .cse2))) (let ((.cse9 (+ c_~mts3~0 .cse7))) (or (= (+ c_~sum~0 c_~mts2~0 .cse7) .cse8) (< .cse9 0) (= .cse8 .cse9))))) (forall ((v_ArrVal_289 (Array Int Int))) (let ((.cse11 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289) c_~A~0.base) .cse2))) (let ((.cse10 (+ c_~sum~0 c_~mts2~0 .cse11))) (or (= .cse10 .cse8) (< .cse10 1) (< 0 (+ c_~mts3~0 .cse11 1)))))) (or .cse12 (forall ((v_ArrVal_289 (Array Int Int))) (let ((.cse13 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289) c_~A~0.base) .cse2))) (or (< 0 (+ c_~sum~0 c_~mts2~0 .cse13)) (< 0 (+ c_~mts3~0 .cse13 1)))))) (or (forall ((v_ArrVal_289 (Array Int Int))) (let ((.cse14 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289) c_~A~0.base) .cse2))) (or (= (+ c_~sum~0 c_~mts2~0 .cse14) .cse8) (< 0 (+ c_~mts3~0 .cse14 1))))) .cse12) (or (forall ((v_ArrVal_289 (Array Int Int))) (let ((.cse15 (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289) c_~A~0.base) .cse2)))) (or (< .cse15 0) (= .cse8 .cse15)))) .cse6) (or .cse3 (forall ((v_ArrVal_289 (Array Int Int))) (let ((.cse16 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289) c_~A~0.base) .cse2))) (or (= (+ c_~sum~0 c_~mts2~0 .cse16) .cse8) (< (+ c_~mts3~0 .cse16) 0)))))))) (< .cse17 0) (< 2147483647 .cse17)))))) is different from false [2023-11-17 16:23:49,081 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse34 (+ c_~sum~0 c_~mts2~0))) (let ((.cse24 (< c_~mts3~0 .cse34)) (.cse25 (< .cse34 (+ c_~mts3~0 1)))) (and (forall ((v_ArrVal_287 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288))) (let ((.cse0 (+ (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~mts1~0))) (or (forall ((v_ArrVal_289 (Array Int Int))) (let ((.cse1 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse2 (+ c_~mts3~0 .cse1))) (or (= .cse0 (+ c_~sum~0 c_~mts2~0 .cse1)) (= .cse2 .cse0) (< .cse2 0))))) (< .cse0 0) (< 2147483647 .cse0))))) (forall ((v_ArrVal_287 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_289 (Array Int Int))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse4 (+ c_~mts3~0 .cse5))) (or (= .cse4 0) (= 0 (+ c_~sum~0 c_~mts2~0 .cse5)) (< .cse4 0))))) (< (+ .cse7 c_~mts1~0 2147483648) 0) (< 0 (+ .cse7 c_~mts1~0 1)))))) (forall ((v_ArrVal_287 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288))) (let ((.cse8 (+ (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~mts1~0))) (or (forall ((v_ArrVal_289 (Array Int Int))) (let ((.cse9 (select (select (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse8 (+ c_~sum~0 c_~mts2~0 .cse9)) (< 0 (+ c_~mts3~0 .cse9 1))))) (< .cse8 0) (= .cse8 0) (< 2147483647 .cse8))))) (forall ((v_ArrVal_287 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288))) (let ((.cse13 (+ (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~mts1~0))) (or (forall ((v_ArrVal_289 (Array Int Int))) (let ((.cse11 (select (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< 0 (+ c_~sum~0 c_~mts2~0 .cse11)) (< 0 (+ c_~mts3~0 .cse11 1))))) (< .cse13 0) (= .cse13 0) (< 2147483647 .cse13))))) (forall ((v_ArrVal_287 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_289 (Array Int Int))) (let ((.cse14 (select (select (store .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ c_~sum~0 c_~mts2~0 .cse14) 1) (< 0 (+ c_~mts3~0 .cse14 1))))) (< (+ .cse16 c_~mts1~0 2147483648) 0) (< 0 (+ .cse16 c_~mts1~0 1)))))) (forall ((v_ArrVal_287 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288))) (let ((.cse17 (+ (select (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~mts1~0))) (or (forall ((v_ArrVal_289 (Array Int Int))) (let ((.cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse18 (+ c_~sum~0 c_~mts2~0 .cse19))) (or (= .cse17 .cse18) (< .cse18 1) (< 0 (+ c_~mts3~0 .cse19 1)))))) (< .cse17 0) (< 2147483647 .cse17))))) (or (forall ((v_ArrVal_287 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse23 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288))) (let ((.cse21 (+ c_~mts3~0 (select (select (store .cse23 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse22 (select (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= .cse21 0) (< (+ .cse22 c_~mts1~0 2147483648) 0) (< .cse21 0) (< 0 (+ .cse22 c_~mts1~0 1)))))) .cse24) (or .cse25 (forall ((v_ArrVal_287 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse27 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288))) (let ((.cse26 (select (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse26 c_~mts1~0 2147483648) 0) (< (+ c_~mts3~0 (select (select (store .cse27 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 0) (< 0 (+ .cse26 c_~mts1~0 1))))))) (or (forall ((v_ArrVal_287 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288))) (let ((.cse29 (+ c_~mts3~0 (select (select (store .cse30 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (.cse28 (+ (select (select .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~mts1~0))) (or (< .cse28 0) (= .cse29 .cse28) (< .cse29 0) (< 2147483647 .cse28))))) .cse24) (or (forall ((v_ArrVal_287 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (v_ArrVal_288 (Array Int Int))) (let ((.cse33 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_287) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_288))) (let ((.cse32 (select (select (store .cse33 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_289) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse31 (+ (select (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~mts1~0))) (or (= .cse31 (+ c_~sum~0 c_~mts2~0 .cse32)) (< .cse31 0) (< (+ c_~mts3~0 .cse32) 0) (< 2147483647 .cse31))))) .cse25)))) is different from false [2023-11-17 16:23:49,144 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:49,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 100 [2023-11-17 16:23:49,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3618 treesize of output 3506 [2023-11-17 16:23:49,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 238 [2023-11-17 16:23:49,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 380 treesize of output 356 [2023-11-17 16:23:49,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 221 [2023-11-17 16:23:49,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:49,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 83 [2023-11-17 16:23:49,384 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:23:49,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 253 treesize of output 237 [2023-11-17 16:23:49,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 213 [2023-11-17 16:23:49,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 101 [2023-11-17 16:23:49,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:49,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 96 [2023-11-17 16:23:49,479 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:23:49,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 304 treesize of output 284 [2023-11-17 16:23:49,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 135 [2023-11-17 16:23:49,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 274 treesize of output 254 [2023-11-17 16:23:49,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:49,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 122 [2023-11-17 16:23:49,599 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:23:49,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 2854 treesize of output 2638 [2023-11-17 16:23:49,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 77 [2023-11-17 16:23:49,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 80 [2023-11-17 16:23:49,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:49,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 108 [2023-11-17 16:23:49,702 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:23:49,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 1802 treesize of output 1674 [2023-11-17 16:23:49,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 103 [2023-11-17 16:23:49,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 99 [2023-11-17 16:23:49,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:49,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 92 [2023-11-17 16:23:49,819 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:23:49,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 1665 treesize of output 1545 [2023-11-17 16:23:49,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 77 [2023-11-17 16:23:49,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 80 [2023-11-17 16:23:49,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:49,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 91 [2023-11-17 16:23:49,900 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:23:49,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 467 treesize of output 431 [2023-11-17 16:23:49,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 162 [2023-11-17 16:23:49,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 77 [2023-11-17 16:23:49,992 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:23:49,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 1 [2023-11-17 16:23:49,999 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:23:49,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 1 [2023-11-17 16:23:50,009 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:23:50,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 1 [2023-11-17 16:23:50,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-17 16:23:50,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685106583] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:23:50,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:23:50,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 34 [2023-11-17 16:23:50,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930801763] [2023-11-17 16:23:50,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:23:50,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-17 16:23:50,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:23:50,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-17 16:23:50,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=963, Unknown=10, NotChecked=130, Total=1260 [2023-11-17 16:23:50,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 472 [2023-11-17 16:23:50,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 299 transitions, 3731 flow. Second operand has 36 states, 36 states have (on average 133.0) internal successors, (4788), 36 states have internal predecessors, (4788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:50,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:23:50,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 472 [2023-11-17 16:23:50,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:23:56,663 INFO L124 PetriNetUnfolderBase]: 4643/6631 cut-off events. [2023-11-17 16:23:56,663 INFO L125 PetriNetUnfolderBase]: For 38709/38709 co-relation queries the response was YES. [2023-11-17 16:23:56,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37813 conditions, 6631 events. 4643/6631 cut-off events. For 38709/38709 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 32881 event pairs, 235 based on Foata normal form. 2/6633 useless extension candidates. Maximal degree in co-relation 36344. Up to 4202 conditions per place. [2023-11-17 16:23:56,717 INFO L140 encePairwiseOnDemand]: 457/472 looper letters, 249 selfloop transitions, 229 changer transitions 2/480 dead transitions. [2023-11-17 16:23:56,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 480 transitions, 5964 flow [2023-11-17 16:23:56,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-17 16:23:56,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-11-17 16:23:56,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3513 transitions. [2023-11-17 16:23:56,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29771186440677966 [2023-11-17 16:23:56,724 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3513 transitions. [2023-11-17 16:23:56,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3513 transitions. [2023-11-17 16:23:56,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:23:56,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3513 transitions. [2023-11-17 16:23:56,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 140.52) internal successors, (3513), 25 states have internal predecessors, (3513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:56,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 472.0) internal successors, (12272), 26 states have internal predecessors, (12272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:56,866 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 472.0) internal successors, (12272), 26 states have internal predecessors, (12272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:56,866 INFO L175 Difference]: Start difference. First operand has 145 places, 299 transitions, 3731 flow. Second operand 25 states and 3513 transitions. [2023-11-17 16:23:56,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 480 transitions, 5964 flow [2023-11-17 16:23:57,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 480 transitions, 5715 flow, removed 107 selfloop flow, removed 4 redundant places. [2023-11-17 16:23:57,054 INFO L231 Difference]: Finished difference. Result has 172 places, 345 transitions, 4664 flow [2023-11-17 16:23:57,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=3512, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=4664, PETRI_PLACES=172, PETRI_TRANSITIONS=345} [2023-11-17 16:23:57,055 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 140 predicate places. [2023-11-17 16:23:57,055 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 345 transitions, 4664 flow [2023-11-17 16:23:57,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 133.0) internal successors, (4788), 36 states have internal predecessors, (4788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:23:57,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:23:57,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:23:57,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-17 16:23:57,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:23:57,312 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:23:57,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:23:57,312 INFO L85 PathProgramCache]: Analyzing trace with hash -2039650577, now seen corresponding path program 7 times [2023-11-17 16:23:57,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:23:57,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176320054] [2023-11-17 16:23:57,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:23:57,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:23:57,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:23:58,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:23:58,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:23:58,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176320054] [2023-11-17 16:23:58,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176320054] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:23:58,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346673113] [2023-11-17 16:23:58,107 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 16:23:58,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:23:58,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:23:58,109 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:23:58,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-17 16:23:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:23:58,219 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-17 16:23:58,221 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:23:58,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:23:58,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 16:23:58,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 46 [2023-11-17 16:23:58,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:23:58,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:23:59,650 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (and (forall ((v_ArrVal_322 (Array Int Int))) (let ((.cse0 (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) c_~A~0.base) .cse1)))) (or (= .cse0 0) (< .cse0 0)))) (forall ((v_ArrVal_322 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) c_~A~0.base) .cse1) c_~mts2~0) 0))) (< (+ |c_thread1Thread1of1ForFork2_plus_~a#1| |c_thread1Thread1of1ForFork2_plus_~b#1| 2147483648) 0) (< 0 (+ |c_thread1Thread1of1ForFork2_plus_~a#1| |c_thread1Thread1of1ForFork2_plus_~b#1| 1))) (let ((.cse2 (+ |c_thread1Thread1of1ForFork2_plus_~a#1| |c_thread1Thread1of1ForFork2_plus_~b#1|))) (or (< .cse2 0) (let ((.cse3 (+ c_~sum~0 c_~mts2~0)) (.cse6 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4)))) (and (or (< c_~mts3~0 .cse3) (forall ((v_ArrVal_322 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) c_~A~0.base))) (let ((.cse4 (+ c_~mts3~0 (select .cse5 .cse1)))) (or (< .cse4 0) (= (+ c_~mts1~0 (select .cse5 .cse6)) .cse4)))))) (forall ((v_ArrVal_322 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) c_~A~0.base))) (let ((.cse8 (select .cse7 .cse1))) (or (= (+ c_~mts1~0 (select .cse7 .cse6)) 0) (< 0 (+ c_~sum~0 .cse8 c_~mts2~0)) (< 0 (+ c_~mts3~0 .cse8 1)))))) (or (forall ((v_ArrVal_322 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) c_~A~0.base))) (let ((.cse9 (select .cse10 .cse1))) (or (< (+ c_~mts3~0 .cse9) 0) (= (+ c_~sum~0 .cse9 c_~mts2~0) (+ c_~mts1~0 (select .cse10 .cse6))))))) (< .cse3 (+ c_~mts3~0 1))) (forall ((v_ArrVal_322 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) c_~A~0.base))) (let ((.cse11 (+ c_~mts1~0 (select .cse13 .cse6))) (.cse12 (select .cse13 .cse1))) (or (= .cse11 0) (= (+ c_~sum~0 .cse12 c_~mts2~0) .cse11) (< 0 (+ c_~mts3~0 .cse12 1)))))) (forall ((v_ArrVal_322 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) c_~A~0.base))) (let ((.cse15 (select .cse17 .cse1))) (let ((.cse16 (+ c_~mts1~0 (select .cse17 .cse6))) (.cse14 (+ c_~mts3~0 .cse15))) (or (< .cse14 0) (= (+ c_~sum~0 .cse15 c_~mts2~0) .cse16) (= .cse16 .cse14)))))) (forall ((v_ArrVal_322 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_322) c_~A~0.base))) (let ((.cse20 (select .cse19 .cse1))) (let ((.cse18 (+ c_~sum~0 .cse20 c_~mts2~0))) (or (= .cse18 (+ c_~mts1~0 (select .cse19 .cse6))) (< .cse18 1) (< 0 (+ c_~mts3~0 .cse20 1))))))))) (< 2147483647 .cse2))))) is different from false [2023-11-17 16:23:59,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:23:59,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 101 [2023-11-17 16:23:59,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 76 [2023-11-17 16:23:59,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 64 [2023-11-17 16:23:59,760 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:23:59,768 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:23:59,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 323 treesize of output 135 [2023-11-17 16:24:00,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:00,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346673113] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:24:00,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:24:00,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2023-11-17 16:24:00,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103561409] [2023-11-17 16:24:00,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:24:00,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-17 16:24:00,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:24:00,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-17 16:24:00,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=640, Unknown=1, NotChecked=52, Total=812 [2023-11-17 16:24:00,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 472 [2023-11-17 16:24:00,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 345 transitions, 4664 flow. Second operand has 29 states, 29 states have (on average 143.48275862068965) internal successors, (4161), 29 states have internal predecessors, (4161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:00,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:24:00,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 472 [2023-11-17 16:24:00,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:24:01,684 INFO L124 PetriNetUnfolderBase]: 5037/7215 cut-off events. [2023-11-17 16:24:01,684 INFO L125 PetriNetUnfolderBase]: For 50982/50982 co-relation queries the response was YES. [2023-11-17 16:24:01,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43074 conditions, 7215 events. 5037/7215 cut-off events. For 50982/50982 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 36290 event pairs, 1125 based on Foata normal form. 1/7216 useless extension candidates. Maximal degree in co-relation 42657. Up to 6006 conditions per place. [2023-11-17 16:24:01,749 INFO L140 encePairwiseOnDemand]: 461/472 looper letters, 304 selfloop transitions, 118 changer transitions 1/423 dead transitions. [2023-11-17 16:24:01,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 423 transitions, 6272 flow [2023-11-17 16:24:01,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 16:24:01,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 16:24:01,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1519 transitions. [2023-11-17 16:24:01,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3218220338983051 [2023-11-17 16:24:01,752 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1519 transitions. [2023-11-17 16:24:01,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1519 transitions. [2023-11-17 16:24:01,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:24:01,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1519 transitions. [2023-11-17 16:24:01,755 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 151.9) internal successors, (1519), 10 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:01,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 472.0) internal successors, (5192), 11 states have internal predecessors, (5192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:01,758 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 472.0) internal successors, (5192), 11 states have internal predecessors, (5192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:01,759 INFO L175 Difference]: Start difference. First operand has 172 places, 345 transitions, 4664 flow. Second operand 10 states and 1519 transitions. [2023-11-17 16:24:01,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 423 transitions, 6272 flow [2023-11-17 16:24:01,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 423 transitions, 6067 flow, removed 74 selfloop flow, removed 9 redundant places. [2023-11-17 16:24:01,969 INFO L231 Difference]: Finished difference. Result has 175 places, 371 transitions, 5272 flow [2023-11-17 16:24:01,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=4461, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5272, PETRI_PLACES=175, PETRI_TRANSITIONS=371} [2023-11-17 16:24:01,969 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 143 predicate places. [2023-11-17 16:24:01,969 INFO L495 AbstractCegarLoop]: Abstraction has has 175 places, 371 transitions, 5272 flow [2023-11-17 16:24:01,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 143.48275862068965) internal successors, (4161), 29 states have internal predecessors, (4161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:01,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:24:01,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:24:01,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-17 16:24:02,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-17 16:24:02,171 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:24:02,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:24:02,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1938880957, now seen corresponding path program 8 times [2023-11-17 16:24:02,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:24:02,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120864688] [2023-11-17 16:24:02,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:02,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:24:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:02,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:02,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:24:02,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120864688] [2023-11-17 16:24:02,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120864688] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:24:02,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013601278] [2023-11-17 16:24:02,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:24:02,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:02,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:24:02,920 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:24:02,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-17 16:24:03,037 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:24:03,037 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:24:03,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-17 16:24:03,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:24:03,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 16:24:03,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 16:24:03,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 16:24:03,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 16:24:03,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 52 [2023-11-17 16:24:03,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:03,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:24:05,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:05,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 87 [2023-11-17 16:24:05,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2229 treesize of output 2165 [2023-11-17 16:24:05,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 245 [2023-11-17 16:24:05,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 501 treesize of output 469 [2023-11-17 16:24:05,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 225 [2023-11-17 16:24:05,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:05,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 87 [2023-11-17 16:24:05,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1093 treesize of output 1061 [2023-11-17 16:24:05,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 257 treesize of output 225 [2023-11-17 16:24:06,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 245 [2023-11-17 16:24:06,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 229 [2023-11-17 16:24:06,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:06,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 67 [2023-11-17 16:24:06,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1624 treesize of output 1576 [2023-11-17 16:24:06,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 171 [2023-11-17 16:24:06,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 180 [2023-11-17 16:24:06,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 174 [2023-11-17 16:24:06,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:06,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 67 [2023-11-17 16:24:06,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 796 treesize of output 772 [2023-11-17 16:24:06,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 189 [2023-11-17 16:24:06,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 380 treesize of output 368 [2023-11-17 16:24:06,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 368 treesize of output 344 [2023-11-17 16:24:06,653 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:24:06,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 1 [2023-11-17 16:24:06,661 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:24:06,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-11-17 16:24:06,667 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:24:06,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 1 [2023-11-17 16:24:06,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:06,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 86 [2023-11-17 16:24:06,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2197 treesize of output 2133 [2023-11-17 16:24:06,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 249 treesize of output 241 [2023-11-17 16:24:06,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 493 treesize of output 461 [2023-11-17 16:24:06,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 237 treesize of output 221 [2023-11-17 16:24:06,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:06,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013601278] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:24:06,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:24:06,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 11] total 31 [2023-11-17 16:24:06,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041322414] [2023-11-17 16:24:06,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:24:06,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-17 16:24:06,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:24:06,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-17 16:24:06,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=878, Unknown=9, NotChecked=0, Total=1056 [2023-11-17 16:24:06,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 472 [2023-11-17 16:24:06,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 371 transitions, 5272 flow. Second operand has 33 states, 33 states have (on average 133.1818181818182) internal successors, (4395), 33 states have internal predecessors, (4395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:06,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:24:06,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 472 [2023-11-17 16:24:06,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:24:10,693 INFO L124 PetriNetUnfolderBase]: 5347/7658 cut-off events. [2023-11-17 16:24:10,693 INFO L125 PetriNetUnfolderBase]: For 52431/52431 co-relation queries the response was YES. [2023-11-17 16:24:10,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46674 conditions, 7658 events. 5347/7658 cut-off events. For 52431/52431 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 39169 event pairs, 805 based on Foata normal form. 1/7659 useless extension candidates. Maximal degree in co-relation 46342. Up to 5741 conditions per place. [2023-11-17 16:24:10,762 INFO L140 encePairwiseOnDemand]: 458/472 looper letters, 251 selfloop transitions, 257 changer transitions 1/509 dead transitions. [2023-11-17 16:24:10,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 509 transitions, 7402 flow [2023-11-17 16:24:10,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-17 16:24:10,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-11-17 16:24:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3342 transitions. [2023-11-17 16:24:10,768 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.295021186440678 [2023-11-17 16:24:10,768 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3342 transitions. [2023-11-17 16:24:10,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3342 transitions. [2023-11-17 16:24:10,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:24:10,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3342 transitions. [2023-11-17 16:24:10,772 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 139.25) internal successors, (3342), 24 states have internal predecessors, (3342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:10,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 472.0) internal successors, (11800), 25 states have internal predecessors, (11800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:10,780 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 472.0) internal successors, (11800), 25 states have internal predecessors, (11800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:10,781 INFO L175 Difference]: Start difference. First operand has 175 places, 371 transitions, 5272 flow. Second operand 24 states and 3342 transitions. [2023-11-17 16:24:10,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 509 transitions, 7402 flow [2023-11-17 16:24:11,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 509 transitions, 7280 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-11-17 16:24:11,023 INFO L231 Difference]: Finished difference. Result has 198 places, 403 transitions, 6224 flow [2023-11-17 16:24:11,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=5150, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=230, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=6224, PETRI_PLACES=198, PETRI_TRANSITIONS=403} [2023-11-17 16:24:11,024 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 166 predicate places. [2023-11-17 16:24:11,024 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 403 transitions, 6224 flow [2023-11-17 16:24:11,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 133.1818181818182) internal successors, (4395), 33 states have internal predecessors, (4395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:11,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:24:11,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:24:11,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-17 16:24:11,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:11,226 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:24:11,226 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:24:11,226 INFO L85 PathProgramCache]: Analyzing trace with hash 192333921, now seen corresponding path program 9 times [2023-11-17 16:24:11,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:24:11,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59906668] [2023-11-17 16:24:11,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:11,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:24:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:11,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:11,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:24:11,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59906668] [2023-11-17 16:24:11,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59906668] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:24:11,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941017782] [2023-11-17 16:24:11,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:24:11,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:11,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:24:11,893 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:24:11,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-17 16:24:12,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 16:24:12,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:24:12,017 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-17 16:24:12,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:24:12,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 16:24:12,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 16:24:12,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 16:24:12,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 16:24:12,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 46 [2023-11-17 16:24:12,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:12,766 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:24:14,460 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (+ c_~sum~0 c_~mts2~0))) (let ((.cse2 (= c_~mts1~0 .cse10)) (.cse8 (= c_~mts3~0 c_~mts1~0)) (.cse9 (forall ((v_ArrVal_393 (Array Int Int)) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_394 (Array Int Int))) (let ((.cse12 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_393) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_394) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_395) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse11 (+ c_~mts1~0 .cse12))) (or (< .cse11 0) (< 2147483647 .cse11) (< (+ c_~mts3~0 .cse12) 0))))))) (and (or (forall ((v_ArrVal_393 (Array Int Int)) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_394 (Array Int Int))) (let ((.cse1 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_393) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_394) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_395) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse0 (+ c_~mts1~0 .cse1))) (or (< .cse0 0) (= .cse0 0) (< 2147483647 .cse0) (< 0 (+ c_~mts3~0 .cse1 1)))))) .cse2) (or (forall ((v_ArrVal_393 (Array Int Int)) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_394 (Array Int Int))) (let ((.cse4 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_393) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_394) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_395) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse3 (+ c_~mts1~0 .cse4))) (or (< .cse3 0) (< 2147483647 .cse3) (< 0 (+ c_~mts3~0 .cse4 1)) (< (+ c_~sum~0 c_~mts2~0 .cse4) 1))))) .cse2) (forall ((v_ArrVal_393 (Array Int Int)) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_394 (Array Int Int))) (let ((.cse5 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_393) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_394) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_395) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ c_~mts1~0 2147483648 .cse5) 0) (< 0 (+ c_~mts1~0 .cse5 1)) (< (+ c_~sum~0 c_~mts2~0 .cse5) 1)))) (forall ((v_ArrVal_393 (Array Int Int)) (v_ArrVal_395 (Array Int Int)) (v_ArrVal_394 (Array Int Int))) (let ((.cse6 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_393) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_394) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_395) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse7 (+ c_~mts3~0 .cse6))) (or (< (+ c_~mts1~0 2147483648 .cse6) 0) (= .cse7 0) (< 0 (+ c_~mts1~0 .cse6 1)) (< .cse7 0))))) (or .cse8 .cse9 .cse2) (or (< .cse10 (+ c_~mts3~0 1)) .cse9 .cse2) (or .cse8 (< c_~mts3~0 .cse10) .cse9)))) is different from false [2023-11-17 16:24:14,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:14,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 87 [2023-11-17 16:24:14,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4501 treesize of output 4373 [2023-11-17 16:24:14,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 245 [2023-11-17 16:24:14,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 229 [2023-11-17 16:24:14,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 257 treesize of output 225 [2023-11-17 16:24:14,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:14,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 67 [2023-11-17 16:24:14,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 796 treesize of output 772 [2023-11-17 16:24:14,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 386 treesize of output 374 [2023-11-17 16:24:14,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 183 [2023-11-17 16:24:14,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 368 treesize of output 344 [2023-11-17 16:24:14,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:14,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 67 [2023-11-17 16:24:14,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1624 treesize of output 1576 [2023-11-17 16:24:14,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 180 [2023-11-17 16:24:14,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 174 [2023-11-17 16:24:14,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 171 [2023-11-17 16:24:15,026 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:15,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 70 [2023-11-17 16:24:15,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3472 treesize of output 3376 [2023-11-17 16:24:15,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 186 [2023-11-17 16:24:15,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 174 [2023-11-17 16:24:15,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 171 [2023-11-17 16:24:15,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:15,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 67 [2023-11-17 16:24:15,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1624 treesize of output 1576 [2023-11-17 16:24:15,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 186 [2023-11-17 16:24:15,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 174 [2023-11-17 16:24:15,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 171 [2023-11-17 16:24:15,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:15,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 87 [2023-11-17 16:24:15,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1093 treesize of output 1061 [2023-11-17 16:24:15,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 509 treesize of output 493 [2023-11-17 16:24:15,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 493 treesize of output 461 [2023-11-17 16:24:15,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 233 treesize of output 225 [2023-11-17 16:24:15,621 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:15,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 86 [2023-11-17 16:24:15,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1077 treesize of output 1045 [2023-11-17 16:24:15,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 501 treesize of output 485 [2023-11-17 16:24:15,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 485 treesize of output 453 [2023-11-17 16:24:15,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 221 [2023-11-17 16:24:15,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-17 16:24:15,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941017782] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:24:15,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:24:15,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 11] total 31 [2023-11-17 16:24:15,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4577124] [2023-11-17 16:24:15,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:24:15,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-17 16:24:15,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:24:15,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-17 16:24:15,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=829, Unknown=5, NotChecked=60, Total=1056 [2023-11-17 16:24:15,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 472 [2023-11-17 16:24:15,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 403 transitions, 6224 flow. Second operand has 33 states, 33 states have (on average 133.1818181818182) internal successors, (4395), 33 states have internal predecessors, (4395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:15,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:24:15,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 472 [2023-11-17 16:24:15,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:24:19,230 INFO L124 PetriNetUnfolderBase]: 5771/8267 cut-off events. [2023-11-17 16:24:19,230 INFO L125 PetriNetUnfolderBase]: For 64123/64123 co-relation queries the response was YES. [2023-11-17 16:24:19,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52410 conditions, 8267 events. 5771/8267 cut-off events. For 64123/64123 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 42909 event pairs, 912 based on Foata normal form. 1/8268 useless extension candidates. Maximal degree in co-relation 52073. Up to 6203 conditions per place. [2023-11-17 16:24:19,297 INFO L140 encePairwiseOnDemand]: 457/472 looper letters, 265 selfloop transitions, 272 changer transitions 1/538 dead transitions. [2023-11-17 16:24:19,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 538 transitions, 8346 flow [2023-11-17 16:24:19,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-17 16:24:19,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-11-17 16:24:19,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3614 transitions. [2023-11-17 16:24:19,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2944915254237288 [2023-11-17 16:24:19,304 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 3614 transitions. [2023-11-17 16:24:19,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 3614 transitions. [2023-11-17 16:24:19,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:24:19,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 3614 transitions. [2023-11-17 16:24:19,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 139.0) internal successors, (3614), 26 states have internal predecessors, (3614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:19,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 472.0) internal successors, (12744), 27 states have internal predecessors, (12744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:19,318 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 472.0) internal successors, (12744), 27 states have internal predecessors, (12744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:19,318 INFO L175 Difference]: Start difference. First operand has 198 places, 403 transitions, 6224 flow. Second operand 26 states and 3614 transitions. [2023-11-17 16:24:19,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 538 transitions, 8346 flow [2023-11-17 16:24:19,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 538 transitions, 8000 flow, removed 96 selfloop flow, removed 15 redundant places. [2023-11-17 16:24:19,645 INFO L231 Difference]: Finished difference. Result has 212 places, 431 transitions, 6966 flow [2023-11-17 16:24:19,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=5894, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=244, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=6966, PETRI_PLACES=212, PETRI_TRANSITIONS=431} [2023-11-17 16:24:19,646 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 180 predicate places. [2023-11-17 16:24:19,646 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 431 transitions, 6966 flow [2023-11-17 16:24:19,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 133.1818181818182) internal successors, (4395), 33 states have internal predecessors, (4395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:19,647 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:24:19,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:24:19,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-17 16:24:19,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-17 16:24:19,851 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:24:19,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:24:19,851 INFO L85 PathProgramCache]: Analyzing trace with hash -2131297905, now seen corresponding path program 10 times [2023-11-17 16:24:19,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:24:19,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049986379] [2023-11-17 16:24:19,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:19,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:24:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:20,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:20,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:24:20,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049986379] [2023-11-17 16:24:20,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049986379] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:24:20,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950051468] [2023-11-17 16:24:20,847 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 16:24:20,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:20,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:24:20,849 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:24:20,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-17 16:24:20,975 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 16:24:20,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:24:20,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-17 16:24:20,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:24:20,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:24:20,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2023-11-17 16:24:21,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 16:24:21,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:24:21,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-17 16:24:21,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 46 [2023-11-17 16:24:21,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:24:21,651 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:24:22,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:22,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2592 treesize of output 2288 [2023-11-17 16:24:23,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:23,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1283 treesize of output 1262 [2023-11-17 16:24:23,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:23,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1253 treesize of output 1202 [2023-11-17 16:24:23,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:23,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1193 treesize of output 1184 [2023-11-17 16:24:23,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:23,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1175 treesize of output 1148 [2023-11-17 16:24:23,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:23,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1139 treesize of output 1100 [2023-11-17 16:24:23,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:23,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1091 treesize of output 1076 [2023-11-17 16:24:23,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:23,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1067 treesize of output 1040 [2023-11-17 16:24:23,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:23,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1031 treesize of output 1022 [2023-11-17 16:24:23,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:23,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1013 treesize of output 1004 [2023-11-17 16:24:23,302 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-11-17 16:24:23,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:23,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 995 treesize of output 968 [2023-11-17 16:24:23,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:23,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 959 treesize of output 944 [2023-11-17 16:24:23,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:23,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 935 treesize of output 896 [2023-11-17 16:24:26,047 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:24:26,047 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:24:26,051 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-17 16:24:26,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 1 [2023-11-17 16:24:26,214 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:24:26,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950051468] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:24:26,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:24:26,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 31 [2023-11-17 16:24:26,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739668765] [2023-11-17 16:24:26,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:24:26,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-17 16:24:26,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:24:26,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-17 16:24:26,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=892, Unknown=3, NotChecked=0, Total=1056 [2023-11-17 16:24:26,217 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 472 [2023-11-17 16:24:26,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 431 transitions, 6966 flow. Second operand has 33 states, 33 states have (on average 136.1818181818182) internal successors, (4494), 33 states have internal predecessors, (4494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:26,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:24:26,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 472 [2023-11-17 16:24:26,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:24:30,593 INFO L124 PetriNetUnfolderBase]: 6849/9858 cut-off events. [2023-11-17 16:24:30,593 INFO L125 PetriNetUnfolderBase]: For 99671/99671 co-relation queries the response was YES. [2023-11-17 16:24:30,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68887 conditions, 9858 events. 6849/9858 cut-off events. For 99671/99671 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 53169 event pairs, 1003 based on Foata normal form. 1/9859 useless extension candidates. Maximal degree in co-relation 68544. Up to 7316 conditions per place. [2023-11-17 16:24:30,675 INFO L140 encePairwiseOnDemand]: 457/472 looper letters, 394 selfloop transitions, 400 changer transitions 1/795 dead transitions. [2023-11-17 16:24:30,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 795 transitions, 14015 flow [2023-11-17 16:24:30,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-17 16:24:30,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-11-17 16:24:30,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 4688 transitions. [2023-11-17 16:24:30,681 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3009758602978942 [2023-11-17 16:24:30,681 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 4688 transitions. [2023-11-17 16:24:30,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 4688 transitions. [2023-11-17 16:24:30,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:24:30,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 4688 transitions. [2023-11-17 16:24:30,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 142.06060606060606) internal successors, (4688), 33 states have internal predecessors, (4688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:30,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 472.0) internal successors, (16048), 34 states have internal predecessors, (16048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:30,699 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 472.0) internal successors, (16048), 34 states have internal predecessors, (16048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:30,699 INFO L175 Difference]: Start difference. First operand has 212 places, 431 transitions, 6966 flow. Second operand 33 states and 4688 transitions. [2023-11-17 16:24:30,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 795 transitions, 14015 flow [2023-11-17 16:24:31,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 795 transitions, 13655 flow, removed 51 selfloop flow, removed 16 redundant places. [2023-11-17 16:24:31,148 INFO L231 Difference]: Finished difference. Result has 239 places, 664 transitions, 12623 flow [2023-11-17 16:24:31,148 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=6744, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=12623, PETRI_PLACES=239, PETRI_TRANSITIONS=664} [2023-11-17 16:24:31,149 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 207 predicate places. [2023-11-17 16:24:31,149 INFO L495 AbstractCegarLoop]: Abstraction has has 239 places, 664 transitions, 12623 flow [2023-11-17 16:24:31,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 136.1818181818182) internal successors, (4494), 33 states have internal predecessors, (4494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:31,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:24:31,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:24:31,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-17 16:24:31,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-17 16:24:31,350 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:24:31,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:24:31,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1087839739, now seen corresponding path program 11 times [2023-11-17 16:24:31,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:24:31,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298938993] [2023-11-17 16:24:31,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:31,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:24:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:32,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:32,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:24:32,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298938993] [2023-11-17 16:24:32,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298938993] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:24:32,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988319013] [2023-11-17 16:24:32,264 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 16:24:32,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:32,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:24:32,265 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:24:32,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-17 16:24:32,361 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:24:32,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:24:32,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-17 16:24:32,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:24:32,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:24:32,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2023-11-17 16:24:32,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:24:32,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 47 [2023-11-17 16:24:32,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 47 [2023-11-17 16:24:33,138 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-17 16:24:33,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 61 [2023-11-17 16:24:33,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:24:33,232 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:24:34,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:34,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1184 treesize of output 1048 [2023-11-17 16:24:34,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 543 treesize of output 519 [2023-11-17 16:24:34,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 519 treesize of output 507 [2023-11-17 16:24:34,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 507 treesize of output 495 [2023-11-17 16:24:34,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 495 treesize of output 471 [2023-11-17 16:24:34,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 471 treesize of output 465 [2023-11-17 16:24:34,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 465 treesize of output 453 [2023-11-17 16:24:34,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 453 treesize of output 441 [2023-11-17 16:24:34,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 441 treesize of output 417 [2023-11-17 16:24:42,606 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-11-17 16:24:42,652 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-11-17 16:24:42,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 871 treesize of output 1 [2023-11-17 16:24:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:24:42,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988319013] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:24:42,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:24:42,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 29 [2023-11-17 16:24:42,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394088056] [2023-11-17 16:24:42,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:24:42,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-17 16:24:42,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:24:42,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-17 16:24:42,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=793, Unknown=4, NotChecked=0, Total=930 [2023-11-17 16:24:42,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 472 [2023-11-17 16:24:42,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 664 transitions, 12623 flow. Second operand has 31 states, 31 states have (on average 140.32258064516128) internal successors, (4350), 31 states have internal predecessors, (4350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:42,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:24:42,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 472 [2023-11-17 16:24:42,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:24:47,970 INFO L124 PetriNetUnfolderBase]: 8011/11678 cut-off events. [2023-11-17 16:24:47,970 INFO L125 PetriNetUnfolderBase]: For 156463/156463 co-relation queries the response was YES. [2023-11-17 16:24:48,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89680 conditions, 11678 events. 8011/11678 cut-off events. For 156463/156463 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 66882 event pairs, 482 based on Foata normal form. 151/11829 useless extension candidates. Maximal degree in co-relation 89102. Up to 6360 conditions per place. [2023-11-17 16:24:48,099 INFO L140 encePairwiseOnDemand]: 458/472 looper letters, 478 selfloop transitions, 713 changer transitions 6/1197 dead transitions. [2023-11-17 16:24:48,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 1197 transitions, 22014 flow [2023-11-17 16:24:48,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-11-17 16:24:48,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-11-17 16:24:48,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 4605 transitions. [2023-11-17 16:24:48,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31472115910333515 [2023-11-17 16:24:48,103 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 4605 transitions. [2023-11-17 16:24:48,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 4605 transitions. [2023-11-17 16:24:48,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:24:48,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 4605 transitions. [2023-11-17 16:24:48,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 148.5483870967742) internal successors, (4605), 31 states have internal predecessors, (4605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:48,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 472.0) internal successors, (15104), 32 states have internal predecessors, (15104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:48,120 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 472.0) internal successors, (15104), 32 states have internal predecessors, (15104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:48,120 INFO L175 Difference]: Start difference. First operand has 239 places, 664 transitions, 12623 flow. Second operand 31 states and 4605 transitions. [2023-11-17 16:24:48,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 1197 transitions, 22014 flow [2023-11-17 16:24:49,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 1197 transitions, 20856 flow, removed 213 selfloop flow, removed 9 redundant places. [2023-11-17 16:24:49,335 INFO L231 Difference]: Finished difference. Result has 275 places, 965 transitions, 19649 flow [2023-11-17 16:24:49,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=10929, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=620, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=383, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=19649, PETRI_PLACES=275, PETRI_TRANSITIONS=965} [2023-11-17 16:24:49,336 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 243 predicate places. [2023-11-17 16:24:49,336 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 965 transitions, 19649 flow [2023-11-17 16:24:49,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 140.32258064516128) internal successors, (4350), 31 states have internal predecessors, (4350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:49,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:24:49,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:24:49,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-17 16:24:49,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-17 16:24:49,538 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:24:49,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:24:49,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1589568295, now seen corresponding path program 12 times [2023-11-17 16:24:49,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:24:49,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604212818] [2023-11-17 16:24:49,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:49,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:24:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:50,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:50,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:24:50,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604212818] [2023-11-17 16:24:50,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604212818] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:24:50,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218142944] [2023-11-17 16:24:50,207 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 16:24:50,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:50,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:24:50,208 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:24:50,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-17 16:24:50,336 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-17 16:24:50,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:24:50,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-17 16:24:50,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:24:50,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 52 [2023-11-17 16:24:50,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:24:50,804 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:24:51,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:24:51,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 208 treesize of output 120 [2023-11-17 16:24:51,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:24:51,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218142944] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:24:51,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:24:51,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 25 [2023-11-17 16:24:51,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019777023] [2023-11-17 16:24:51,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:24:51,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-17 16:24:51,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:24:51,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-17 16:24:51,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2023-11-17 16:24:51,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 472 [2023-11-17 16:24:51,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 965 transitions, 19649 flow. Second operand has 27 states, 27 states have (on average 144.66666666666666) internal successors, (3906), 27 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:51,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:24:51,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 472 [2023-11-17 16:24:51,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:24:55,243 INFO L124 PetriNetUnfolderBase]: 8418/12276 cut-off events. [2023-11-17 16:24:55,243 INFO L125 PetriNetUnfolderBase]: For 214197/214197 co-relation queries the response was YES. [2023-11-17 16:24:55,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105446 conditions, 12276 events. 8418/12276 cut-off events. For 214197/214197 co-relation queries the response was YES. Maximal size of possible extension queue 681. Compared 70619 event pairs, 999 based on Foata normal form. 1/12277 useless extension candidates. Maximal degree in co-relation 104799. Up to 9029 conditions per place. [2023-11-17 16:24:55,370 INFO L140 encePairwiseOnDemand]: 459/472 looper letters, 457 selfloop transitions, 676 changer transitions 1/1134 dead transitions. [2023-11-17 16:24:55,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 1134 transitions, 24381 flow [2023-11-17 16:24:55,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-17 16:24:55,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-11-17 16:24:55,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3304 transitions. [2023-11-17 16:24:55,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3181818181818182 [2023-11-17 16:24:55,374 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 3304 transitions. [2023-11-17 16:24:55,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 3304 transitions. [2023-11-17 16:24:55,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:24:55,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3304 transitions. [2023-11-17 16:24:55,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 150.1818181818182) internal successors, (3304), 22 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:55,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 472.0) internal successors, (10856), 23 states have internal predecessors, (10856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:55,387 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 472.0) internal successors, (10856), 23 states have internal predecessors, (10856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:55,387 INFO L175 Difference]: Start difference. First operand has 275 places, 965 transitions, 19649 flow. Second operand 22 states and 3304 transitions. [2023-11-17 16:24:55,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 1134 transitions, 24381 flow [2023-11-17 16:24:57,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 1134 transitions, 22987 flow, removed 519 selfloop flow, removed 10 redundant places. [2023-11-17 16:24:57,232 INFO L231 Difference]: Finished difference. Result has 291 places, 1030 transitions, 21416 flow [2023-11-17 16:24:57,233 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=18435, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=965, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=616, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=21416, PETRI_PLACES=291, PETRI_TRANSITIONS=1030} [2023-11-17 16:24:57,233 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 259 predicate places. [2023-11-17 16:24:57,233 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 1030 transitions, 21416 flow [2023-11-17 16:24:57,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 144.66666666666666) internal successors, (3906), 27 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:24:57,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:24:57,234 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:24:57,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-17 16:24:57,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-17 16:24:57,435 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:24:57,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:24:57,435 INFO L85 PathProgramCache]: Analyzing trace with hash -775570163, now seen corresponding path program 13 times [2023-11-17 16:24:57,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:24:57,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009837987] [2023-11-17 16:24:57,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:24:57,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:24:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:58,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:24:58,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009837987] [2023-11-17 16:24:58,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009837987] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:24:58,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992190074] [2023-11-17 16:24:58,065 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 16:24:58,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:24:58,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:24:58,066 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:24:58,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-17 16:24:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:24:58,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-17 16:24:58,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:24:58,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-17 16:24:58,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 16:24:58,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 16:24:58,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 16:24:58,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 52 [2023-11-17 16:24:58,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:24:58,935 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:24:59,913 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse4 (+ c_~sum~0 c_~mts2~0))) (and (forall ((v_ArrVal_537 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_537) c_~A~0.base))) (let ((.cse1 (select .cse2 .cse3)) (.cse0 (select .cse2 c_~A~0.offset))) (or (< (+ .cse0 c_~mts1~0 2147483648) 0) (< 0 (+ c_~mts3~0 1 .cse1)) (< (+ c_~sum~0 c_~mts2~0 .cse1) 1) (< 0 (+ .cse0 c_~mts1~0 1)))))) (or (< c_~mts3~0 .cse4) (forall ((v_ArrVal_537 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_537) c_~A~0.base))) (let ((.cse5 (+ c_~mts3~0 (select .cse7 .cse3))) (.cse6 (+ (select .cse7 c_~A~0.offset) c_~mts1~0))) (or (< .cse5 0) (= .cse5 .cse6) (< .cse6 0) (< 2147483647 .cse6)))))) (forall ((v_ArrVal_537 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_537) c_~A~0.base))) (let ((.cse8 (+ c_~mts3~0 (select .cse10 .cse3))) (.cse9 (select .cse10 c_~A~0.offset))) (or (= .cse8 0) (< (+ .cse9 c_~mts1~0 2147483648) 0) (< .cse8 0) (< 0 (+ .cse9 c_~mts1~0 1)))))) (forall ((v_ArrVal_537 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_537) c_~A~0.base))) (let ((.cse11 (select .cse14 .cse3))) (let ((.cse12 (+ c_~sum~0 c_~mts2~0 .cse11)) (.cse13 (+ (select .cse14 c_~A~0.offset) c_~mts1~0))) (or (< 0 (+ c_~mts3~0 1 .cse11)) (< .cse12 1) (= .cse12 .cse13) (< .cse13 0) (< 2147483647 .cse13)))))) (forall ((v_ArrVal_537 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_537) c_~A~0.base))) (let ((.cse17 (select .cse18 .cse3))) (let ((.cse15 (+ c_~mts3~0 .cse17)) (.cse16 (+ (select .cse18 c_~A~0.offset) c_~mts1~0))) (or (< .cse15 0) (= .cse15 .cse16) (= (+ c_~sum~0 c_~mts2~0 .cse17) .cse16) (< .cse16 0) (< 2147483647 .cse16)))))) (forall ((v_ArrVal_537 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_537) c_~A~0.base))) (let ((.cse19 (select .cse21 .cse3)) (.cse20 (+ (select .cse21 c_~A~0.offset) c_~mts1~0))) (or (< 0 (+ c_~mts3~0 1 .cse19)) (= .cse20 0) (= (+ c_~sum~0 c_~mts2~0 .cse19) .cse20) (< .cse20 0) (< 2147483647 .cse20))))) (forall ((v_ArrVal_537 (Array Int Int))) (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_537) c_~A~0.base))) (let ((.cse23 (select .cse24 .cse3)) (.cse22 (select .cse24 c_~A~0.offset))) (or (< (+ .cse22 c_~mts1~0 2147483648) 0) (< (+ c_~sum~0 c_~mts2~0 .cse23) 1) (< (+ c_~mts3~0 .cse23) 0) (< 0 (+ .cse22 c_~mts1~0 1)))))) (or (forall ((v_ArrVal_537 (Array Int Int))) (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_537) c_~A~0.base))) (let ((.cse25 (select .cse27 .cse3)) (.cse26 (+ (select .cse27 c_~A~0.offset) c_~mts1~0))) (or (< (+ c_~mts3~0 .cse25) 0) (= (+ c_~sum~0 c_~mts2~0 .cse25) .cse26) (< .cse26 0) (< 2147483647 .cse26))))) (< .cse4 (+ c_~mts3~0 1))))) is different from false [2023-11-17 16:25:00,126 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~sum~0 c_~mts2~0)) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_537) c_~A~0.base))) (let ((.cse1 (+ c_~mts3~0 (select .cse2 .cse3))) (.cse0 (+ c_~mts1~0 (select .cse2 c_~A~0.offset)))) (or (= .cse0 .cse1) (< .cse0 0) (< .cse1 0) (< 2147483647 .cse0))))) (< c_~mts3~0 .cse4)) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_537) c_~A~0.base))) (let ((.cse5 (select .cse7 c_~A~0.offset)) (.cse6 (+ c_~mts3~0 (select .cse7 .cse3)))) (or (< 0 (+ c_~mts1~0 .cse5 1)) (< .cse6 0) (< (+ c_~mts1~0 .cse5 2147483648) 0) (= .cse6 0))))) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int))) (let ((.cse10 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_537) c_~A~0.base))) (let ((.cse8 (select .cse10 .cse3)) (.cse9 (select .cse10 c_~A~0.offset))) (or (< (+ c_~sum~0 .cse8 c_~mts2~0) 1) (< 0 (+ c_~mts1~0 .cse9 1)) (< (+ c_~mts3~0 .cse8) 0) (< (+ c_~mts1~0 .cse9 2147483648) 0))))) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_537) c_~A~0.base))) (let ((.cse11 (select .cse13 .cse3)) (.cse12 (select .cse13 c_~A~0.offset))) (or (< 0 (+ c_~mts3~0 .cse11 1)) (< (+ c_~sum~0 .cse11 c_~mts2~0) 1) (< 0 (+ c_~mts1~0 .cse12 1)) (< (+ c_~mts1~0 .cse12 2147483648) 0))))) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_537) c_~A~0.base))) (let ((.cse14 (select .cse17 .cse3))) (let ((.cse16 (+ c_~sum~0 .cse14 c_~mts2~0)) (.cse15 (+ c_~mts1~0 (select .cse17 c_~A~0.offset)))) (or (< 0 (+ c_~mts3~0 .cse14 1)) (< .cse15 0) (< .cse16 1) (= .cse15 .cse16) (< 2147483647 .cse15)))))) (or (< .cse4 (+ c_~mts3~0 1)) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_537) c_~A~0.base))) (let ((.cse19 (select .cse20 .cse3)) (.cse18 (+ c_~mts1~0 (select .cse20 c_~A~0.offset)))) (or (< .cse18 0) (= .cse18 (+ c_~sum~0 .cse19 c_~mts2~0)) (< (+ c_~mts3~0 .cse19) 0) (< 2147483647 .cse18)))))) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_537) c_~A~0.base))) (let ((.cse23 (select .cse24 .cse3))) (let ((.cse22 (+ c_~mts3~0 .cse23)) (.cse21 (+ c_~mts1~0 (select .cse24 c_~A~0.offset)))) (or (= .cse21 .cse22) (< .cse21 0) (= .cse21 (+ c_~sum~0 .cse23 c_~mts2~0)) (< .cse22 0) (< 2147483647 .cse21)))))) (forall ((v_ArrVal_537 (Array Int Int)) (v_ArrVal_536 (Array Int Int))) (let ((.cse27 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_536) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_537) c_~A~0.base))) (let ((.cse25 (select .cse27 .cse3)) (.cse26 (+ c_~mts1~0 (select .cse27 c_~A~0.offset)))) (or (< 0 (+ c_~mts3~0 .cse25 1)) (< .cse26 0) (= .cse26 (+ c_~sum~0 .cse25 c_~mts2~0)) (= .cse26 0) (< 2147483647 .cse26))))))) is different from false [2023-11-17 16:25:00,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:25:00,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 156 treesize of output 108 [2023-11-17 16:25:00,761 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:25:00,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5157 treesize of output 4941 [2023-11-17 16:25:00,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:25:00,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 291 treesize of output 281 [2023-11-17 16:25:00,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:25:00,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 577 treesize of output 513 [2023-11-17 16:25:00,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:25:00,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 269 treesize of output 241 [2023-11-17 16:25:01,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:25:01,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 193 treesize of output 133 [2023-11-17 16:25:01,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:25:01,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 6698 treesize of output 6418 [2023-11-17 16:25:01,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:25:01,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 368 treesize of output 352 [2023-11-17 16:25:01,836 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:25:01,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 730 treesize of output 642 [2023-11-17 16:25:01,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:25:01,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 339 treesize of output 299 [2023-11-17 16:25:02,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:25:02,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 109 [2023-11-17 16:25:02,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:25:02,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5221 treesize of output 5005 [2023-11-17 16:25:02,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:25:02,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 295 treesize of output 285 [2023-11-17 16:25:02,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:25:02,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 585 treesize of output 521 [2023-11-17 16:25:02,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:25:02,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 273 treesize of output 245 [2023-11-17 16:25:03,830 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:25:03,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 218 treesize of output 1 [2023-11-17 16:25:03,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:25:03,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 128 [2023-11-17 16:25:03,854 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:25:03,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 750 treesize of output 722 [2023-11-17 16:25:03,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:25:03,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 367 treesize of output 344 [2023-11-17 16:25:03,905 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:25:03,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 692 treesize of output 656 [2023-11-17 16:25:03,932 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:25:03,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 646 treesize of output 570 [2023-11-17 16:25:04,388 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:25:04,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 1 [2023-11-17 16:25:04,397 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:25:04,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 1 [2023-11-17 16:25:04,405 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:25:04,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 1 [2023-11-17 16:25:04,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:25:04,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992190074] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:25:04,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:25:04,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 28 [2023-11-17 16:25:04,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099248712] [2023-11-17 16:25:04,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:25:04,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-17 16:25:04,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:25:04,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-17 16:25:04,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=634, Unknown=2, NotChecked=106, Total=870 [2023-11-17 16:25:04,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 472 [2023-11-17 16:25:04,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 1030 transitions, 21416 flow. Second operand has 30 states, 30 states have (on average 137.4) internal successors, (4122), 30 states have internal predecessors, (4122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:04,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:25:04,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 472 [2023-11-17 16:25:04,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:25:08,484 INFO L124 PetriNetUnfolderBase]: 8688/12667 cut-off events. [2023-11-17 16:25:08,484 INFO L125 PetriNetUnfolderBase]: For 225643/225643 co-relation queries the response was YES. [2023-11-17 16:25:08,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107912 conditions, 12667 events. 8688/12667 cut-off events. For 225643/225643 co-relation queries the response was YES. Maximal size of possible extension queue 683. Compared 72771 event pairs, 1681 based on Foata normal form. 1/12668 useless extension candidates. Maximal degree in co-relation 107483. Up to 11624 conditions per place. [2023-11-17 16:25:08,616 INFO L140 encePairwiseOnDemand]: 462/472 looper letters, 898 selfloop transitions, 211 changer transitions 1/1110 dead transitions. [2023-11-17 16:25:08,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 1110 transitions, 24769 flow [2023-11-17 16:25:08,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 16:25:08,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 16:25:08,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1449 transitions. [2023-11-17 16:25:08,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3069915254237288 [2023-11-17 16:25:08,619 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1449 transitions. [2023-11-17 16:25:08,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1449 transitions. [2023-11-17 16:25:08,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:25:08,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1449 transitions. [2023-11-17 16:25:08,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 144.9) internal successors, (1449), 10 states have internal predecessors, (1449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:08,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 472.0) internal successors, (5192), 11 states have internal predecessors, (5192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:08,624 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 472.0) internal successors, (5192), 11 states have internal predecessors, (5192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:08,624 INFO L175 Difference]: Start difference. First operand has 291 places, 1030 transitions, 21416 flow. Second operand 10 states and 1449 transitions. [2023-11-17 16:25:08,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 1110 transitions, 24769 flow [2023-11-17 16:25:10,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 1110 transitions, 24089 flow, removed 217 selfloop flow, removed 11 redundant places. [2023-11-17 16:25:10,290 INFO L231 Difference]: Finished difference. Result has 291 places, 1058 transitions, 22003 flow [2023-11-17 16:25:10,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=20756, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1030, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=829, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=22003, PETRI_PLACES=291, PETRI_TRANSITIONS=1058} [2023-11-17 16:25:10,291 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 259 predicate places. [2023-11-17 16:25:10,292 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 1058 transitions, 22003 flow [2023-11-17 16:25:10,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 137.4) internal successors, (4122), 30 states have internal predecessors, (4122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:10,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:25:10,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:25:10,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-17 16:25:10,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:25:10,501 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:25:10,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:25:10,501 INFO L85 PathProgramCache]: Analyzing trace with hash -2137004081, now seen corresponding path program 14 times [2023-11-17 16:25:10,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:25:10,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864925264] [2023-11-17 16:25:10,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:25:10,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:25:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:25:11,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:25:11,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:25:11,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864925264] [2023-11-17 16:25:11,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864925264] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:25:11,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152611028] [2023-11-17 16:25:11,261 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:25:11,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:25:11,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:25:11,262 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:25:11,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-17 16:25:11,383 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:25:11,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:25:11,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-17 16:25:11,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:25:11,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 52 [2023-11-17 16:25:11,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:25:11,857 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:25:12,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:25:12,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 73 [2023-11-17 16:25:12,239 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:25:12,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 76 [2023-11-17 16:25:12,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:25:12,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152611028] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:25:12,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:25:12,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 26 [2023-11-17 16:25:12,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040718917] [2023-11-17 16:25:12,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:25:12,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-17 16:25:12,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:25:12,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-17 16:25:12,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2023-11-17 16:25:12,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 472 [2023-11-17 16:25:12,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 1058 transitions, 22003 flow. Second operand has 28 states, 28 states have (on average 144.57142857142858) internal successors, (4048), 28 states have internal predecessors, (4048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:12,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:25:12,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 472 [2023-11-17 16:25:12,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:25:16,830 INFO L124 PetriNetUnfolderBase]: 8976/13093 cut-off events. [2023-11-17 16:25:16,830 INFO L125 PetriNetUnfolderBase]: For 225741/225741 co-relation queries the response was YES. [2023-11-17 16:25:16,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112359 conditions, 13093 events. 8976/13093 cut-off events. For 225741/225741 co-relation queries the response was YES. Maximal size of possible extension queue 714. Compared 76079 event pairs, 1139 based on Foata normal form. 2/13095 useless extension candidates. Maximal degree in co-relation 111926. Up to 10105 conditions per place. [2023-11-17 16:25:16,978 INFO L140 encePairwiseOnDemand]: 459/472 looper letters, 522 selfloop transitions, 675 changer transitions 2/1199 dead transitions. [2023-11-17 16:25:16,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 1199 transitions, 26176 flow [2023-11-17 16:25:16,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-17 16:25:16,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-11-17 16:25:16,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3884 transitions. [2023-11-17 16:25:16,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3164928292046936 [2023-11-17 16:25:16,982 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 3884 transitions. [2023-11-17 16:25:16,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 3884 transitions. [2023-11-17 16:25:16,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:25:16,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 3884 transitions. [2023-11-17 16:25:16,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 149.3846153846154) internal successors, (3884), 26 states have internal predecessors, (3884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:16,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 472.0) internal successors, (12744), 27 states have internal predecessors, (12744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:16,994 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 472.0) internal successors, (12744), 27 states have internal predecessors, (12744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:16,994 INFO L175 Difference]: Start difference. First operand has 291 places, 1058 transitions, 22003 flow. Second operand 26 states and 3884 transitions. [2023-11-17 16:25:16,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 1199 transitions, 26176 flow [2023-11-17 16:25:18,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 1199 transitions, 25905 flow, removed 57 selfloop flow, removed 6 redundant places. [2023-11-17 16:25:18,664 INFO L231 Difference]: Finished difference. Result has 314 places, 1092 transitions, 24080 flow [2023-11-17 16:25:18,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=21748, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1058, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=646, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=24080, PETRI_PLACES=314, PETRI_TRANSITIONS=1092} [2023-11-17 16:25:18,665 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 282 predicate places. [2023-11-17 16:25:18,666 INFO L495 AbstractCegarLoop]: Abstraction has has 314 places, 1092 transitions, 24080 flow [2023-11-17 16:25:18,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 144.57142857142858) internal successors, (4048), 28 states have internal predecessors, (4048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:18,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:25:18,667 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] [2023-11-17 16:25:18,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-17 16:25:18,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-17 16:25:18,873 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:25:18,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:25:18,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1265173372, now seen corresponding path program 15 times [2023-11-17 16:25:18,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:25:18,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826203403] [2023-11-17 16:25:18,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:25:18,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:25:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:25:18,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:25:18,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:25:18,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826203403] [2023-11-17 16:25:18,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826203403] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:25:18,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305490924] [2023-11-17 16:25:18,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:25:18,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:25:18,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:25:18,974 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:25:18,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-17 16:25:19,077 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 16:25:19,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:25:19,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:25:19,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:25:19,160 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:25:19,161 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:25:19,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:25:19,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305490924] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:25:19,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:25:19,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2023-11-17 16:25:19,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929180425] [2023-11-17 16:25:19,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:25:19,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-17 16:25:19,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:25:19,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-17 16:25:19,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2023-11-17 16:25:19,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 472 [2023-11-17 16:25:19,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 1092 transitions, 24080 flow. Second operand has 20 states, 20 states have (on average 180.25) internal successors, (3605), 20 states have internal predecessors, (3605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:19,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:25:19,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 472 [2023-11-17 16:25:19,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:25:23,964 INFO L124 PetriNetUnfolderBase]: 11400/16668 cut-off events. [2023-11-17 16:25:23,964 INFO L125 PetriNetUnfolderBase]: For 347672/347672 co-relation queries the response was YES. [2023-11-17 16:25:24,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151676 conditions, 16668 events. 11400/16668 cut-off events. For 347672/347672 co-relation queries the response was YES. Maximal size of possible extension queue 922. Compared 101142 event pairs, 2147 based on Foata normal form. 24/16692 useless extension candidates. Maximal degree in co-relation 151208. Up to 9658 conditions per place. [2023-11-17 16:25:24,169 INFO L140 encePairwiseOnDemand]: 461/472 looper letters, 1034 selfloop transitions, 699 changer transitions 0/1733 dead transitions. [2023-11-17 16:25:24,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 1733 transitions, 40214 flow [2023-11-17 16:25:24,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 16:25:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-17 16:25:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2447 transitions. [2023-11-17 16:25:24,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3987940026075619 [2023-11-17 16:25:24,172 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2447 transitions. [2023-11-17 16:25:24,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2447 transitions. [2023-11-17 16:25:24,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:25:24,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2447 transitions. [2023-11-17 16:25:24,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 188.23076923076923) internal successors, (2447), 13 states have internal predecessors, (2447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:24,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 472.0) internal successors, (6608), 14 states have internal predecessors, (6608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:24,179 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 472.0) internal successors, (6608), 14 states have internal predecessors, (6608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:24,179 INFO L175 Difference]: Start difference. First operand has 314 places, 1092 transitions, 24080 flow. Second operand 13 states and 2447 transitions. [2023-11-17 16:25:24,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 1733 transitions, 40214 flow [2023-11-17 16:25:26,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 1733 transitions, 39492 flow, removed 174 selfloop flow, removed 16 redundant places. [2023-11-17 16:25:26,802 INFO L231 Difference]: Finished difference. Result has 315 places, 1433 transitions, 33540 flow [2023-11-17 16:25:26,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=23484, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1092, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=421, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=33540, PETRI_PLACES=315, PETRI_TRANSITIONS=1433} [2023-11-17 16:25:26,803 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 283 predicate places. [2023-11-17 16:25:26,803 INFO L495 AbstractCegarLoop]: Abstraction has has 315 places, 1433 transitions, 33540 flow [2023-11-17 16:25:26,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 180.25) internal successors, (3605), 20 states have internal predecessors, (3605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:26,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:25:26,804 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] [2023-11-17 16:25:26,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-17 16:25:27,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:25:27,005 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:25:27,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:25:27,005 INFO L85 PathProgramCache]: Analyzing trace with hash 742295860, now seen corresponding path program 16 times [2023-11-17 16:25:27,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:25:27,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199821521] [2023-11-17 16:25:27,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:25:27,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:25:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:25:27,111 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:25:27,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:25:27,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199821521] [2023-11-17 16:25:27,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199821521] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:25:27,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701314414] [2023-11-17 16:25:27,112 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 16:25:27,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:25:27,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:25:27,113 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:25:27,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-17 16:25:27,222 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 16:25:27,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:25:27,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:25:27,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:25:27,309 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:25:27,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:25:27,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:25:27,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701314414] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:25:27,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:25:27,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2023-11-17 16:25:27,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96484336] [2023-11-17 16:25:27,399 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:25:27,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-17 16:25:27,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:25:27,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-17 16:25:27,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2023-11-17 16:25:27,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 472 [2023-11-17 16:25:27,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 1433 transitions, 33540 flow. Second operand has 21 states, 21 states have (on average 180.04761904761904) internal successors, (3781), 21 states have internal predecessors, (3781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:27,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:25:27,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 472 [2023-11-17 16:25:27,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:25:33,842 INFO L124 PetriNetUnfolderBase]: 12784/18587 cut-off events. [2023-11-17 16:25:33,842 INFO L125 PetriNetUnfolderBase]: For 457792/457792 co-relation queries the response was YES. [2023-11-17 16:25:33,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182903 conditions, 18587 events. 12784/18587 cut-off events. For 457792/457792 co-relation queries the response was YES. Maximal size of possible extension queue 1008. Compared 113389 event pairs, 1927 based on Foata normal form. 24/18611 useless extension candidates. Maximal degree in co-relation 182333. Up to 9658 conditions per place. [2023-11-17 16:25:34,063 INFO L140 encePairwiseOnDemand]: 461/472 looper letters, 1204 selfloop transitions, 832 changer transitions 0/2036 dead transitions. [2023-11-17 16:25:34,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 2036 transitions, 48736 flow [2023-11-17 16:25:34,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-17 16:25:34,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-11-17 16:25:34,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 4725 transitions. [2023-11-17 16:25:34,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4004237288135593 [2023-11-17 16:25:34,068 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 4725 transitions. [2023-11-17 16:25:34,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 4725 transitions. [2023-11-17 16:25:34,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:25:34,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 4725 transitions. [2023-11-17 16:25:34,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 189.0) internal successors, (4725), 25 states have internal predecessors, (4725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:34,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 472.0) internal successors, (12272), 26 states have internal predecessors, (12272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:34,077 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 472.0) internal successors, (12272), 26 states have internal predecessors, (12272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:34,077 INFO L175 Difference]: Start difference. First operand has 315 places, 1433 transitions, 33540 flow. Second operand 25 states and 4725 transitions. [2023-11-17 16:25:34,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 2036 transitions, 48736 flow [2023-11-17 16:25:37,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 2036 transitions, 48597 flow, removed 66 selfloop flow, removed 3 redundant places. [2023-11-17 16:25:37,883 INFO L231 Difference]: Finished difference. Result has 343 places, 1556 transitions, 38930 flow [2023-11-17 16:25:37,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=33437, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=717, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=38930, PETRI_PLACES=343, PETRI_TRANSITIONS=1556} [2023-11-17 16:25:37,884 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 311 predicate places. [2023-11-17 16:25:37,884 INFO L495 AbstractCegarLoop]: Abstraction has has 343 places, 1556 transitions, 38930 flow [2023-11-17 16:25:37,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 180.04761904761904) internal successors, (3781), 21 states have internal predecessors, (3781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:37,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:25:37,886 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] [2023-11-17 16:25:37,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-17 16:25:38,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:25:38,093 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:25:38,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:25:38,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1321216974, now seen corresponding path program 17 times [2023-11-17 16:25:38,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:25:38,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987343487] [2023-11-17 16:25:38,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:25:38,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:25:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:25:38,189 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:25:38,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:25:38,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987343487] [2023-11-17 16:25:38,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987343487] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:25:38,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364246993] [2023-11-17 16:25:38,190 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 16:25:38,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:25:38,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:25:38,191 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:25:38,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-17 16:25:38,296 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:25:38,296 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:25:38,297 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:25:38,297 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:25:38,377 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:25:38,378 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:25:38,446 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:25:38,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364246993] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:25:38,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:25:38,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2023-11-17 16:25:38,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345070605] [2023-11-17 16:25:38,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:25:38,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-17 16:25:38,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:25:38,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-17 16:25:38,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2023-11-17 16:25:38,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 472 [2023-11-17 16:25:38,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 1556 transitions, 38930 flow. Second operand has 19 states, 19 states have (on average 180.31578947368422) internal successors, (3426), 19 states have internal predecessors, (3426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:38,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:25:38,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 472 [2023-11-17 16:25:38,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:25:45,785 INFO L124 PetriNetUnfolderBase]: 13850/20092 cut-off events. [2023-11-17 16:25:45,785 INFO L125 PetriNetUnfolderBase]: For 585872/585872 co-relation queries the response was YES. [2023-11-17 16:25:46,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211417 conditions, 20092 events. 13850/20092 cut-off events. For 585872/585872 co-relation queries the response was YES. Maximal size of possible extension queue 1086. Compared 122638 event pairs, 2930 based on Foata normal form. 132/20224 useless extension candidates. Maximal degree in co-relation 210997. Up to 12030 conditions per place. [2023-11-17 16:25:46,167 INFO L140 encePairwiseOnDemand]: 463/472 looper letters, 1561 selfloop transitions, 253 changer transitions 1/1815 dead transitions. [2023-11-17 16:25:46,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 1815 transitions, 47933 flow [2023-11-17 16:25:46,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 16:25:46,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 16:25:46,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1884 transitions. [2023-11-17 16:25:46,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39915254237288134 [2023-11-17 16:25:46,170 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1884 transitions. [2023-11-17 16:25:46,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1884 transitions. [2023-11-17 16:25:46,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:25:46,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1884 transitions. [2023-11-17 16:25:46,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 188.4) internal successors, (1884), 10 states have internal predecessors, (1884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:46,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 472.0) internal successors, (5192), 11 states have internal predecessors, (5192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:46,174 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 472.0) internal successors, (5192), 11 states have internal predecessors, (5192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:46,174 INFO L175 Difference]: Start difference. First operand has 343 places, 1556 transitions, 38930 flow. Second operand 10 states and 1884 transitions. [2023-11-17 16:25:46,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 1815 transitions, 47933 flow [2023-11-17 16:25:53,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 1815 transitions, 46568 flow, removed 412 selfloop flow, removed 8 redundant places. [2023-11-17 16:25:53,197 INFO L231 Difference]: Finished difference. Result has 349 places, 1614 transitions, 40608 flow [2023-11-17 16:25:53,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=37783, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=195, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=40608, PETRI_PLACES=349, PETRI_TRANSITIONS=1614} [2023-11-17 16:25:53,199 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 317 predicate places. [2023-11-17 16:25:53,199 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 1614 transitions, 40608 flow [2023-11-17 16:25:53,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 180.31578947368422) internal successors, (3426), 19 states have internal predecessors, (3426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:53,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:25:53,199 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] [2023-11-17 16:25:53,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-11-17 16:25:53,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:25:53,400 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:25:53,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:25:53,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1466006202, now seen corresponding path program 18 times [2023-11-17 16:25:53,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:25:53,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732000457] [2023-11-17 16:25:53,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:25:53,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:25:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:25:53,531 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:25:53,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:25:53,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732000457] [2023-11-17 16:25:53,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732000457] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:25:53,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371452721] [2023-11-17 16:25:53,532 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 16:25:53,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:25:53,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:25:53,533 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:25:53,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-17 16:25:53,658 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-17 16:25:53,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:25:53,659 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:25:53,660 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:25:53,729 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:25:53,729 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:25:53,809 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:25:53,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371452721] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:25:53,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:25:53,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2023-11-17 16:25:53,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944603984] [2023-11-17 16:25:53,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:25:53,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-17 16:25:53,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:25:53,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-17 16:25:53,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2023-11-17 16:25:53,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 472 [2023-11-17 16:25:53,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 1614 transitions, 40608 flow. Second operand has 20 states, 20 states have (on average 180.3) internal successors, (3606), 20 states have internal predecessors, (3606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:25:53,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:25:53,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 472 [2023-11-17 16:25:53,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:26:01,327 INFO L124 PetriNetUnfolderBase]: 14042/20430 cut-off events. [2023-11-17 16:26:01,328 INFO L125 PetriNetUnfolderBase]: For 533000/533000 co-relation queries the response was YES. [2023-11-17 16:26:01,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209721 conditions, 20430 events. 14042/20430 cut-off events. For 533000/533000 co-relation queries the response was YES. Maximal size of possible extension queue 1102. Compared 125959 event pairs, 1877 based on Foata normal form. 20/20450 useless extension candidates. Maximal degree in co-relation 208949. Up to 9237 conditions per place. [2023-11-17 16:26:01,621 INFO L140 encePairwiseOnDemand]: 462/472 looper letters, 1146 selfloop transitions, 943 changer transitions 0/2089 dead transitions. [2023-11-17 16:26:01,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 2089 transitions, 53597 flow [2023-11-17 16:26:01,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-17 16:26:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-17 16:26:01,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2824 transitions. [2023-11-17 16:26:01,624 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39887005649717516 [2023-11-17 16:26:01,624 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2824 transitions. [2023-11-17 16:26:01,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2824 transitions. [2023-11-17 16:26:01,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:26:01,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2824 transitions. [2023-11-17 16:26:01,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 188.26666666666668) internal successors, (2824), 15 states have internal predecessors, (2824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:26:01,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 472.0) internal successors, (7552), 16 states have internal predecessors, (7552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:26:01,632 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 472.0) internal successors, (7552), 16 states have internal predecessors, (7552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:26:01,632 INFO L175 Difference]: Start difference. First operand has 349 places, 1614 transitions, 40608 flow. Second operand 15 states and 2824 transitions. [2023-11-17 16:26:01,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 2089 transitions, 53597 flow [2023-11-17 16:26:05,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 2089 transitions, 53546 flow, removed 21 selfloop flow, removed 4 redundant places. [2023-11-17 16:26:05,828 INFO L231 Difference]: Finished difference. Result has 361 places, 1679 transitions, 44364 flow [2023-11-17 16:26:05,830 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=40583, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1614, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=878, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=735, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=44364, PETRI_PLACES=361, PETRI_TRANSITIONS=1679} [2023-11-17 16:26:05,830 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 329 predicate places. [2023-11-17 16:26:05,830 INFO L495 AbstractCegarLoop]: Abstraction has has 361 places, 1679 transitions, 44364 flow [2023-11-17 16:26:05,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 180.3) internal successors, (3606), 20 states have internal predecessors, (3606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:26:05,831 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:26:05,831 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] [2023-11-17 16:26:05,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-17 16:26:06,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:26:06,035 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:26:06,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:26:06,036 INFO L85 PathProgramCache]: Analyzing trace with hash -174894382, now seen corresponding path program 19 times [2023-11-17 16:26:06,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:26:06,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888051104] [2023-11-17 16:26:06,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:26:06,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:26:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:26:06,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:26:06,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:26:06,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888051104] [2023-11-17 16:26:06,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888051104] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:26:06,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002882921] [2023-11-17 16:26:06,146 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 16:26:06,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:26:06,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:26:06,155 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:26:06,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-17 16:26:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:26:06,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:26:06,293 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:26:06,409 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:26:06,409 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:26:06,509 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:26:06,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002882921] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:26:06,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:26:06,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2023-11-17 16:26:06,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262637319] [2023-11-17 16:26:06,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:26:06,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-17 16:26:06,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:26:06,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-17 16:26:06,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2023-11-17 16:26:06,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 472 [2023-11-17 16:26:06,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 1679 transitions, 44364 flow. Second operand has 21 states, 21 states have (on average 180.33333333333334) internal successors, (3787), 21 states have internal predecessors, (3787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:26:06,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:26:06,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 472 [2023-11-17 16:26:06,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:26:15,164 INFO L124 PetriNetUnfolderBase]: 15302/22245 cut-off events. [2023-11-17 16:26:15,164 INFO L125 PetriNetUnfolderBase]: For 602951/602951 co-relation queries the response was YES. [2023-11-17 16:26:15,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231443 conditions, 22245 events. 15302/22245 cut-off events. For 602951/602951 co-relation queries the response was YES. Maximal size of possible extension queue 1223. Compared 138883 event pairs, 2373 based on Foata normal form. 24/22269 useless extension candidates. Maximal degree in co-relation 230651. Up to 10123 conditions per place. [2023-11-17 16:26:15,505 INFO L140 encePairwiseOnDemand]: 461/472 looper letters, 1249 selfloop transitions, 1128 changer transitions 1/2378 dead transitions. [2023-11-17 16:26:15,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 2378 transitions, 61615 flow [2023-11-17 16:26:15,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-17 16:26:15,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-17 16:26:15,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3781 transitions. [2023-11-17 16:26:15,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40052966101694915 [2023-11-17 16:26:15,509 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3781 transitions. [2023-11-17 16:26:15,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3781 transitions. [2023-11-17 16:26:15,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:26:15,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3781 transitions. [2023-11-17 16:26:15,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 189.05) internal successors, (3781), 20 states have internal predecessors, (3781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:26:15,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 472.0) internal successors, (9912), 21 states have internal predecessors, (9912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:26:15,520 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 472.0) internal successors, (9912), 21 states have internal predecessors, (9912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:26:15,520 INFO L175 Difference]: Start difference. First operand has 361 places, 1679 transitions, 44364 flow. Second operand 20 states and 3781 transitions. [2023-11-17 16:26:15,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 2378 transitions, 61615 flow [2023-11-17 16:26:19,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 2378 transitions, 60608 flow, removed 99 selfloop flow, removed 4 redundant places. [2023-11-17 16:26:19,931 INFO L231 Difference]: Finished difference. Result has 387 places, 1956 transitions, 53331 flow [2023-11-17 16:26:19,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=43543, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=900, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=648, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=53331, PETRI_PLACES=387, PETRI_TRANSITIONS=1956} [2023-11-17 16:26:19,932 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 355 predicate places. [2023-11-17 16:26:19,932 INFO L495 AbstractCegarLoop]: Abstraction has has 387 places, 1956 transitions, 53331 flow [2023-11-17 16:26:19,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 180.33333333333334) internal successors, (3787), 21 states have internal predecessors, (3787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:26:19,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:26:19,933 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] [2023-11-17 16:26:19,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-11-17 16:26:20,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-17 16:26:20,134 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:26:20,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:26:20,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1697288756, now seen corresponding path program 20 times [2023-11-17 16:26:20,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:26:20,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899378949] [2023-11-17 16:26:20,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:26:20,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:26:20,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:26:20,240 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:26:20,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:26:20,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899378949] [2023-11-17 16:26:20,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899378949] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:26:20,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580464852] [2023-11-17 16:26:20,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:26:20,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:26:20,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:26:20,241 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:26:20,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-17 16:26:20,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:26:20,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:26:20,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:26:20,358 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:26:20,438 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:26:20,438 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:26:20,531 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:26:20,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580464852] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:26:20,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:26:20,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2023-11-17 16:26:20,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908990132] [2023-11-17 16:26:20,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:26:20,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-17 16:26:20,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:26:20,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-17 16:26:20,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2023-11-17 16:26:20,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 472 [2023-11-17 16:26:20,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 1956 transitions, 53331 flow. Second operand has 22 states, 22 states have (on average 180.0909090909091) internal successors, (3962), 22 states have internal predecessors, (3962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:26:20,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:26:20,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 472 [2023-11-17 16:26:20,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:26:30,763 INFO L124 PetriNetUnfolderBase]: 16347/23658 cut-off events. [2023-11-17 16:26:30,764 INFO L125 PetriNetUnfolderBase]: For 721415/721415 co-relation queries the response was YES. [2023-11-17 16:26:31,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263451 conditions, 23658 events. 16347/23658 cut-off events. For 721415/721415 co-relation queries the response was YES. Maximal size of possible extension queue 1275. Compared 147280 event pairs, 1845 based on Foata normal form. 20/23678 useless extension candidates. Maximal degree in co-relation 262623. Up to 10795 conditions per place. [2023-11-17 16:26:31,136 INFO L140 encePairwiseOnDemand]: 462/472 looper letters, 1406 selfloop transitions, 1249 changer transitions 0/2655 dead transitions. [2023-11-17 16:26:31,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 2655 transitions, 72223 flow [2023-11-17 16:26:31,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-17 16:26:31,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-11-17 16:26:31,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 5465 transitions. [2023-11-17 16:26:31,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39925482174167154 [2023-11-17 16:26:31,141 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 5465 transitions. [2023-11-17 16:26:31,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 5465 transitions. [2023-11-17 16:26:31,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:26:31,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 5465 transitions. [2023-11-17 16:26:31,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 188.44827586206895) internal successors, (5465), 29 states have internal predecessors, (5465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:26:31,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 472.0) internal successors, (14160), 30 states have internal predecessors, (14160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:26:31,153 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 472.0) internal successors, (14160), 30 states have internal predecessors, (14160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:26:31,153 INFO L175 Difference]: Start difference. First operand has 387 places, 1956 transitions, 53331 flow. Second operand 29 states and 5465 transitions. [2023-11-17 16:26:31,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 2655 transitions, 72223 flow [2023-11-17 16:26:37,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 2655 transitions, 71355 flow, removed 317 selfloop flow, removed 5 redundant places. [2023-11-17 16:26:37,570 INFO L231 Difference]: Finished difference. Result has 412 places, 2052 transitions, 58655 flow [2023-11-17 16:26:37,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=52539, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1955, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=789, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=58655, PETRI_PLACES=412, PETRI_TRANSITIONS=2052} [2023-11-17 16:26:37,572 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 380 predicate places. [2023-11-17 16:26:37,572 INFO L495 AbstractCegarLoop]: Abstraction has has 412 places, 2052 transitions, 58655 flow [2023-11-17 16:26:37,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 180.0909090909091) internal successors, (3962), 22 states have internal predecessors, (3962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:26:37,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:26:37,572 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] [2023-11-17 16:26:37,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-11-17 16:26:37,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-17 16:26:37,773 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:26:37,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:26:37,774 INFO L85 PathProgramCache]: Analyzing trace with hash 26973278, now seen corresponding path program 21 times [2023-11-17 16:26:37,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:26:37,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074622830] [2023-11-17 16:26:37,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:26:37,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:26:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:26:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:26:37,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:26:37,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074622830] [2023-11-17 16:26:37,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074622830] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:26:37,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845251100] [2023-11-17 16:26:37,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:26:37,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:26:37,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:26:37,930 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:26:37,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-17 16:26:38,065 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 16:26:38,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:26:38,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:26:38,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:26:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:26:38,156 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:26:38,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:26:38,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845251100] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:26:38,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:26:38,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2023-11-17 16:26:38,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887759982] [2023-11-17 16:26:38,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:26:38,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-17 16:26:38,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:26:38,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-17 16:26:38,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2023-11-17 16:26:38,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 472 [2023-11-17 16:26:38,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 2052 transitions, 58655 flow. Second operand has 22 states, 22 states have (on average 180.1818181818182) internal successors, (3964), 22 states have internal predecessors, (3964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:26:38,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:26:38,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 472 [2023-11-17 16:26:38,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:26:48,764 INFO L124 PetriNetUnfolderBase]: 16321/23605 cut-off events. [2023-11-17 16:26:48,764 INFO L125 PetriNetUnfolderBase]: For 756633/756633 co-relation queries the response was YES. [2023-11-17 16:26:49,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269168 conditions, 23605 events. 16321/23605 cut-off events. For 756633/756633 co-relation queries the response was YES. Maximal size of possible extension queue 1271. Compared 146540 event pairs, 2368 based on Foata normal form. 20/23625 useless extension candidates. Maximal degree in co-relation 268301. Up to 10771 conditions per place. [2023-11-17 16:26:49,174 INFO L140 encePairwiseOnDemand]: 462/472 looper letters, 1443 selfloop transitions, 1041 changer transitions 0/2484 dead transitions. [2023-11-17 16:26:49,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 2484 transitions, 71129 flow [2023-11-17 16:26:49,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-17 16:26:49,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-17 16:26:49,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3208 transitions. [2023-11-17 16:26:49,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39980059820538383 [2023-11-17 16:26:49,177 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3208 transitions. [2023-11-17 16:26:49,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3208 transitions. [2023-11-17 16:26:49,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:26:49,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3208 transitions. [2023-11-17 16:26:49,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 188.7058823529412) internal successors, (3208), 17 states have internal predecessors, (3208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:26:49,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 472.0) internal successors, (8496), 18 states have internal predecessors, (8496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:26:49,186 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 472.0) internal successors, (8496), 18 states have internal predecessors, (8496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:26:49,186 INFO L175 Difference]: Start difference. First operand has 412 places, 2052 transitions, 58655 flow. Second operand 17 states and 3208 transitions. [2023-11-17 16:26:49,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 2484 transitions, 71129 flow [2023-11-17 16:26:55,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 2484 transitions, 68743 flow, removed 110 selfloop flow, removed 14 redundant places. [2023-11-17 16:26:56,007 INFO L231 Difference]: Finished difference. Result has 414 places, 2055 transitions, 58543 flow [2023-11-17 16:26:56,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=56264, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2051, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1037, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1013, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=58543, PETRI_PLACES=414, PETRI_TRANSITIONS=2055} [2023-11-17 16:26:56,009 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 382 predicate places. [2023-11-17 16:26:56,009 INFO L495 AbstractCegarLoop]: Abstraction has has 414 places, 2055 transitions, 58543 flow [2023-11-17 16:26:56,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 180.1818181818182) internal successors, (3964), 22 states have internal predecessors, (3964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:26:56,009 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:26:56,009 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] [2023-11-17 16:26:56,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-11-17 16:26:56,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:26:56,211 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:26:56,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:26:56,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1729936288, now seen corresponding path program 22 times [2023-11-17 16:26:56,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:26:56,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902576445] [2023-11-17 16:26:56,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:26:56,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:26:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:26:56,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:26:56,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:26:56,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902576445] [2023-11-17 16:26:56,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902576445] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:26:56,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036979093] [2023-11-17 16:26:56,307 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 16:26:56,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:26:56,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:26:56,308 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:26:56,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-17 16:26:56,428 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 16:26:56,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:26:56,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:26:56,430 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:26:56,521 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:26:56,521 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:26:56,604 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:26:56,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036979093] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:26:56,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:26:56,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2023-11-17 16:26:56,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281102496] [2023-11-17 16:26:56,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:26:56,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-17 16:26:56,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:26:56,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-17 16:26:56,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2023-11-17 16:26:56,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 472 [2023-11-17 16:26:56,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 2055 transitions, 58543 flow. Second operand has 20 states, 20 states have (on average 180.4) internal successors, (3608), 20 states have internal predecessors, (3608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:26:56,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:26:56,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 472 [2023-11-17 16:26:56,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:27:07,107 INFO L124 PetriNetUnfolderBase]: 16296/23560 cut-off events. [2023-11-17 16:27:07,108 INFO L125 PetriNetUnfolderBase]: For 753431/753431 co-relation queries the response was YES. [2023-11-17 16:27:07,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268409 conditions, 23560 events. 16296/23560 cut-off events. For 753431/753431 co-relation queries the response was YES. Maximal size of possible extension queue 1235. Compared 145222 event pairs, 2923 based on Foata normal form. 18/23578 useless extension candidates. Maximal degree in co-relation 267548. Up to 10962 conditions per place. [2023-11-17 16:27:07,555 INFO L140 encePairwiseOnDemand]: 461/472 looper letters, 1346 selfloop transitions, 969 changer transitions 0/2315 dead transitions. [2023-11-17 16:27:07,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 2315 transitions, 67574 flow [2023-11-17 16:27:07,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-17 16:27:07,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-17 16:27:07,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2452 transitions. [2023-11-17 16:27:07,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39960886571056065 [2023-11-17 16:27:07,557 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2452 transitions. [2023-11-17 16:27:07,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2452 transitions. [2023-11-17 16:27:07,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:27:07,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2452 transitions. [2023-11-17 16:27:07,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 188.6153846153846) internal successors, (2452), 13 states have internal predecessors, (2452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:27:07,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 472.0) internal successors, (6608), 14 states have internal predecessors, (6608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:27:07,562 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 472.0) internal successors, (6608), 14 states have internal predecessors, (6608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:27:07,562 INFO L175 Difference]: Start difference. First operand has 414 places, 2055 transitions, 58543 flow. Second operand 13 states and 2452 transitions. [2023-11-17 16:27:07,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 2315 transitions, 67574 flow [2023-11-17 16:27:13,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 2315 transitions, 66319 flow, removed 34 selfloop flow, removed 7 redundant places. [2023-11-17 16:27:13,357 INFO L231 Difference]: Finished difference. Result has 419 places, 2054 transitions, 59207 flow [2023-11-17 16:27:13,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=57269, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2054, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=969, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1085, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=59207, PETRI_PLACES=419, PETRI_TRANSITIONS=2054} [2023-11-17 16:27:13,359 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 387 predicate places. [2023-11-17 16:27:13,360 INFO L495 AbstractCegarLoop]: Abstraction has has 419 places, 2054 transitions, 59207 flow [2023-11-17 16:27:13,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 180.4) internal successors, (3608), 20 states have internal predecessors, (3608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:27:13,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:27:13,360 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] [2023-11-17 16:27:13,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-11-17 16:27:13,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:27:13,568 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:27:13,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:27:13,568 INFO L85 PathProgramCache]: Analyzing trace with hash -253872045, now seen corresponding path program 23 times [2023-11-17 16:27:13,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:27:13,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586998354] [2023-11-17 16:27:13,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:27:13,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:27:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:27:13,642 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:27:13,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:27:13,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586998354] [2023-11-17 16:27:13,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586998354] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:27:13,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343145464] [2023-11-17 16:27:13,643 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 16:27:13,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:27:13,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:27:13,644 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:27:13,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-11-17 16:27:13,765 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-17 16:27:13,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:27:13,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-17 16:27:13,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:27:13,846 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:27:13,847 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:27:13,888 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:27:13,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343145464] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:27:13,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:27:13,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-11-17 16:27:13,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512653429] [2023-11-17 16:27:13,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:27:13,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-17 16:27:13,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:27:13,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-17 16:27:13,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2023-11-17 16:27:13,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 472 [2023-11-17 16:27:13,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 2054 transitions, 59207 flow. Second operand has 14 states, 14 states have (on average 187.14285714285714) internal successors, (2620), 14 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:27:13,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:27:13,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 472 [2023-11-17 16:27:13,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:27:22,733 INFO L124 PetriNetUnfolderBase]: 13468/20053 cut-off events. [2023-11-17 16:27:22,733 INFO L125 PetriNetUnfolderBase]: For 722065/722065 co-relation queries the response was YES. [2023-11-17 16:27:22,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231244 conditions, 20053 events. 13468/20053 cut-off events. For 722065/722065 co-relation queries the response was YES. Maximal size of possible extension queue 1092. Compared 128120 event pairs, 2808 based on Foata normal form. 1166/21219 useless extension candidates. Maximal degree in co-relation 230383. Up to 10226 conditions per place. [2023-11-17 16:27:23,043 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 1779 selfloop transitions, 202 changer transitions 3/1984 dead transitions. [2023-11-17 16:27:23,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 1984 transitions, 60592 flow [2023-11-17 16:27:23,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 16:27:23,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 16:27:23,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1367 transitions. [2023-11-17 16:27:23,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4137409200968523 [2023-11-17 16:27:23,045 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1367 transitions. [2023-11-17 16:27:23,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1367 transitions. [2023-11-17 16:27:23,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:27:23,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1367 transitions. [2023-11-17 16:27:23,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 195.28571428571428) internal successors, (1367), 7 states have internal predecessors, (1367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:27:23,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 472.0) internal successors, (3776), 8 states have internal predecessors, (3776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:27:23,048 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 472.0) internal successors, (3776), 8 states have internal predecessors, (3776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:27:23,048 INFO L175 Difference]: Start difference. First operand has 419 places, 2054 transitions, 59207 flow. Second operand 7 states and 1367 transitions. [2023-11-17 16:27:23,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 1984 transitions, 60592 flow [2023-11-17 16:27:27,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 1984 transitions, 58916 flow, removed 221 selfloop flow, removed 10 redundant places. [2023-11-17 16:27:27,933 INFO L231 Difference]: Finished difference. Result has 413 places, 1734 transitions, 49897 flow [2023-11-17 16:27:27,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=49557, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1737, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=49897, PETRI_PLACES=413, PETRI_TRANSITIONS=1734} [2023-11-17 16:27:27,935 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 381 predicate places. [2023-11-17 16:27:27,935 INFO L495 AbstractCegarLoop]: Abstraction has has 413 places, 1734 transitions, 49897 flow [2023-11-17 16:27:27,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 187.14285714285714) internal successors, (2620), 14 states have internal predecessors, (2620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:27:27,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:27:27,935 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:27:27,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-11-17 16:27:28,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-17 16:27:28,142 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:27:28,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:27:28,142 INFO L85 PathProgramCache]: Analyzing trace with hash 465216418, now seen corresponding path program 24 times [2023-11-17 16:27:28,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:27:28,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486884153] [2023-11-17 16:27:28,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:27:28,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:27:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:27:28,231 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:27:28,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:27:28,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486884153] [2023-11-17 16:27:28,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486884153] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:27:28,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620860145] [2023-11-17 16:27:28,232 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 16:27:28,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:27:28,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:27:28,233 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:27:28,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-11-17 16:27:28,375 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-17 16:27:28,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:27:28,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:27:28,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:27:28,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2023-11-17 16:27:28,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:27:28,438 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:27:28,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2023-11-17 16:27:28,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:27:28,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620860145] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:27:28,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:27:28,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-11-17 16:27:28,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021532446] [2023-11-17 16:27:28,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:27:28,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-17 16:27:28,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:27:28,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-17 16:27:28,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-11-17 16:27:28,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 472 [2023-11-17 16:27:28,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 1734 transitions, 49897 flow. Second operand has 14 states, 14 states have (on average 189.07142857142858) internal successors, (2647), 14 states have internal predecessors, (2647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:27:28,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:27:28,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 472 [2023-11-17 16:27:28,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:27:35,743 INFO L124 PetriNetUnfolderBase]: 12057/18171 cut-off events. [2023-11-17 16:27:35,743 INFO L125 PetriNetUnfolderBase]: For 614172/614172 co-relation queries the response was YES. [2023-11-17 16:27:35,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209829 conditions, 18171 events. 12057/18171 cut-off events. For 614172/614172 co-relation queries the response was YES. Maximal size of possible extension queue 906. Compared 116842 event pairs, 3049 based on Foata normal form. 439/18610 useless extension candidates. Maximal degree in co-relation 208971. Up to 10226 conditions per place. [2023-11-17 16:27:36,024 INFO L140 encePairwiseOnDemand]: 465/472 looper letters, 1645 selfloop transitions, 91 changer transitions 44/1780 dead transitions. [2023-11-17 16:27:36,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 1780 transitions, 53539 flow [2023-11-17 16:27:36,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 16:27:36,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 16:27:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1379 transitions. [2023-11-17 16:27:36,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4173728813559322 [2023-11-17 16:27:36,026 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1379 transitions. [2023-11-17 16:27:36,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1379 transitions. [2023-11-17 16:27:36,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:27:36,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1379 transitions. [2023-11-17 16:27:36,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:27:36,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 472.0) internal successors, (3776), 8 states have internal predecessors, (3776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:27:36,030 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 472.0) internal successors, (3776), 8 states have internal predecessors, (3776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:27:36,030 INFO L175 Difference]: Start difference. First operand has 413 places, 1734 transitions, 49897 flow. Second operand 7 states and 1379 transitions. [2023-11-17 16:27:36,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 1780 transitions, 53539 flow [2023-11-17 16:27:40,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 1780 transitions, 52349 flow, removed 390 selfloop flow, removed 5 redundant places. [2023-11-17 16:27:40,204 INFO L231 Difference]: Finished difference. Result has 415 places, 1546 transitions, 44540 flow [2023-11-17 16:27:40,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=44742, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1481, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=44540, PETRI_PLACES=415, PETRI_TRANSITIONS=1546} [2023-11-17 16:27:40,205 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 383 predicate places. [2023-11-17 16:27:40,205 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 1546 transitions, 44540 flow [2023-11-17 16:27:40,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 189.07142857142858) internal successors, (2647), 14 states have internal predecessors, (2647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:27:40,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:27:40,206 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] [2023-11-17 16:27:40,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-11-17 16:27:40,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-11-17 16:27:40,410 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:27:40,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:27:40,411 INFO L85 PathProgramCache]: Analyzing trace with hash -954502582, now seen corresponding path program 1 times [2023-11-17 16:27:40,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:27:40,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395449910] [2023-11-17 16:27:40,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:27:40,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:27:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:27:40,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:27:40,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:27:40,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395449910] [2023-11-17 16:27:40,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395449910] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:27:40,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537460393] [2023-11-17 16:27:40,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:27:40,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:27:40,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:27:40,484 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:27:40,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-11-17 16:27:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:27:40,603 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:27:40,603 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:27:40,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:27:40,640 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:27:40,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:27:40,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537460393] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:27:40,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:27:40,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-11-17 16:27:40,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280864369] [2023-11-17 16:27:40,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:27:40,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-17 16:27:40,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:27:40,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-17 16:27:40,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-11-17 16:27:40,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 472 [2023-11-17 16:27:40,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 1546 transitions, 44540 flow. Second operand has 13 states, 13 states have (on average 184.3846153846154) internal successors, (2397), 13 states have internal predecessors, (2397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:27:40,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:27:40,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 472 [2023-11-17 16:27:40,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:27:45,381 INFO L124 PetriNetUnfolderBase]: 8367/12604 cut-off events. [2023-11-17 16:27:45,382 INFO L125 PetriNetUnfolderBase]: For 460368/460368 co-relation queries the response was YES. [2023-11-17 16:27:45,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145487 conditions, 12604 events. 8367/12604 cut-off events. For 460368/460368 co-relation queries the response was YES. Maximal size of possible extension queue 606. Compared 76064 event pairs, 2476 based on Foata normal form. 346/12950 useless extension candidates. Maximal degree in co-relation 145345. Up to 10226 conditions per place. [2023-11-17 16:27:45,545 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 877 selfloop transitions, 3 changer transitions 205/1085 dead transitions. [2023-11-17 16:27:45,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 1085 transitions, 33126 flow [2023-11-17 16:27:45,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 16:27:45,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 16:27:45,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1148 transitions. [2023-11-17 16:27:45,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4053672316384181 [2023-11-17 16:27:45,547 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1148 transitions. [2023-11-17 16:27:45,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1148 transitions. [2023-11-17 16:27:45,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:27:45,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1148 transitions. [2023-11-17 16:27:45,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 191.33333333333334) internal successors, (1148), 6 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:27:45,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 472.0) internal successors, (3304), 7 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:27:45,550 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 472.0) internal successors, (3304), 7 states have internal predecessors, (3304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:27:45,550 INFO L175 Difference]: Start difference. First operand has 415 places, 1546 transitions, 44540 flow. Second operand 6 states and 1148 transitions. [2023-11-17 16:27:45,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 1085 transitions, 33126 flow [2023-11-17 16:27:48,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 1085 transitions, 29530 flow, removed 679 selfloop flow, removed 38 redundant places. [2023-11-17 16:27:48,062 INFO L231 Difference]: Finished difference. Result has 351 places, 880 transitions, 23739 flow [2023-11-17 16:27:48,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=26424, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1012, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1009, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=23739, PETRI_PLACES=351, PETRI_TRANSITIONS=880} [2023-11-17 16:27:48,063 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 319 predicate places. [2023-11-17 16:27:48,063 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 880 transitions, 23739 flow [2023-11-17 16:27:48,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 184.3846153846154) internal successors, (2397), 13 states have internal predecessors, (2397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:27:48,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:27:48,063 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:27:48,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-11-17 16:27:48,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-17 16:27:48,265 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:27:48,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:27:48,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1288132178, now seen corresponding path program 25 times [2023-11-17 16:27:48,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:27:48,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636739154] [2023-11-17 16:27:48,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:27:48,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:27:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:27:48,362 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:27:48,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:27:48,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636739154] [2023-11-17 16:27:48,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636739154] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:27:48,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004003117] [2023-11-17 16:27:48,364 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 16:27:48,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:27:48,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:27:48,365 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:27:48,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-11-17 16:27:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:27:48,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:27:48,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:27:48,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2023-11-17 16:27:48,592 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:27:48,592 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:27:48,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2023-11-17 16:27:48,656 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:27:48,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004003117] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:27:48,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:27:48,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2023-11-17 16:27:48,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507931121] [2023-11-17 16:27:48,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:27:48,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-17 16:27:48,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:27:48,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-17 16:27:48,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-11-17 16:27:48,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 472 [2023-11-17 16:27:48,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 880 transitions, 23739 flow. Second operand has 15 states, 15 states have (on average 189.13333333333333) internal successors, (2837), 15 states have internal predecessors, (2837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:27:48,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:27:48,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 472 [2023-11-17 16:27:48,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:27:52,319 INFO L124 PetriNetUnfolderBase]: 9175/12992 cut-off events. [2023-11-17 16:27:52,320 INFO L125 PetriNetUnfolderBase]: For 402533/402533 co-relation queries the response was YES. [2023-11-17 16:27:52,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156906 conditions, 12992 events. 9175/12992 cut-off events. For 402533/402533 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 68998 event pairs, 1342 based on Foata normal form. 342/13334 useless extension candidates. Maximal degree in co-relation 156786. Up to 6690 conditions per place. [2023-11-17 16:27:52,500 INFO L140 encePairwiseOnDemand]: 465/472 looper letters, 1548 selfloop transitions, 75 changer transitions 0/1623 dead transitions. [2023-11-17 16:27:52,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 1623 transitions, 48193 flow [2023-11-17 16:27:52,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 16:27:52,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 16:27:52,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1743 transitions. [2023-11-17 16:27:52,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4103107344632768 [2023-11-17 16:27:52,502 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1743 transitions. [2023-11-17 16:27:52,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1743 transitions. [2023-11-17 16:27:52,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:27:52,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1743 transitions. [2023-11-17 16:27:52,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 193.66666666666666) internal successors, (1743), 9 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:27:52,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 472.0) internal successors, (4720), 10 states have internal predecessors, (4720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:27:52,505 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 472.0) internal successors, (4720), 10 states have internal predecessors, (4720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:27:52,505 INFO L175 Difference]: Start difference. First operand has 351 places, 880 transitions, 23739 flow. Second operand 9 states and 1743 transitions. [2023-11-17 16:27:52,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 1623 transitions, 48193 flow [2023-11-17 16:27:54,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 1623 transitions, 44377 flow, removed 1046 selfloop flow, removed 33 redundant places. [2023-11-17 16:27:54,662 INFO L231 Difference]: Finished difference. Result has 256 places, 755 transitions, 18765 flow [2023-11-17 16:27:54,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=18206, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=739, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=18765, PETRI_PLACES=256, PETRI_TRANSITIONS=755} [2023-11-17 16:27:54,663 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 224 predicate places. [2023-11-17 16:27:54,663 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 755 transitions, 18765 flow [2023-11-17 16:27:54,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 189.13333333333333) internal successors, (2837), 15 states have internal predecessors, (2837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:27:54,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:27:54,664 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] [2023-11-17 16:27:54,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-11-17 16:27:54,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:27:54,870 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-17 16:27:54,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:27:54,870 INFO L85 PathProgramCache]: Analyzing trace with hash 191273297, now seen corresponding path program 26 times [2023-11-17 16:27:54,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:27:54,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714999874] [2023-11-17 16:27:54,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:27:54,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:27:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:27:57,128 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:27:57,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:27:57,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714999874] [2023-11-17 16:27:57,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714999874] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:27:57,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71710269] [2023-11-17 16:27:57,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:27:57,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:27:57,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:27:57,130 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:27:57,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-11-17 16:27:57,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:27:57,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:27:57,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-17 16:27:57,268 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:27:57,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:27:57,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 121 [2023-11-17 16:27:58,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:27:58,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 121 [2023-11-17 16:27:59,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:27:59,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 128 [2023-11-17 16:27:59,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:27:59,321 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:28:04,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:04,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 9732 treesize of output 7540 [2023-11-17 16:28:04,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:04,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5671 treesize of output 5639 [2023-11-17 16:28:04,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:04,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5639 treesize of output 5575 [2023-11-17 16:28:04,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:04,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5575 treesize of output 5543 [2023-11-17 16:28:05,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:05,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5543 treesize of output 5479 [2023-11-17 16:28:05,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:05,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5479 treesize of output 5447 [2023-11-17 16:28:05,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:05,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5447 treesize of output 5383 [2023-11-17 16:28:05,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:05,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5383 treesize of output 5319 [2023-11-17 16:28:05,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:05,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5319 treesize of output 5287 [2023-11-17 16:28:05,506 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:05,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5287 treesize of output 5261 [2023-11-17 16:28:05,571 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-11-17 16:28:05,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:05,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5261 treesize of output 5209 [2023-11-17 16:28:05,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:05,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5209 treesize of output 5119 [2023-11-17 16:28:05,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:05,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5119 treesize of output 5074 [2023-11-17 16:28:05,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:05,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5074 treesize of output 5010 [2023-11-17 16:28:06,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:06,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5010 treesize of output 4978 [2023-11-17 16:28:06,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:06,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4978 treesize of output 4888 [2023-11-17 16:28:06,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:06,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4888 treesize of output 4843 [2023-11-17 16:28:06,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:06,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4843 treesize of output 4791 [2023-11-17 16:28:06,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:06,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4791 treesize of output 4765 [2023-11-17 16:28:06,477 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:06,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4765 treesize of output 4699 [2023-11-17 16:28:06,542 INFO L209 tifierPushTermWalker]: Run 20 iterations without descend maybe there is a nontermination bug. [2023-11-17 16:28:06,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:06,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4699 treesize of output 4666 [2023-11-17 16:28:06,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:06,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4666 treesize of output 4614 [2023-11-17 16:28:06,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:06,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4614 treesize of output 4588 [2023-11-17 16:28:06,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:06,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4588 treesize of output 4510 [2023-11-17 16:28:06,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:06,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4510 treesize of output 4471 [2023-11-17 16:28:07,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:07,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4471 treesize of output 4433 [2023-11-17 16:28:07,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:07,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4433 treesize of output 4414 [2023-11-17 16:28:07,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:07,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4414 treesize of output 4388 [2023-11-17 16:28:07,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:07,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4388 treesize of output 4336 [2023-11-17 16:28:07,397 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:07,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4336 treesize of output 4303 [2023-11-17 16:28:07,460 INFO L209 tifierPushTermWalker]: Run 30 iterations without descend maybe there is a nontermination bug. [2023-11-17 16:28:07,489 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:07,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4303 treesize of output 4237 [2023-11-17 16:28:07,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:07,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4237 treesize of output 4185 [2023-11-17 16:28:07,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:07,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4185 treesize of output 4159 [2023-11-17 16:28:07,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:07,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4159 treesize of output 4069 [2023-11-17 16:28:07,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:07,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4069 treesize of output 4024 [2023-11-17 16:28:08,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:08,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4024 treesize of output 4005 [2023-11-17 16:28:08,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:08,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4005 treesize of output 3967 [2023-11-17 16:28:08,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:08,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3967 treesize of output 3903 [2023-11-17 16:28:08,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:08,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3903 treesize of output 3871 [2023-11-17 16:28:08,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:08,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3871 treesize of output 3807 [2023-11-17 16:28:08,430 INFO L209 tifierPushTermWalker]: Run 40 iterations without descend maybe there is a nontermination bug. [2023-11-17 16:28:08,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:28:08,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3807 treesize of output 3775 [2023-11-17 16:28:13,694 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:28:13,695 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:28:13,708 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-11-17 16:28:13,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1498 treesize of output 1 [2023-11-17 16:28:13,997 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-17 16:28:13,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71710269] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:28:13,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:28:13,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 14] total 45 [2023-11-17 16:28:13,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579942033] [2023-11-17 16:28:13,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:28:13,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-11-17 16:28:13,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:28:13,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-11-17 16:28:13,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1948, Unknown=10, NotChecked=0, Total=2162 [2023-11-17 16:28:14,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 472 [2023-11-17 16:28:14,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 755 transitions, 18765 flow. Second operand has 47 states, 47 states have (on average 135.7659574468085) internal successors, (6381), 47 states have internal predecessors, (6381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:28:14,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:28:14,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 472 [2023-11-17 16:28:14,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand