/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-max-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 16:20:36,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 16:20:36,934 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2023-11-17 16:20:36,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 16:20:36,960 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 16:20:36,960 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 16:20:36,961 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 16:20:36,961 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 16:20:36,962 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 16:20:36,965 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 16:20:36,965 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 16:20:36,965 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 16:20:36,966 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 16:20:36,967 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 16:20:36,967 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 16:20:36,967 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 16:20:36,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 16:20:36,967 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 16:20:36,967 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 16:20:36,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 16:20:36,968 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 16:20:36,968 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 16:20:36,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 16:20:36,969 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 16:20:36,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 16:20:36,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:20:36,969 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 16:20:36,969 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 16:20:36,969 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 16:20:36,970 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 16:20:36,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 16:20:36,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 16:20:36,971 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-17 16:20:37,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 16:20:37,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 16:20:37,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 16:20:37,163 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 16:20:37,163 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 16:20:37,164 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2023-11-17 16:20:38,135 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 16:20:38,277 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 16:20:38,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2023-11-17 16:20:38,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbb0863de/c6f2533aa3a1471aa4a32b2e20722a86/FLAGd4dfef5d0 [2023-11-17 16:20:38,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbb0863de/c6f2533aa3a1471aa4a32b2e20722a86 [2023-11-17 16:20:38,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 16:20:38,300 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 16:20:38,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 16:20:38,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 16:20:38,305 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 16:20:38,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:20:38" (1/1) ... [2023-11-17 16:20:38,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59f1eb93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:20:38, skipping insertion in model container [2023-11-17 16:20:38,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 04:20:38" (1/1) ... [2023-11-17 16:20:38,326 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 16:20:38,463 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-max-array-hom.wvr.c[2625,2638] [2023-11-17 16:20:38,473 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:20:38,478 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 16:20:38,502 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-max-array-hom.wvr.c[2625,2638] [2023-11-17 16:20:38,504 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 16:20:38,508 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 16:20:38,509 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 16:20:38,514 INFO L206 MainTranslator]: Completed translation [2023-11-17 16:20:38,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:20:38 WrapperNode [2023-11-17 16:20:38,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 16:20:38,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 16:20:38,516 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 16:20:38,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 16:20:38,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:20:38" (1/1) ... [2023-11-17 16:20:38,525 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:20:38" (1/1) ... [2023-11-17 16:20:38,550 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2023-11-17 16:20:38,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 16:20:38,550 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 16:20:38,550 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 16:20:38,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 16:20:38,558 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:20:38" (1/1) ... [2023-11-17 16:20:38,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:20:38" (1/1) ... [2023-11-17 16:20:38,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:20:38" (1/1) ... [2023-11-17 16:20:38,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:20:38" (1/1) ... [2023-11-17 16:20:38,566 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:20:38" (1/1) ... [2023-11-17 16:20:38,568 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:20:38" (1/1) ... [2023-11-17 16:20:38,569 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:20:38" (1/1) ... [2023-11-17 16:20:38,570 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:20:38" (1/1) ... [2023-11-17 16:20:38,572 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 16:20:38,572 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 16:20:38,572 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 16:20:38,572 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 16:20:38,573 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:20:38" (1/1) ... [2023-11-17 16:20:38,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 16:20:38,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:20:38,610 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 16:20:38,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 16:20:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 16:20:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 16:20:38,633 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 16:20:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 16:20:38,633 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 16:20:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-17 16:20:38,633 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-17 16:20:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 16:20:38,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 16:20:38,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 16:20:38,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 16:20:38,634 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 16:20:38,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-17 16:20:38,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 16:20:38,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 16:20:38,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 16:20:38,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 16:20:38,635 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 16:20:38,703 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 16:20:38,704 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 16:20:38,925 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 16:20:38,992 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 16:20:38,992 INFO L307 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-17 16:20:38,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:20:38 BoogieIcfgContainer [2023-11-17 16:20:38,993 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 16:20:38,995 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 16:20:38,995 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 16:20:38,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 16:20:38,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 04:20:38" (1/3) ... [2023-11-17 16:20:38,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fea6016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:20:38, skipping insertion in model container [2023-11-17 16:20:38,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 04:20:38" (2/3) ... [2023-11-17 16:20:38,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fea6016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 04:20:38, skipping insertion in model container [2023-11-17 16:20:38,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 04:20:38" (3/3) ... [2023-11-17 16:20:38,999 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2023-11-17 16:20:39,010 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 16:20:39,010 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 16:20:39,011 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 16:20:39,079 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-17 16:20:39,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 160 transitions, 341 flow [2023-11-17 16:20:39,185 INFO L124 PetriNetUnfolderBase]: 12/157 cut-off events. [2023-11-17 16:20:39,186 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 16:20:39,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 157 events. 12/157 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2023-11-17 16:20:39,190 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 160 transitions, 341 flow [2023-11-17 16:20:39,196 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 146 transitions, 310 flow [2023-11-17 16:20:39,198 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 16:20:39,207 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 144 places, 146 transitions, 310 flow [2023-11-17 16:20:39,208 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 144 places, 146 transitions, 310 flow [2023-11-17 16:20:39,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 146 transitions, 310 flow [2023-11-17 16:20:39,227 INFO L124 PetriNetUnfolderBase]: 12/146 cut-off events. [2023-11-17 16:20:39,228 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 16:20:39,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 12/146 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2023-11-17 16:20:39,229 INFO L119 LiptonReduction]: Number of co-enabled transitions 1728 [2023-11-17 16:20:42,840 INFO L134 LiptonReduction]: Checked pairs total: 1838 [2023-11-17 16:20:42,840 INFO L136 LiptonReduction]: Total number of compositions: 146 [2023-11-17 16:20:42,851 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 16:20:42,854 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;@3ec74ce3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 16:20:42,855 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-17 16:20:42,859 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 16:20:42,859 INFO L124 PetriNetUnfolderBase]: 4/23 cut-off events. [2023-11-17 16:20:42,859 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-17 16:20:42,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:20:42,859 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:20:42,860 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:20:42,863 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:20:42,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1050706724, now seen corresponding path program 1 times [2023-11-17 16:20:42,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:20:42,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652064772] [2023-11-17 16:20:42,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:20:42,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:20:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:20:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:20:43,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:20:43,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652064772] [2023-11-17 16:20:43,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652064772] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:20:43,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:20:43,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 16:20:43,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988243632] [2023-11-17 16:20:43,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:20:43,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:20:43,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:20:43,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:20:43,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:20:43,193 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 306 [2023-11-17 16:20:43,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:43,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:20:43,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 306 [2023-11-17 16:20:43,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:20:43,344 INFO L124 PetriNetUnfolderBase]: 429/632 cut-off events. [2023-11-17 16:20:43,344 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2023-11-17 16:20:43,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1341 conditions, 632 events. 429/632 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1988 event pairs, 138 based on Foata normal form. 1/468 useless extension candidates. Maximal degree in co-relation 1030. Up to 389 conditions per place. [2023-11-17 16:20:43,351 INFO L140 encePairwiseOnDemand]: 301/306 looper letters, 38 selfloop transitions, 4 changer transitions 1/43 dead transitions. [2023-11-17 16:20:43,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 43 transitions, 205 flow [2023-11-17 16:20:43,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:20:43,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:20:43,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2023-11-17 16:20:43,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4989106753812636 [2023-11-17 16:20:43,368 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2023-11-17 16:20:43,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2023-11-17 16:20:43,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:20:43,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2023-11-17 16:20:43,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:43,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:43,382 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:43,384 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 66 flow. Second operand 3 states and 458 transitions. [2023-11-17 16:20:43,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 43 transitions, 205 flow [2023-11-17 16:20:43,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 43 transitions, 183 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-17 16:20:43,391 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 80 flow [2023-11-17 16:20:43,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2023-11-17 16:20:43,396 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2023-11-17 16:20:43,396 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 80 flow [2023-11-17 16:20:43,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:43,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:20:43,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:20:43,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 16:20:43,398 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:20:43,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:20:43,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1544751533, now seen corresponding path program 1 times [2023-11-17 16:20:43,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:20:43,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007619575] [2023-11-17 16:20:43,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:20:43,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:20:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:20:43,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:20:43,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:20:43,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007619575] [2023-11-17 16:20:43,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007619575] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:20:43,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:20:43,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 16:20:43,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338380792] [2023-11-17 16:20:43,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:20:43,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 16:20:43,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:20:43,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 16:20:43,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 16:20:43,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 306 [2023-11-17 16:20:43,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:43,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:20:43,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 306 [2023-11-17 16:20:43,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:20:43,585 INFO L124 PetriNetUnfolderBase]: 429/633 cut-off events. [2023-11-17 16:20:43,585 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2023-11-17 16:20:43,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1541 conditions, 633 events. 429/633 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1876 event pairs, 276 based on Foata normal form. 0/632 useless extension candidates. Maximal degree in co-relation 544. Up to 633 conditions per place. [2023-11-17 16:20:43,588 INFO L140 encePairwiseOnDemand]: 303/306 looper letters, 26 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2023-11-17 16:20:43,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 28 transitions, 138 flow [2023-11-17 16:20:43,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 16:20:43,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 16:20:43,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2023-11-17 16:20:43,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42374727668845313 [2023-11-17 16:20:43,591 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2023-11-17 16:20:43,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2023-11-17 16:20:43,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:20:43,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2023-11-17 16:20:43,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:43,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:43,594 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:43,594 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 80 flow. Second operand 3 states and 389 transitions. [2023-11-17 16:20:43,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 28 transitions, 138 flow [2023-11-17 16:20:43,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 28 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 16:20:43,596 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 88 flow [2023-11-17 16:20:43,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2023-11-17 16:20:43,597 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2023-11-17 16:20:43,597 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 28 transitions, 88 flow [2023-11-17 16:20:43,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:43,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:20:43,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:20:43,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 16:20:43,601 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:20:43,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:20:43,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1840561195, now seen corresponding path program 1 times [2023-11-17 16:20:43,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:20:43,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561477230] [2023-11-17 16:20:43,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:20:43,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:20:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:20:43,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-17 16:20:43,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:20:43,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561477230] [2023-11-17 16:20:43,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561477230] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 16:20:43,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 16:20:43,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 16:20:43,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334304996] [2023-11-17 16:20:43,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:20:43,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 16:20:43,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:20:43,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 16:20:43,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 16:20:43,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 306 [2023-11-17 16:20:43,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 28 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:43,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:20:43,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 306 [2023-11-17 16:20:43,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:20:43,754 INFO L124 PetriNetUnfolderBase]: 424/625 cut-off events. [2023-11-17 16:20:43,754 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2023-11-17 16:20:43,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1473 conditions, 625 events. 424/625 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1869 event pairs, 186 based on Foata normal form. 50/674 useless extension candidates. Maximal degree in co-relation 1460. Up to 459 conditions per place. [2023-11-17 16:20:43,757 INFO L140 encePairwiseOnDemand]: 302/306 looper letters, 38 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2023-11-17 16:20:43,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 42 transitions, 212 flow [2023-11-17 16:20:43,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 16:20:43,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 16:20:43,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2023-11-17 16:20:43,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44199346405228757 [2023-11-17 16:20:43,759 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2023-11-17 16:20:43,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2023-11-17 16:20:43,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:20:43,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2023-11-17 16:20:43,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:43,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 306.0) internal successors, (1530), 5 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:43,762 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 306.0) internal successors, (1530), 5 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:43,763 INFO L175 Difference]: Start difference. First operand has 29 places, 28 transitions, 88 flow. Second operand 4 states and 541 transitions. [2023-11-17 16:20:43,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 42 transitions, 212 flow [2023-11-17 16:20:43,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 42 transitions, 206 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-17 16:20:43,765 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 101 flow [2023-11-17 16:20:43,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2023-11-17 16:20:43,766 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 2 predicate places. [2023-11-17 16:20:43,766 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 101 flow [2023-11-17 16:20:43,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:43,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:20:43,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:20:43,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 16:20:43,767 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:20:43,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:20:43,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1129902591, now seen corresponding path program 1 times [2023-11-17 16:20:43,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:20:43,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263720731] [2023-11-17 16:20:43,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:20:43,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:20:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:20:43,888 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:20:43,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:20:43,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263720731] [2023-11-17 16:20:43,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263720731] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:20:43,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588554907] [2023-11-17 16:20:43,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:20:43,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:20:43,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:20:43,905 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 16:20:43,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-17 16:20:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:20:44,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 16:20:44,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:20:44,052 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:20:44,053 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:20:44,082 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:20:44,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588554907] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-17 16:20:44,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-17 16:20:44,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-11-17 16:20:44,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963722557] [2023-11-17 16:20:44,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 16:20:44,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 16:20:44,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:20:44,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 16:20:44,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-17 16:20:44,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 306 [2023-11-17 16:20:44,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:44,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:20:44,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 306 [2023-11-17 16:20:44,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:20:44,168 INFO L124 PetriNetUnfolderBase]: 410/599 cut-off events. [2023-11-17 16:20:44,168 INFO L125 PetriNetUnfolderBase]: For 298/298 co-relation queries the response was YES. [2023-11-17 16:20:44,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1622 conditions, 599 events. 410/599 cut-off events. For 298/298 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1806 event pairs, 183 based on Foata normal form. 44/643 useless extension candidates. Maximal degree in co-relation 1603. Up to 452 conditions per place. [2023-11-17 16:20:44,171 INFO L140 encePairwiseOnDemand]: 301/306 looper letters, 39 selfloop transitions, 5 changer transitions 0/44 dead transitions. [2023-11-17 16:20:44,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 44 transitions, 246 flow [2023-11-17 16:20:44,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 16:20:44,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 16:20:44,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 623 transitions. [2023-11-17 16:20:44,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4071895424836601 [2023-11-17 16:20:44,173 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 623 transitions. [2023-11-17 16:20:44,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 623 transitions. [2023-11-17 16:20:44,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:20:44,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 623 transitions. [2023-11-17 16:20:44,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 124.6) internal successors, (623), 5 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:44,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 306.0) internal successors, (1836), 6 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:44,177 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 306.0) internal successors, (1836), 6 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:44,177 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 101 flow. Second operand 5 states and 623 transitions. [2023-11-17 16:20:44,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 44 transitions, 246 flow [2023-11-17 16:20:44,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 44 transitions, 230 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-17 16:20:44,179 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 113 flow [2023-11-17 16:20:44,179 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2023-11-17 16:20:44,179 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2023-11-17 16:20:44,179 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 113 flow [2023-11-17 16:20:44,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:44,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:20:44,180 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:20:44,188 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:20:44,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:20:44,389 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:20:44,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:20:44,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1940075138, now seen corresponding path program 1 times [2023-11-17 16:20:44,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:20:44,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430644601] [2023-11-17 16:20:44,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:20:44,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:20:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:20:45,224 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:20:45,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:20:45,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430644601] [2023-11-17 16:20:45,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430644601] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:20:45,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139029031] [2023-11-17 16:20:45,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:20:45,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:20:45,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:20:45,241 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:20:45,293 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:20:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:20:45,364 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-17 16:20:45,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:20:45,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:20:45,392 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 26 treesize of output 24 [2023-11-17 16:20:45,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:20:45,642 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 36 treesize of output 27 [2023-11-17 16:20:45,726 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 36 treesize of output 27 [2023-11-17 16:20:45,844 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 61 treesize of output 37 [2023-11-17 16:20:45,920 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:20:45,920 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:20:46,487 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~max2~0 1)) (.cse4 (+ c_~max3~0 1)) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse1 (= c_~max1~0 c_~max2~0))) (and (or (and (= c_~max1~0 c_~max3~0) (<= .cse0 c_~max3~0)) (and .cse1 (<= c_~max3~0 c_~max2~0)) (forall ((v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (< c_~max3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) .cse2)))) (forall ((v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) .cse2))) (or (< .cse3 .cse4) (< .cse3 .cse0) (= c_~max1~0 .cse3)))) (or (and (forall ((v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse5 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) .cse2))) (or (< c_~max2~0 .cse5) (< .cse5 .cse4)))) (forall ((v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse6 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) .cse2))) (or (< .cse6 .cse4) (= c_~max1~0 .cse6))))) .cse1))) is different from false [2023-11-17 16:20:46,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:20:46,525 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 1048 treesize of output 928 [2023-11-17 16:20:46,550 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 514 treesize of output 502 [2023-11-17 16:20:46,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 502 treesize of output 490 [2023-11-17 16:20:46,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 490 treesize of output 466 [2023-11-17 16:20:46,588 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 466 treesize of output 442 [2023-11-17 16:20:46,599 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 442 treesize of output 436 [2023-11-17 16:20:46,612 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 436 treesize of output 424 [2023-11-17 16:20:46,623 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 424 treesize of output 388 [2023-11-17 16:20:46,654 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 388 treesize of output 370 [2023-11-17 16:20:46,661 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-11-17 16:20:47,174 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:20:47,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139029031] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:20:47,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:20:47,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2023-11-17 16:20:47,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534085717] [2023-11-17 16:20:47,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:20:47,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-17 16:20:47,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:20:47,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-17 16:20:47,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=479, Unknown=10, NotChecked=46, Total=650 [2023-11-17 16:20:47,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 306 [2023-11-17 16:20:47,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 113 flow. Second operand has 26 states, 26 states have (on average 87.46153846153847) internal successors, (2274), 26 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:47,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:20:47,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 306 [2023-11-17 16:20:47,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:20:47,859 INFO L124 PetriNetUnfolderBase]: 747/1095 cut-off events. [2023-11-17 16:20:47,859 INFO L125 PetriNetUnfolderBase]: For 563/563 co-relation queries the response was YES. [2023-11-17 16:20:47,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3135 conditions, 1095 events. 747/1095 cut-off events. For 563/563 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3997 event pairs, 58 based on Foata normal form. 1/1094 useless extension candidates. Maximal degree in co-relation 2725. Up to 647 conditions per place. [2023-11-17 16:20:47,865 INFO L140 encePairwiseOnDemand]: 297/306 looper letters, 80 selfloop transitions, 23 changer transitions 1/104 dead transitions. [2023-11-17 16:20:47,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 104 transitions, 550 flow [2023-11-17 16:20:47,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 16:20:47,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 16:20:47,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 953 transitions. [2023-11-17 16:20:47,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31143790849673203 [2023-11-17 16:20:47,868 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 953 transitions. [2023-11-17 16:20:47,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 953 transitions. [2023-11-17 16:20:47,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:20:47,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 953 transitions. [2023-11-17 16:20:47,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 95.3) internal successors, (953), 10 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:47,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 306.0) internal successors, (3366), 11 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:47,873 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 306.0) internal successors, (3366), 11 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:47,873 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 113 flow. Second operand 10 states and 953 transitions. [2023-11-17 16:20:47,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 104 transitions, 550 flow [2023-11-17 16:20:47,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 104 transitions, 534 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-17 16:20:47,876 INFO L231 Difference]: Finished difference. Result has 45 places, 48 transitions, 262 flow [2023-11-17 16:20:47,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=262, PETRI_PLACES=45, PETRI_TRANSITIONS=48} [2023-11-17 16:20:47,876 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 15 predicate places. [2023-11-17 16:20:47,876 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 48 transitions, 262 flow [2023-11-17 16:20:47,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 87.46153846153847) internal successors, (2274), 26 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:47,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:20:47,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:20:47,887 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:20:48,087 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:20:48,087 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:20:48,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:20:48,088 INFO L85 PathProgramCache]: Analyzing trace with hash -793137588, now seen corresponding path program 2 times [2023-11-17 16:20:48,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:20:48,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084840002] [2023-11-17 16:20:48,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:20:48,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:20:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:20:48,539 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:20:48,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:20:48,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084840002] [2023-11-17 16:20:48,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084840002] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:20:48,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674030486] [2023-11-17 16:20:48,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:20:48,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:20:48,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:20:48,554 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:20:48,597 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:20:48,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:20:48,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:20:48,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-17 16:20:48,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:20:48,936 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 55 treesize of output 31 [2023-11-17 16:20:48,972 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:20:48,972 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:20:49,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:20:49,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 75 [2023-11-17 16:20:49,591 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:20:49,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674030486] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:20:49,592 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:20:49,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2023-11-17 16:20:49,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897832535] [2023-11-17 16:20:49,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:20:49,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-17 16:20:49,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:20:49,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-17 16:20:49,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2023-11-17 16:20:49,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 306 [2023-11-17 16:20:49,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 48 transitions, 262 flow. Second operand has 22 states, 22 states have (on average 96.0909090909091) internal successors, (2114), 22 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:49,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:20:49,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 306 [2023-11-17 16:20:49,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:20:50,131 INFO L124 PetriNetUnfolderBase]: 1081/1558 cut-off events. [2023-11-17 16:20:50,131 INFO L125 PetriNetUnfolderBase]: For 1575/1575 co-relation queries the response was YES. [2023-11-17 16:20:50,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5204 conditions, 1558 events. 1081/1558 cut-off events. For 1575/1575 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 5748 event pairs, 148 based on Foata normal form. 1/1558 useless extension candidates. Maximal degree in co-relation 4690. Up to 1060 conditions per place. [2023-11-17 16:20:50,139 INFO L140 encePairwiseOnDemand]: 296/306 looper letters, 84 selfloop transitions, 37 changer transitions 1/122 dead transitions. [2023-11-17 16:20:50,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 122 transitions, 791 flow [2023-11-17 16:20:50,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-17 16:20:50,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-17 16:20:50,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1126 transitions. [2023-11-17 16:20:50,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3345216874628639 [2023-11-17 16:20:50,142 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1126 transitions. [2023-11-17 16:20:50,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1126 transitions. [2023-11-17 16:20:50,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:20:50,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1126 transitions. [2023-11-17 16:20:50,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 102.36363636363636) internal successors, (1126), 11 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:50,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 306.0) internal successors, (3672), 12 states have internal predecessors, (3672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:50,148 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 306.0) internal successors, (3672), 12 states have internal predecessors, (3672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:50,148 INFO L175 Difference]: Start difference. First operand has 45 places, 48 transitions, 262 flow. Second operand 11 states and 1126 transitions. [2023-11-17 16:20:50,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 122 transitions, 791 flow [2023-11-17 16:20:50,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 122 transitions, 744 flow, removed 15 selfloop flow, removed 2 redundant places. [2023-11-17 16:20:50,153 INFO L231 Difference]: Finished difference. Result has 59 places, 73 transitions, 516 flow [2023-11-17 16:20:50,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=516, PETRI_PLACES=59, PETRI_TRANSITIONS=73} [2023-11-17 16:20:50,153 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 29 predicate places. [2023-11-17 16:20:50,154 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 73 transitions, 516 flow [2023-11-17 16:20:50,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 96.0909090909091) internal successors, (2114), 22 states have internal predecessors, (2114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:50,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:20:50,154 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:20:50,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-17 16:20:50,360 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:20:50,360 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:20:50,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:20:50,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1203063366, now seen corresponding path program 3 times [2023-11-17 16:20:50,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:20:50,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399064544] [2023-11-17 16:20:50,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:20:50,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:20:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:20:50,733 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:20:50,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:20:50,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399064544] [2023-11-17 16:20:50,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399064544] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:20:50,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424996730] [2023-11-17 16:20:50,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:20:50,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:20:50,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:20:50,750 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:20:50,776 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:20:50,824 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 16:20:50,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:20:50,825 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-17 16:20:50,826 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:20:51,060 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 51 treesize of output 31 [2023-11-17 16:20:51,105 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:20:51,106 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:20:51,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:20:51,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 75 [2023-11-17 16:20:51,577 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:20:51,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424996730] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:20:51,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:20:51,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2023-11-17 16:20:51,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020254280] [2023-11-17 16:20:51,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:20:51,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-17 16:20:51,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:20:51,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-17 16:20:51,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2023-11-17 16:20:51,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 306 [2023-11-17 16:20:51,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 73 transitions, 516 flow. Second operand has 22 states, 22 states have (on average 91.72727272727273) internal successors, (2018), 22 states have internal predecessors, (2018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:51,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:20:51,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 306 [2023-11-17 16:20:51,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:20:52,205 INFO L124 PetriNetUnfolderBase]: 1255/1813 cut-off events. [2023-11-17 16:20:52,205 INFO L125 PetriNetUnfolderBase]: For 3331/3331 co-relation queries the response was YES. [2023-11-17 16:20:52,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7235 conditions, 1813 events. 1255/1813 cut-off events. For 3331/3331 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7008 event pairs, 128 based on Foata normal form. 1/1813 useless extension candidates. Maximal degree in co-relation 5605. Up to 1453 conditions per place. [2023-11-17 16:20:52,215 INFO L140 encePairwiseOnDemand]: 295/306 looper letters, 113 selfloop transitions, 65 changer transitions 1/179 dead transitions. [2023-11-17 16:20:52,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 179 transitions, 1385 flow [2023-11-17 16:20:52,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-17 16:20:52,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-17 16:20:52,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1921 transitions. [2023-11-17 16:20:52,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3138888888888889 [2023-11-17 16:20:52,220 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1921 transitions. [2023-11-17 16:20:52,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1921 transitions. [2023-11-17 16:20:52,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:20:52,221 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1921 transitions. [2023-11-17 16:20:52,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 96.05) internal successors, (1921), 20 states have internal predecessors, (1921), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:52,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 306.0) internal successors, (6426), 21 states have internal predecessors, (6426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:52,231 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 306.0) internal successors, (6426), 21 states have internal predecessors, (6426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:52,231 INFO L175 Difference]: Start difference. First operand has 59 places, 73 transitions, 516 flow. Second operand 20 states and 1921 transitions. [2023-11-17 16:20:52,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 179 transitions, 1385 flow [2023-11-17 16:20:52,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 179 transitions, 1318 flow, removed 31 selfloop flow, removed 2 redundant places. [2023-11-17 16:20:52,285 INFO L231 Difference]: Finished difference. Result has 86 places, 116 transitions, 1007 flow [2023-11-17 16:20:52,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1007, PETRI_PLACES=86, PETRI_TRANSITIONS=116} [2023-11-17 16:20:52,285 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 56 predicate places. [2023-11-17 16:20:52,285 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 116 transitions, 1007 flow [2023-11-17 16:20:52,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 91.72727272727273) internal successors, (2018), 22 states have internal predecessors, (2018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:52,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:20:52,286 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:20:52,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-17 16:20:52,491 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:20:52,492 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:20:52,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:20:52,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1100756512, now seen corresponding path program 4 times [2023-11-17 16:20:52,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:20:52,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523822153] [2023-11-17 16:20:52,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:20:52,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:20:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:20:52,940 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:20:52,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:20:52,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523822153] [2023-11-17 16:20:52,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523822153] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:20:52,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869165409] [2023-11-17 16:20:52,941 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 16:20:52,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:20:52,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:20:52,942 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:20:52,957 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:20:53,027 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 16:20:53,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:20:53,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-17 16:20:53,029 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:20:53,248 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 55 treesize of output 31 [2023-11-17 16:20:53,305 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:20:53,305 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:20:53,459 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:20:53,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 75 [2023-11-17 16:20:53,748 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:20:53,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869165409] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:20:53,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:20:53,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 22 [2023-11-17 16:20:53,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033120483] [2023-11-17 16:20:53,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:20:53,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-17 16:20:53,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:20:53,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-17 16:20:53,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2023-11-17 16:20:53,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 306 [2023-11-17 16:20:53,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 116 transitions, 1007 flow. Second operand has 24 states, 24 states have (on average 91.875) internal successors, (2205), 24 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:53,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:20:53,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 306 [2023-11-17 16:20:53,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:20:54,417 INFO L124 PetriNetUnfolderBase]: 1364/1979 cut-off events. [2023-11-17 16:20:54,418 INFO L125 PetriNetUnfolderBase]: For 6686/6686 co-relation queries the response was YES. [2023-11-17 16:20:54,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9461 conditions, 1979 events. 1364/1979 cut-off events. For 6686/6686 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7843 event pairs, 160 based on Foata normal form. 1/1980 useless extension candidates. Maximal degree in co-relation 8367. Up to 1581 conditions per place. [2023-11-17 16:20:54,428 INFO L140 encePairwiseOnDemand]: 295/306 looper letters, 117 selfloop transitions, 89 changer transitions 1/207 dead transitions. [2023-11-17 16:20:54,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 207 transitions, 1985 flow [2023-11-17 16:20:54,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-17 16:20:54,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-17 16:20:54,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1733 transitions. [2023-11-17 16:20:54,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31463326071169206 [2023-11-17 16:20:54,432 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1733 transitions. [2023-11-17 16:20:54,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1733 transitions. [2023-11-17 16:20:54,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:20:54,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1733 transitions. [2023-11-17 16:20:54,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 96.27777777777777) internal successors, (1733), 18 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:54,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 306.0) internal successors, (5814), 19 states have internal predecessors, (5814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:54,440 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 306.0) internal successors, (5814), 19 states have internal predecessors, (5814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:54,440 INFO L175 Difference]: Start difference. First operand has 86 places, 116 transitions, 1007 flow. Second operand 18 states and 1733 transitions. [2023-11-17 16:20:54,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 207 transitions, 1985 flow [2023-11-17 16:20:54,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 207 transitions, 1864 flow, removed 26 selfloop flow, removed 5 redundant places. [2023-11-17 16:20:54,454 INFO L231 Difference]: Finished difference. Result has 104 places, 152 transitions, 1511 flow [2023-11-17 16:20:54,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=914, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1511, PETRI_PLACES=104, PETRI_TRANSITIONS=152} [2023-11-17 16:20:54,457 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 74 predicate places. [2023-11-17 16:20:54,457 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 152 transitions, 1511 flow [2023-11-17 16:20:54,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 91.875) internal successors, (2205), 24 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:54,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:20:54,458 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:20:54,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-17 16:20:54,662 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:20:54,663 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:20:54,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:20:54,664 INFO L85 PathProgramCache]: Analyzing trace with hash -55115384, now seen corresponding path program 5 times [2023-11-17 16:20:54,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:20:54,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54466604] [2023-11-17 16:20:54,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:20:54,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:20:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:20:54,977 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:20:54,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:20:54,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54466604] [2023-11-17 16:20:54,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54466604] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:20:54,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013674235] [2023-11-17 16:20:54,978 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 16:20:54,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:20:54,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:20:54,979 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:20:55,005 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:20:55,054 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:20:55,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:20:55,055 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-17 16:20:55,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:20:55,259 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 54 treesize of output 30 [2023-11-17 16:20:55,318 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:20:55,318 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:20:55,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:20:55,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 75 [2023-11-17 16:20:55,829 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:20:55,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013674235] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:20:55,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:20:55,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2023-11-17 16:20:55,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775923290] [2023-11-17 16:20:55,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:20:55,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-17 16:20:55,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:20:55,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-17 16:20:55,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2023-11-17 16:20:55,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 306 [2023-11-17 16:20:55,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 152 transitions, 1511 flow. Second operand has 19 states, 19 states have (on average 96.05263157894737) internal successors, (1825), 19 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:55,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:20:55,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 306 [2023-11-17 16:20:55,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:20:56,562 INFO L124 PetriNetUnfolderBase]: 1707/2483 cut-off events. [2023-11-17 16:20:56,563 INFO L125 PetriNetUnfolderBase]: For 11960/11960 co-relation queries the response was YES. [2023-11-17 16:20:56,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12858 conditions, 2483 events. 1707/2483 cut-off events. For 11960/11960 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10257 event pairs, 278 based on Foata normal form. 2/2485 useless extension candidates. Maximal degree in co-relation 11646. Up to 1737 conditions per place. [2023-11-17 16:20:56,578 INFO L140 encePairwiseOnDemand]: 296/306 looper letters, 139 selfloop transitions, 104 changer transitions 2/245 dead transitions. [2023-11-17 16:20:56,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 245 transitions, 2622 flow [2023-11-17 16:20:56,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-17 16:20:56,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-17 16:20:56,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1527 transitions. [2023-11-17 16:20:56,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3326797385620915 [2023-11-17 16:20:56,582 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1527 transitions. [2023-11-17 16:20:56,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1527 transitions. [2023-11-17 16:20:56,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:20:56,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1527 transitions. [2023-11-17 16:20:56,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 101.8) internal successors, (1527), 15 states have internal predecessors, (1527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:56,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 306.0) internal successors, (4896), 16 states have internal predecessors, (4896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:56,589 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 306.0) internal successors, (4896), 16 states have internal predecessors, (4896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:56,590 INFO L175 Difference]: Start difference. First operand has 104 places, 152 transitions, 1511 flow. Second operand 15 states and 1527 transitions. [2023-11-17 16:20:56,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 245 transitions, 2622 flow [2023-11-17 16:20:56,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 245 transitions, 2447 flow, removed 84 selfloop flow, removed 3 redundant places. [2023-11-17 16:20:56,620 INFO L231 Difference]: Finished difference. Result has 119 places, 183 transitions, 1938 flow [2023-11-17 16:20:56,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=1400, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1938, PETRI_PLACES=119, PETRI_TRANSITIONS=183} [2023-11-17 16:20:56,620 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 89 predicate places. [2023-11-17 16:20:56,620 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 183 transitions, 1938 flow [2023-11-17 16:20:56,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 96.05263157894737) internal successors, (1825), 19 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:56,621 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:20:56,621 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:20:56,637 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:20:56,826 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:20:56,827 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:20:56,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:20:56,827 INFO L85 PathProgramCache]: Analyzing trace with hash 96334108, now seen corresponding path program 6 times [2023-11-17 16:20:56,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:20:56,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125777418] [2023-11-17 16:20:56,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:20:56,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:20:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:20:57,163 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:20:57,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:20:57,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125777418] [2023-11-17 16:20:57,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125777418] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:20:57,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980373493] [2023-11-17 16:20:57,163 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 16:20:57,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:20:57,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:20:57,164 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:20:57,166 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:20:57,260 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-17 16:20:57,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:20:57,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-17 16:20:57,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:20:57,454 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 55 treesize of output 31 [2023-11-17 16:20:57,523 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:20:57,523 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:20:57,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:20:57,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 75 [2023-11-17 16:20:57,961 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:20:57,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980373493] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:20:57,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:20:57,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 20 [2023-11-17 16:20:57,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122633575] [2023-11-17 16:20:57,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:20:57,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-17 16:20:57,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:20:57,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-17 16:20:57,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2023-11-17 16:20:57,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 306 [2023-11-17 16:20:57,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 183 transitions, 1938 flow. Second operand has 22 states, 22 states have (on average 91.72727272727273) internal successors, (2018), 22 states have internal predecessors, (2018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:57,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:20:57,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 306 [2023-11-17 16:20:57,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:20:58,585 INFO L124 PetriNetUnfolderBase]: 1764/2579 cut-off events. [2023-11-17 16:20:58,586 INFO L125 PetriNetUnfolderBase]: For 11838/11838 co-relation queries the response was YES. [2023-11-17 16:20:58,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13488 conditions, 2579 events. 1764/2579 cut-off events. For 11838/11838 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 10904 event pairs, 299 based on Foata normal form. 1/2568 useless extension candidates. Maximal degree in co-relation 12911. Up to 2190 conditions per place. [2023-11-17 16:20:58,605 INFO L140 encePairwiseOnDemand]: 295/306 looper letters, 138 selfloop transitions, 106 changer transitions 1/245 dead transitions. [2023-11-17 16:20:58,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 245 transitions, 2820 flow [2023-11-17 16:20:58,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-17 16:20:58,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-17 16:20:58,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1721 transitions. [2023-11-17 16:20:58,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3124546114742193 [2023-11-17 16:20:58,609 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1721 transitions. [2023-11-17 16:20:58,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1721 transitions. [2023-11-17 16:20:58,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:20:58,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1721 transitions. [2023-11-17 16:20:58,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 95.61111111111111) internal successors, (1721), 18 states have internal predecessors, (1721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:58,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 306.0) internal successors, (5814), 19 states have internal predecessors, (5814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:58,617 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 306.0) internal successors, (5814), 19 states have internal predecessors, (5814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:58,617 INFO L175 Difference]: Start difference. First operand has 119 places, 183 transitions, 1938 flow. Second operand 18 states and 1721 transitions. [2023-11-17 16:20:58,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 245 transitions, 2820 flow [2023-11-17 16:20:58,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 245 transitions, 2603 flow, removed 60 selfloop flow, removed 7 redundant places. [2023-11-17 16:20:58,650 INFO L231 Difference]: Finished difference. Result has 133 places, 202 transitions, 2223 flow [2023-11-17 16:20:58,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=1739, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2223, PETRI_PLACES=133, PETRI_TRANSITIONS=202} [2023-11-17 16:20:58,650 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 103 predicate places. [2023-11-17 16:20:58,651 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 202 transitions, 2223 flow [2023-11-17 16:20:58,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 91.72727272727273) internal successors, (2018), 22 states have internal predecessors, (2018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:58,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:20:58,651 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:20:58,671 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:20:58,856 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:20:58,857 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:20:58,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:20:58,857 INFO L85 PathProgramCache]: Analyzing trace with hash 84373212, now seen corresponding path program 7 times [2023-11-17 16:20:58,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:20:58,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58573368] [2023-11-17 16:20:58,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:20:58,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:20:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:20:58,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:20:58,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:20:58,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58573368] [2023-11-17 16:20:58,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58573368] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:20:58,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501729880] [2023-11-17 16:20:58,950 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 16:20:58,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:20:58,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:20:58,951 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:20:58,968 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:20:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:20:59,026 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:20:59,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:20:59,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:20:59,088 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:20:59,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:20:59,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501729880] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:20:59,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:20:59,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-11-17 16:20:59,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128634639] [2023-11-17 16:20:59,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:20:59,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-17 16:20:59,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:20:59,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-17 16:20:59,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-11-17 16:20:59,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 306 [2023-11-17 16:20:59,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 202 transitions, 2223 flow. Second operand has 14 states, 14 states have (on average 120.35714285714286) internal successors, (1685), 14 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:59,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:20:59,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 306 [2023-11-17 16:20:59,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:20:59,611 INFO L124 PetriNetUnfolderBase]: 2151/3142 cut-off events. [2023-11-17 16:20:59,611 INFO L125 PetriNetUnfolderBase]: For 17538/17538 co-relation queries the response was YES. [2023-11-17 16:20:59,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16844 conditions, 3142 events. 2151/3142 cut-off events. For 17538/17538 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 13840 event pairs, 681 based on Foata normal form. 46/3176 useless extension candidates. Maximal degree in co-relation 16025. Up to 2303 conditions per place. [2023-11-17 16:20:59,627 INFO L140 encePairwiseOnDemand]: 300/306 looper letters, 230 selfloop transitions, 27 changer transitions 0/257 dead transitions. [2023-11-17 16:20:59,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 257 transitions, 3178 flow [2023-11-17 16:20:59,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 16:20:59,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 16:20:59,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1009 transitions. [2023-11-17 16:20:59,650 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41217320261437906 [2023-11-17 16:20:59,650 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1009 transitions. [2023-11-17 16:20:59,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1009 transitions. [2023-11-17 16:20:59,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:20:59,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1009 transitions. [2023-11-17 16:20:59,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.125) internal successors, (1009), 8 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:59,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 306.0) internal successors, (2754), 9 states have internal predecessors, (2754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:59,653 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 306.0) internal successors, (2754), 9 states have internal predecessors, (2754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:59,653 INFO L175 Difference]: Start difference. First operand has 133 places, 202 transitions, 2223 flow. Second operand 8 states and 1009 transitions. [2023-11-17 16:20:59,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 257 transitions, 3178 flow [2023-11-17 16:20:59,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 257 transitions, 3028 flow, removed 35 selfloop flow, removed 9 redundant places. [2023-11-17 16:20:59,684 INFO L231 Difference]: Finished difference. Result has 134 places, 208 transitions, 2268 flow [2023-11-17 16:20:59,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=2090, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2268, PETRI_PLACES=134, PETRI_TRANSITIONS=208} [2023-11-17 16:20:59,685 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 104 predicate places. [2023-11-17 16:20:59,685 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 208 transitions, 2268 flow [2023-11-17 16:20:59,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 120.35714285714286) internal successors, (1685), 14 states have internal predecessors, (1685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:20:59,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:20:59,685 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:20:59,693 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:20:59,891 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:20:59,891 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:20:59,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:20:59,891 INFO L85 PathProgramCache]: Analyzing trace with hash -662643711, now seen corresponding path program 8 times [2023-11-17 16:20:59,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:20:59,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265063845] [2023-11-17 16:20:59,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:20:59,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:20:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:20:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:20:59,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:20:59,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265063845] [2023-11-17 16:20:59,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265063845] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:20:59,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481051916] [2023-11-17 16:20:59,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:20:59,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:20:59,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:20:59,994 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:21:00,019 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:21:00,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:21:00,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:21:00,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:21:00,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:00,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:21:00,145 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:21:00,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481051916] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:00,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:00,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 19 [2023-11-17 16:21:00,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049545507] [2023-11-17 16:21:00,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:00,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-17 16:21:00,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:00,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-17 16:21:00,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2023-11-17 16:21:00,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 306 [2023-11-17 16:21:00,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 208 transitions, 2268 flow. Second operand has 19 states, 19 states have (on average 107.63157894736842) internal successors, (2045), 19 states have internal predecessors, (2045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:00,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:00,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 306 [2023-11-17 16:21:00,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:01,068 INFO L124 PetriNetUnfolderBase]: 2267/3408 cut-off events. [2023-11-17 16:21:01,068 INFO L125 PetriNetUnfolderBase]: For 23839/23839 co-relation queries the response was YES. [2023-11-17 16:21:01,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18656 conditions, 3408 events. 2267/3408 cut-off events. For 23839/23839 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 16330 event pairs, 372 based on Foata normal form. 160/3556 useless extension candidates. Maximal degree in co-relation 18097. Up to 881 conditions per place. [2023-11-17 16:21:01,090 INFO L140 encePairwiseOnDemand]: 294/306 looper letters, 337 selfloop transitions, 103 changer transitions 0/440 dead transitions. [2023-11-17 16:21:01,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 440 transitions, 4929 flow [2023-11-17 16:21:01,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-17 16:21:01,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-17 16:21:01,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2279 transitions. [2023-11-17 16:21:01,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3723856209150327 [2023-11-17 16:21:01,093 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2279 transitions. [2023-11-17 16:21:01,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2279 transitions. [2023-11-17 16:21:01,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:01,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2279 transitions. [2023-11-17 16:21:01,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 113.95) internal successors, (2279), 20 states have internal predecessors, (2279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:01,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 306.0) internal successors, (6426), 21 states have internal predecessors, (6426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:01,101 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 306.0) internal successors, (6426), 21 states have internal predecessors, (6426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:01,101 INFO L175 Difference]: Start difference. First operand has 134 places, 208 transitions, 2268 flow. Second operand 20 states and 2279 transitions. [2023-11-17 16:21:01,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 440 transitions, 4929 flow [2023-11-17 16:21:01,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 440 transitions, 4871 flow, removed 17 selfloop flow, removed 5 redundant places. [2023-11-17 16:21:01,147 INFO L231 Difference]: Finished difference. Result has 160 places, 233 transitions, 2783 flow [2023-11-17 16:21:01,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=2088, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2783, PETRI_PLACES=160, PETRI_TRANSITIONS=233} [2023-11-17 16:21:01,147 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 130 predicate places. [2023-11-17 16:21:01,148 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 233 transitions, 2783 flow [2023-11-17 16:21:01,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 107.63157894736842) internal successors, (2045), 19 states have internal predecessors, (2045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:01,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:01,148 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:01,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-17 16:21:01,353 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:21:01,354 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:21:01,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:01,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1819765111, now seen corresponding path program 9 times [2023-11-17 16:21:01,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:01,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736583649] [2023-11-17 16:21:01,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:01,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:01,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:01,432 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:21:01,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:01,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736583649] [2023-11-17 16:21:01,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736583649] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:01,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059343143] [2023-11-17 16:21:01,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:21:01,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:01,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:01,450 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:21:01,511 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:21:01,573 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-17 16:21:01,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:21:01,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-17 16:21:01,577 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:01,651 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:21:01,652 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:01,694 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:21:01,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059343143] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:01,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:01,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-11-17 16:21:01,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832054934] [2023-11-17 16:21:01,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:01,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-17 16:21:01,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:01,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-17 16:21:01,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-11-17 16:21:01,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 306 [2023-11-17 16:21:01,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 233 transitions, 2783 flow. Second operand has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:01,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:01,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 306 [2023-11-17 16:21:01,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:02,140 INFO L124 PetriNetUnfolderBase]: 1815/2818 cut-off events. [2023-11-17 16:21:02,140 INFO L125 PetriNetUnfolderBase]: For 30571/30571 co-relation queries the response was YES. [2023-11-17 16:21:02,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18045 conditions, 2818 events. 1815/2818 cut-off events. For 30571/30571 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 13434 event pairs, 652 based on Foata normal form. 166/2984 useless extension candidates. Maximal degree in co-relation 17655. Up to 1317 conditions per place. [2023-11-17 16:21:02,155 INFO L140 encePairwiseOnDemand]: 300/306 looper letters, 217 selfloop transitions, 29 changer transitions 22/268 dead transitions. [2023-11-17 16:21:02,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 268 transitions, 3584 flow [2023-11-17 16:21:02,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 16:21:02,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 16:21:02,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 862 transitions. [2023-11-17 16:21:02,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4024276377217554 [2023-11-17 16:21:02,156 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 862 transitions. [2023-11-17 16:21:02,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 862 transitions. [2023-11-17 16:21:02,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:02,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 862 transitions. [2023-11-17 16:21:02,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.14285714285714) internal successors, (862), 7 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:02,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 306.0) internal successors, (2448), 8 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:02,159 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 306.0) internal successors, (2448), 8 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:02,159 INFO L175 Difference]: Start difference. First operand has 160 places, 233 transitions, 2783 flow. Second operand 7 states and 862 transitions. [2023-11-17 16:21:02,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 268 transitions, 3584 flow [2023-11-17 16:21:02,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 268 transitions, 3290 flow, removed 97 selfloop flow, removed 6 redundant places. [2023-11-17 16:21:02,235 INFO L231 Difference]: Finished difference. Result has 161 places, 194 transitions, 2300 flow [2023-11-17 16:21:02,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=2370, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2300, PETRI_PLACES=161, PETRI_TRANSITIONS=194} [2023-11-17 16:21:02,236 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 131 predicate places. [2023-11-17 16:21:02,236 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 194 transitions, 2300 flow [2023-11-17 16:21:02,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:02,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:02,236 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:21:02,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-17 16:21:02,441 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:21:02,442 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:21:02,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:02,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1824779219, now seen corresponding path program 1 times [2023-11-17 16:21:02,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:02,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779894747] [2023-11-17 16:21:02,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:02,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:02,505 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:21:02,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:02,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779894747] [2023-11-17 16:21:02,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779894747] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:02,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622633260] [2023-11-17 16:21:02,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:02,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:02,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:02,529 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:21:02,542 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:21:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:02,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:21:02,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:02,665 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:21:02,665 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:02,701 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:21:02,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622633260] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:02,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:02,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-11-17 16:21:02,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984569133] [2023-11-17 16:21:02,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:02,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-17 16:21:02,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:02,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-17 16:21:02,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-11-17 16:21:02,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 306 [2023-11-17 16:21:02,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 194 transitions, 2300 flow. Second operand has 13 states, 13 states have (on average 115.3076923076923) internal successors, (1499), 13 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:02,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:02,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 306 [2023-11-17 16:21:02,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:03,018 INFO L124 PetriNetUnfolderBase]: 1398/2246 cut-off events. [2023-11-17 16:21:03,018 INFO L125 PetriNetUnfolderBase]: For 22963/22963 co-relation queries the response was YES. [2023-11-17 16:21:03,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14049 conditions, 2246 events. 1398/2246 cut-off events. For 22963/22963 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10925 event pairs, 651 based on Foata normal form. 138/2384 useless extension candidates. Maximal degree in co-relation 13698. Up to 1317 conditions per place. [2023-11-17 16:21:03,032 INFO L140 encePairwiseOnDemand]: 300/306 looper letters, 91 selfloop transitions, 3 changer transitions 92/186 dead transitions. [2023-11-17 16:21:03,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 186 transitions, 2508 flow [2023-11-17 16:21:03,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 16:21:03,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 16:21:03,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 730 transitions. [2023-11-17 16:21:03,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39760348583877997 [2023-11-17 16:21:03,033 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 730 transitions. [2023-11-17 16:21:03,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 730 transitions. [2023-11-17 16:21:03,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:03,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 730 transitions. [2023-11-17 16:21:03,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.66666666666667) internal successors, (730), 6 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:03,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 306.0) internal successors, (2142), 7 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:03,036 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 306.0) internal successors, (2142), 7 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:03,036 INFO L175 Difference]: Start difference. First operand has 161 places, 194 transitions, 2300 flow. Second operand 6 states and 730 transitions. [2023-11-17 16:21:03,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 186 transitions, 2508 flow [2023-11-17 16:21:03,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 186 transitions, 2406 flow, removed 10 selfloop flow, removed 9 redundant places. [2023-11-17 16:21:03,092 INFO L231 Difference]: Finished difference. Result has 154 places, 94 transitions, 1099 flow [2023-11-17 16:21:03,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=1888, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1099, PETRI_PLACES=154, PETRI_TRANSITIONS=94} [2023-11-17 16:21:03,093 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 124 predicate places. [2023-11-17 16:21:03,093 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 94 transitions, 1099 flow [2023-11-17 16:21:03,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 115.3076923076923) internal successors, (1499), 13 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:03,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:03,093 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:03,115 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:21:03,298 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:21:03,298 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:21:03,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:03,299 INFO L85 PathProgramCache]: Analyzing trace with hash 2134552135, now seen corresponding path program 10 times [2023-11-17 16:21:03,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:03,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899106469] [2023-11-17 16:21:03,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:03,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:03,382 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:21:03,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:03,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899106469] [2023-11-17 16:21:03,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899106469] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:03,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627831157] [2023-11-17 16:21:03,383 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 16:21:03,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:03,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:03,384 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:21:03,386 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:21:03,460 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 16:21:03,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:21:03,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:21:03,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:03,529 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:21:03,530 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:03,586 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:21:03,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627831157] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:03,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:03,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 17 [2023-11-17 16:21:03,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235483477] [2023-11-17 16:21:03,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:03,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-17 16:21:03,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:03,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-17 16:21:03,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2023-11-17 16:21:03,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 306 [2023-11-17 16:21:03,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 94 transitions, 1099 flow. Second operand has 17 states, 17 states have (on average 107.58823529411765) internal successors, (1829), 17 states have internal predecessors, (1829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:03,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:03,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 306 [2023-11-17 16:21:03,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:04,268 INFO L124 PetriNetUnfolderBase]: 997/1507 cut-off events. [2023-11-17 16:21:04,269 INFO L125 PetriNetUnfolderBase]: For 19135/19135 co-relation queries the response was YES. [2023-11-17 16:21:04,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10790 conditions, 1507 events. 997/1507 cut-off events. For 19135/19135 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6006 event pairs, 194 based on Foata normal form. 26/1533 useless extension candidates. Maximal degree in co-relation 10736. Up to 619 conditions per place. [2023-11-17 16:21:04,279 INFO L140 encePairwiseOnDemand]: 294/306 looper letters, 126 selfloop transitions, 91 changer transitions 0/217 dead transitions. [2023-11-17 16:21:04,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 217 transitions, 2860 flow [2023-11-17 16:21:04,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-17 16:21:04,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-17 16:21:04,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2228 transitions. [2023-11-17 16:21:04,297 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36405228758169933 [2023-11-17 16:21:04,297 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2228 transitions. [2023-11-17 16:21:04,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2228 transitions. [2023-11-17 16:21:04,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:04,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2228 transitions. [2023-11-17 16:21:04,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 111.4) internal successors, (2228), 20 states have internal predecessors, (2228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:04,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 306.0) internal successors, (6426), 21 states have internal predecessors, (6426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:04,321 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 306.0) internal successors, (6426), 21 states have internal predecessors, (6426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:04,321 INFO L175 Difference]: Start difference. First operand has 154 places, 94 transitions, 1099 flow. Second operand 20 states and 2228 transitions. [2023-11-17 16:21:04,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 217 transitions, 2860 flow [2023-11-17 16:21:04,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 217 transitions, 2656 flow, removed 66 selfloop flow, removed 12 redundant places. [2023-11-17 16:21:04,369 INFO L231 Difference]: Finished difference. Result has 133 places, 146 transitions, 2000 flow [2023-11-17 16:21:04,369 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=1003, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2000, PETRI_PLACES=133, PETRI_TRANSITIONS=146} [2023-11-17 16:21:04,370 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 103 predicate places. [2023-11-17 16:21:04,370 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 146 transitions, 2000 flow [2023-11-17 16:21:04,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 107.58823529411765) internal successors, (1829), 17 states have internal predecessors, (1829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:04,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:04,371 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:04,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-17 16:21:04,575 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:21:04,576 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:21:04,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:04,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1727175465, now seen corresponding path program 11 times [2023-11-17 16:21:04,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:04,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002296254] [2023-11-17 16:21:04,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:04,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:04,673 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-17 16:21:04,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:04,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002296254] [2023-11-17 16:21:04,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002296254] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:04,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208228575] [2023-11-17 16:21:04,674 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 16:21:04,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:04,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:04,691 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:21:04,716 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:21:04,774 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:21:04,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:21:04,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:21:04,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:04,869 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:21:04,870 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:04,956 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:21:04,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208228575] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:04,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:04,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2023-11-17 16:21:04,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207902543] [2023-11-17 16:21:04,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:04,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-17 16:21:04,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:04,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-17 16:21:04,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2023-11-17 16:21:04,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 306 [2023-11-17 16:21:04,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 146 transitions, 2000 flow. Second operand has 22 states, 22 states have (on average 107.27272727272727) internal successors, (2360), 22 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:21:04,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:04,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 306 [2023-11-17 16:21:04,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:06,918 INFO L124 PetriNetUnfolderBase]: 3014/4350 cut-off events. [2023-11-17 16:21:06,919 INFO L125 PetriNetUnfolderBase]: For 76279/76279 co-relation queries the response was YES. [2023-11-17 16:21:06,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35117 conditions, 4350 events. 3014/4350 cut-off events. For 76279/76279 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 19598 event pairs, 308 based on Foata normal form. 58/4408 useless extension candidates. Maximal degree in co-relation 35059. Up to 1947 conditions per place. [2023-11-17 16:21:06,953 INFO L140 encePairwiseOnDemand]: 294/306 looper letters, 441 selfloop transitions, 351 changer transitions 0/792 dead transitions. [2023-11-17 16:21:06,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 792 transitions, 11344 flow [2023-11-17 16:21:06,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-11-17 16:21:06,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2023-11-17 16:21:06,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 7845 transitions. [2023-11-17 16:21:06,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36624649859943975 [2023-11-17 16:21:06,960 INFO L72 ComplementDD]: Start complementDD. Operand 70 states and 7845 transitions. [2023-11-17 16:21:06,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 7845 transitions. [2023-11-17 16:21:06,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:06,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 70 states and 7845 transitions. [2023-11-17 16:21:06,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 71 states, 70 states have (on average 112.07142857142857) internal successors, (7845), 70 states have internal predecessors, (7845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:06,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 71 states, 71 states have (on average 306.0) internal successors, (21726), 71 states have internal predecessors, (21726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:06,984 INFO L81 ComplementDD]: Finished complementDD. Result has 71 states, 71 states have (on average 306.0) internal successors, (21726), 71 states have internal predecessors, (21726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:06,985 INFO L175 Difference]: Start difference. First operand has 133 places, 146 transitions, 2000 flow. Second operand 70 states and 7845 transitions. [2023-11-17 16:21:06,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 792 transitions, 11344 flow [2023-11-17 16:21:07,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 792 transitions, 9697 flow, removed 638 selfloop flow, removed 8 redundant places. [2023-11-17 16:21:07,160 INFO L231 Difference]: Finished difference. Result has 237 places, 454 transitions, 7167 flow [2023-11-17 16:21:07,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=1628, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=7167, PETRI_PLACES=237, PETRI_TRANSITIONS=454} [2023-11-17 16:21:07,160 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 207 predicate places. [2023-11-17 16:21:07,160 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 454 transitions, 7167 flow [2023-11-17 16:21:07,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 107.27272727272727) internal successors, (2360), 22 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:21:07,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:07,161 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:07,166 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:21:07,366 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:21:07,366 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:21:07,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:07,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1680248757, now seen corresponding path program 12 times [2023-11-17 16:21:07,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:07,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133131415] [2023-11-17 16:21:07,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:07,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:07,458 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:21:07,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:07,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133131415] [2023-11-17 16:21:07,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133131415] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:07,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822803649] [2023-11-17 16:21:07,459 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-17 16:21:07,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:07,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:07,474 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:21:07,475 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:21:07,574 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-17 16:21:07,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:21:07,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:21:07,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:07,641 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:21:07,641 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:07,721 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:21:07,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822803649] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:07,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:07,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2023-11-17 16:21:07,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965387482] [2023-11-17 16:21:07,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:07,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-17 16:21:07,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:07,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-17 16:21:07,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2023-11-17 16:21:07,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 306 [2023-11-17 16:21:07,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 454 transitions, 7167 flow. Second operand has 18 states, 18 states have (on average 111.27777777777777) internal successors, (2003), 18 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:07,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:07,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 306 [2023-11-17 16:21:07,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:08,699 INFO L124 PetriNetUnfolderBase]: 3057/4423 cut-off events. [2023-11-17 16:21:08,699 INFO L125 PetriNetUnfolderBase]: For 132112/132112 co-relation queries the response was YES. [2023-11-17 16:21:08,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42577 conditions, 4423 events. 3057/4423 cut-off events. For 132112/132112 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 20206 event pairs, 531 based on Foata normal form. 50/4473 useless extension candidates. Maximal degree in co-relation 42478. Up to 2192 conditions per place. [2023-11-17 16:21:08,739 INFO L140 encePairwiseOnDemand]: 297/306 looper letters, 438 selfloop transitions, 131 changer transitions 0/569 dead transitions. [2023-11-17 16:21:08,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 569 transitions, 10363 flow [2023-11-17 16:21:08,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 16:21:08,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 16:21:08,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1163 transitions. [2023-11-17 16:21:08,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38006535947712417 [2023-11-17 16:21:08,740 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1163 transitions. [2023-11-17 16:21:08,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1163 transitions. [2023-11-17 16:21:08,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:08,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1163 transitions. [2023-11-17 16:21:08,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 116.3) internal successors, (1163), 10 states have internal predecessors, (1163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:08,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 306.0) internal successors, (3366), 11 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:08,744 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 306.0) internal successors, (3366), 11 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:08,744 INFO L175 Difference]: Start difference. First operand has 237 places, 454 transitions, 7167 flow. Second operand 10 states and 1163 transitions. [2023-11-17 16:21:08,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 569 transitions, 10363 flow [2023-11-17 16:21:09,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 569 transitions, 7621 flow, removed 1290 selfloop flow, removed 8 redundant places. [2023-11-17 16:21:09,356 INFO L231 Difference]: Finished difference. Result has 241 places, 462 transitions, 5656 flow [2023-11-17 16:21:09,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=5165, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5656, PETRI_PLACES=241, PETRI_TRANSITIONS=462} [2023-11-17 16:21:09,363 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 211 predicate places. [2023-11-17 16:21:09,363 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 462 transitions, 5656 flow [2023-11-17 16:21:09,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 111.27777777777777) internal successors, (2003), 18 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:09,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:09,364 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:09,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-17 16:21:09,568 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:21:09,569 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:21:09,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:09,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1365919609, now seen corresponding path program 13 times [2023-11-17 16:21:09,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:09,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841339661] [2023-11-17 16:21:09,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:09,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:09,686 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:21:09,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:09,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841339661] [2023-11-17 16:21:09,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841339661] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:09,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194782609] [2023-11-17 16:21:09,687 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-17 16:21:09,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:09,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:09,688 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:21:09,713 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:21:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:09,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:21:09,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:09,854 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:21:09,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:09,940 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:21:09,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194782609] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:09,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:09,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2023-11-17 16:21:09,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696139161] [2023-11-17 16:21:09,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:09,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-17 16:21:09,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:09,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-17 16:21:09,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-11-17 16:21:09,943 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 306 [2023-11-17 16:21:09,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 462 transitions, 5656 flow. Second operand has 19 states, 19 states have (on average 111.10526315789474) internal successors, (2111), 19 states have internal predecessors, (2111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:09,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:09,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 306 [2023-11-17 16:21:09,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:10,895 INFO L124 PetriNetUnfolderBase]: 3182/4694 cut-off events. [2023-11-17 16:21:10,895 INFO L125 PetriNetUnfolderBase]: For 108808/108808 co-relation queries the response was YES. [2023-11-17 16:21:10,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36952 conditions, 4694 events. 3182/4694 cut-off events. For 108808/108808 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 22386 event pairs, 484 based on Foata normal form. 18/4712 useless extension candidates. Maximal degree in co-relation 36853. Up to 2253 conditions per place. [2023-11-17 16:21:10,932 INFO L140 encePairwiseOnDemand]: 297/306 looper letters, 419 selfloop transitions, 130 changer transitions 0/549 dead transitions. [2023-11-17 16:21:10,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 549 transitions, 8182 flow [2023-11-17 16:21:10,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 16:21:10,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 16:21:10,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1162 transitions. [2023-11-17 16:21:10,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37973856209150325 [2023-11-17 16:21:10,935 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1162 transitions. [2023-11-17 16:21:10,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1162 transitions. [2023-11-17 16:21:10,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:10,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1162 transitions. [2023-11-17 16:21:10,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 116.2) internal successors, (1162), 10 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:10,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 306.0) internal successors, (3366), 11 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:10,938 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 306.0) internal successors, (3366), 11 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:10,938 INFO L175 Difference]: Start difference. First operand has 241 places, 462 transitions, 5656 flow. Second operand 10 states and 1162 transitions. [2023-11-17 16:21:10,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 549 transitions, 8182 flow [2023-11-17 16:21:11,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 549 transitions, 7920 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-11-17 16:21:11,383 INFO L231 Difference]: Finished difference. Result has 246 places, 470 transitions, 5846 flow [2023-11-17 16:21:11,383 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=5437, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5846, PETRI_PLACES=246, PETRI_TRANSITIONS=470} [2023-11-17 16:21:11,383 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 216 predicate places. [2023-11-17 16:21:11,383 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 470 transitions, 5846 flow [2023-11-17 16:21:11,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 111.10526315789474) internal successors, (2111), 19 states have internal predecessors, (2111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:11,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:11,384 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:11,390 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:21:11,588 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:21:11,588 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:21:11,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:11,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1392749309, now seen corresponding path program 14 times [2023-11-17 16:21:11,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:11,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449258946] [2023-11-17 16:21:11,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:11,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:11,666 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:21:11,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:11,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449258946] [2023-11-17 16:21:11,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449258946] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:11,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203753531] [2023-11-17 16:21:11,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:21:11,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:11,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:11,667 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:21:11,669 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:21:11,756 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:21:11,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:21:11,757 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:21:11,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:11,839 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:21:11,840 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:11,912 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:21:11,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203753531] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:11,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:11,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2023-11-17 16:21:11,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642787926] [2023-11-17 16:21:11,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:11,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-17 16:21:11,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:11,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-17 16:21:11,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2023-11-17 16:21:11,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 306 [2023-11-17 16:21:11,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 470 transitions, 5846 flow. Second operand has 19 states, 19 states have (on average 111.10526315789474) internal successors, (2111), 19 states have internal predecessors, (2111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:11,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:11,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 306 [2023-11-17 16:21:11,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:12,943 INFO L124 PetriNetUnfolderBase]: 3226/4778 cut-off events. [2023-11-17 16:21:12,943 INFO L125 PetriNetUnfolderBase]: For 107839/107839 co-relation queries the response was YES. [2023-11-17 16:21:12,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37804 conditions, 4778 events. 3226/4778 cut-off events. For 107839/107839 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 22847 event pairs, 870 based on Foata normal form. 54/4832 useless extension candidates. Maximal degree in co-relation 37703. Up to 3947 conditions per place. [2023-11-17 16:21:12,983 INFO L140 encePairwiseOnDemand]: 297/306 looper letters, 430 selfloop transitions, 95 changer transitions 0/525 dead transitions. [2023-11-17 16:21:12,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 525 transitions, 7697 flow [2023-11-17 16:21:12,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-17 16:21:12,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-17 16:21:12,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1156 transitions. [2023-11-17 16:21:12,985 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37777777777777777 [2023-11-17 16:21:12,985 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1156 transitions. [2023-11-17 16:21:12,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1156 transitions. [2023-11-17 16:21:12,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:12,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1156 transitions. [2023-11-17 16:21:12,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 115.6) internal successors, (1156), 10 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:12,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 306.0) internal successors, (3366), 11 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:12,988 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 306.0) internal successors, (3366), 11 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:12,989 INFO L175 Difference]: Start difference. First operand has 246 places, 470 transitions, 5846 flow. Second operand 10 states and 1156 transitions. [2023-11-17 16:21:12,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 525 transitions, 7697 flow [2023-11-17 16:21:13,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 525 transitions, 7460 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-11-17 16:21:13,381 INFO L231 Difference]: Finished difference. Result has 249 places, 475 transitions, 5911 flow [2023-11-17 16:21:13,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=5619, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5911, PETRI_PLACES=249, PETRI_TRANSITIONS=475} [2023-11-17 16:21:13,382 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 219 predicate places. [2023-11-17 16:21:13,382 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 475 transitions, 5911 flow [2023-11-17 16:21:13,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 111.10526315789474) internal successors, (2111), 19 states have internal predecessors, (2111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:13,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:13,383 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:13,389 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:21:13,587 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:21:13,588 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:21:13,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:13,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1133005737, now seen corresponding path program 15 times [2023-11-17 16:21:13,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:13,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915794755] [2023-11-17 16:21:13,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:13,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:13,680 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:21:13,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:13,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915794755] [2023-11-17 16:21:13,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915794755] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:13,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294004684] [2023-11-17 16:21:13,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 16:21:13,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:13,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:13,682 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:21:13,685 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:21:13,783 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-17 16:21:13,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:21:13,785 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-17 16:21:13,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:13,871 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:21:13,871 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:13,960 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:21:13,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294004684] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:13,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:13,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2023-11-17 16:21:13,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390898818] [2023-11-17 16:21:13,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:13,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-17 16:21:13,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:13,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-17 16:21:13,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2023-11-17 16:21:13,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 306 [2023-11-17 16:21:13,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 475 transitions, 5911 flow. Second operand has 21 states, 21 states have (on average 110.9047619047619) internal successors, (2329), 21 states have internal predecessors, (2329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:13,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:13,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 306 [2023-11-17 16:21:13,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:15,152 INFO L124 PetriNetUnfolderBase]: 3327/4899 cut-off events. [2023-11-17 16:21:15,152 INFO L125 PetriNetUnfolderBase]: For 109120/109120 co-relation queries the response was YES. [2023-11-17 16:21:15,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38613 conditions, 4899 events. 3327/4899 cut-off events. For 109120/109120 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 23361 event pairs, 436 based on Foata normal form. 18/4917 useless extension candidates. Maximal degree in co-relation 38511. Up to 2117 conditions per place. [2023-11-17 16:21:15,199 INFO L140 encePairwiseOnDemand]: 297/306 looper letters, 419 selfloop transitions, 196 changer transitions 0/615 dead transitions. [2023-11-17 16:21:15,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 615 transitions, 9280 flow [2023-11-17 16:21:15,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-17 16:21:15,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-11-17 16:21:15,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1995 transitions. [2023-11-17 16:21:15,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38350634371395614 [2023-11-17 16:21:15,201 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1995 transitions. [2023-11-17 16:21:15,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1995 transitions. [2023-11-17 16:21:15,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:15,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1995 transitions. [2023-11-17 16:21:15,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 117.3529411764706) internal successors, (1995), 17 states have internal predecessors, (1995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:15,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 306.0) internal successors, (5508), 18 states have internal predecessors, (5508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:15,206 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 306.0) internal successors, (5508), 18 states have internal predecessors, (5508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:15,207 INFO L175 Difference]: Start difference. First operand has 249 places, 475 transitions, 5911 flow. Second operand 17 states and 1995 transitions. [2023-11-17 16:21:15,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 615 transitions, 9280 flow [2023-11-17 16:21:15,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 615 transitions, 9021 flow, removed 39 selfloop flow, removed 10 redundant places. [2023-11-17 16:21:15,627 INFO L231 Difference]: Finished difference. Result has 256 places, 482 transitions, 6148 flow [2023-11-17 16:21:15,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=5588, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=6148, PETRI_PLACES=256, PETRI_TRANSITIONS=482} [2023-11-17 16:21:15,627 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 226 predicate places. [2023-11-17 16:21:15,627 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 482 transitions, 6148 flow [2023-11-17 16:21:15,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 110.9047619047619) internal successors, (2329), 21 states have internal predecessors, (2329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:15,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:15,628 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:15,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-11-17 16:21:15,832 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:21:15,833 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:21:15,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:15,833 INFO L85 PathProgramCache]: Analyzing trace with hash -882861631, now seen corresponding path program 16 times [2023-11-17 16:21:15,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:15,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219569938] [2023-11-17 16:21:15,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:15,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:15,921 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:21:15,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:15,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219569938] [2023-11-17 16:21:15,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219569938] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:15,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854632521] [2023-11-17 16:21:15,922 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-17 16:21:15,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:15,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:15,923 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:21:15,948 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:21:16,009 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-17 16:21:16,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:21:16,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:21:16,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:16,094 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:21:16,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:16,170 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:21:16,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854632521] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:16,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:16,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2023-11-17 16:21:16,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123865699] [2023-11-17 16:21:16,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:16,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-17 16:21:16,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:16,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-17 16:21:16,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2023-11-17 16:21:16,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 306 [2023-11-17 16:21:16,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 482 transitions, 6148 flow. Second operand has 18 states, 18 states have (on average 107.66666666666667) internal successors, (1938), 18 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:16,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:16,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 306 [2023-11-17 16:21:16,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:17,836 INFO L124 PetriNetUnfolderBase]: 3381/4981 cut-off events. [2023-11-17 16:21:17,836 INFO L125 PetriNetUnfolderBase]: For 111599/111599 co-relation queries the response was YES. [2023-11-17 16:21:17,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40345 conditions, 4981 events. 3381/4981 cut-off events. For 111599/111599 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 23957 event pairs, 475 based on Foata normal form. 40/5021 useless extension candidates. Maximal degree in co-relation 40243. Up to 2115 conditions per place. [2023-11-17 16:21:17,877 INFO L140 encePairwiseOnDemand]: 294/306 looper letters, 371 selfloop transitions, 369 changer transitions 0/740 dead transitions. [2023-11-17 16:21:17,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 740 transitions, 10957 flow [2023-11-17 16:21:17,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-17 16:21:17,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-11-17 16:21:17,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 3886 transitions. [2023-11-17 16:21:17,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36283846872082165 [2023-11-17 16:21:17,880 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 3886 transitions. [2023-11-17 16:21:17,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 3886 transitions. [2023-11-17 16:21:17,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:17,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 3886 transitions. [2023-11-17 16:21:17,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 111.02857142857142) internal successors, (3886), 35 states have internal predecessors, (3886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:17,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 306.0) internal successors, (11016), 36 states have internal predecessors, (11016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:17,889 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 306.0) internal successors, (11016), 36 states have internal predecessors, (11016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:17,889 INFO L175 Difference]: Start difference. First operand has 256 places, 482 transitions, 6148 flow. Second operand 35 states and 3886 transitions. [2023-11-17 16:21:17,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 740 transitions, 10957 flow [2023-11-17 16:21:18,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 740 transitions, 10479 flow, removed 5 selfloop flow, removed 13 redundant places. [2023-11-17 16:21:18,323 INFO L231 Difference]: Finished difference. Result has 286 places, 561 transitions, 8150 flow [2023-11-17 16:21:18,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=5797, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=482, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=301, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=8150, PETRI_PLACES=286, PETRI_TRANSITIONS=561} [2023-11-17 16:21:18,324 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 256 predicate places. [2023-11-17 16:21:18,324 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 561 transitions, 8150 flow [2023-11-17 16:21:18,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 107.66666666666667) internal successors, (1938), 18 states have internal predecessors, (1938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:18,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:18,324 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 16:21:18,331 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:21:18,528 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:21:18,529 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:21:18,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:18,529 INFO L85 PathProgramCache]: Analyzing trace with hash -326728797, now seen corresponding path program 17 times [2023-11-17 16:21:18,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:18,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935255893] [2023-11-17 16:21:18,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:18,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:18,621 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:21:18,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:18,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935255893] [2023-11-17 16:21:18,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935255893] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:18,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466474814] [2023-11-17 16:21:18,621 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-17 16:21:18,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:18,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:18,622 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:21:18,624 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:21:18,712 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:21:18,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:21:18,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 16:21:18,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:18,772 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:21:18,772 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:18,829 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:21:18,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466474814] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:18,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:18,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2023-11-17 16:21:18,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241507470] [2023-11-17 16:21:18,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:18,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-17 16:21:18,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:18,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-17 16:21:18,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2023-11-17 16:21:18,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 306 [2023-11-17 16:21:18,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 561 transitions, 8150 flow. Second operand has 19 states, 19 states have (on average 107.15789473684211) internal successors, (2036), 19 states have internal predecessors, (2036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:18,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:18,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 306 [2023-11-17 16:21:18,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:20,540 INFO L124 PetriNetUnfolderBase]: 3354/4914 cut-off events. [2023-11-17 16:21:20,540 INFO L125 PetriNetUnfolderBase]: For 129342/129342 co-relation queries the response was YES. [2023-11-17 16:21:20,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42412 conditions, 4914 events. 3354/4914 cut-off events. For 129342/129342 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 23288 event pairs, 475 based on Foata normal form. 18/4932 useless extension candidates. Maximal degree in co-relation 42301. Up to 2101 conditions per place. [2023-11-17 16:21:20,583 INFO L140 encePairwiseOnDemand]: 294/306 looper letters, 340 selfloop transitions, 357 changer transitions 0/697 dead transitions. [2023-11-17 16:21:20,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 697 transitions, 10855 flow [2023-11-17 16:21:20,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-17 16:21:20,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-11-17 16:21:20,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2897 transitions. [2023-11-17 16:21:20,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36412770236299646 [2023-11-17 16:21:20,588 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 2897 transitions. [2023-11-17 16:21:20,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 2897 transitions. [2023-11-17 16:21:20,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 16:21:20,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 2897 transitions. [2023-11-17 16:21:20,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 111.42307692307692) internal successors, (2897), 26 states have internal predecessors, (2897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:20,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 306.0) internal successors, (8262), 27 states have internal predecessors, (8262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:20,611 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 306.0) internal successors, (8262), 27 states have internal predecessors, (8262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:20,611 INFO L175 Difference]: Start difference. First operand has 286 places, 561 transitions, 8150 flow. Second operand 26 states and 2897 transitions. [2023-11-17 16:21:20,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 697 transitions, 10855 flow [2023-11-17 16:21:21,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 697 transitions, 9822 flow, removed 369 selfloop flow, removed 17 redundant places. [2023-11-17 16:21:21,123 INFO L231 Difference]: Finished difference. Result has 291 places, 552 transitions, 7629 flow [2023-11-17 16:21:21,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=6915, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=357, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=7629, PETRI_PLACES=291, PETRI_TRANSITIONS=552} [2023-11-17 16:21:21,125 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 261 predicate places. [2023-11-17 16:21:21,125 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 552 transitions, 7629 flow [2023-11-17 16:21:21,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 107.15789473684211) internal successors, (2036), 19 states have internal predecessors, (2036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:21,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 16:21:21,125 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:21:21,130 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:21:21,329 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:21:21,330 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:21:21,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 16:21:21,330 INFO L85 PathProgramCache]: Analyzing trace with hash -439538418, now seen corresponding path program 2 times [2023-11-17 16:21:21,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 16:21:21,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549003238] [2023-11-17 16:21:21,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 16:21:21,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 16:21:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 16:21:22,552 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:21:22,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 16:21:22,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549003238] [2023-11-17 16:21:22,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549003238] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 16:21:22,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438817691] [2023-11-17 16:21:22,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 16:21:22,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 16:21:22,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 16:21:22,562 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:21:22,567 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:21:22,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 16:21:22,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 16:21:22,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-17 16:21:22,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 16:21:22,741 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:21:22,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-17 16:21:22,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:21:23,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:21:23,306 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 121 treesize of output 90 [2023-11-17 16:21:23,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:23,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 91 [2023-11-17 16:21:24,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:21:24,163 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 16:21:41,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:41,820 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 172 treesize of output 112 [2023-11-17 16:21:41,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:41,843 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 1082 treesize of output 1026 [2023-11-17 16:21:41,862 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 285 treesize of output 229 [2023-11-17 16:21:41,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:41,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 190 treesize of output 182 [2023-11-17 16:21:41,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:41,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 209 treesize of output 177 [2023-11-17 16:21:42,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:42,566 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 223 treesize of output 139 [2023-11-17 16:21:42,596 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-11-17 16:21:42,596 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 14611 treesize of output 13154 [2023-11-17 16:21:42,645 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 185 [2023-11-17 16:21:42,657 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:21:42,664 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-17 16:21:42,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 201 [2023-11-17 16:21:42,691 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:21:42,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 250 treesize of output 182 [2023-11-17 16:21:42,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:42,964 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 191 treesize of output 119 [2023-11-17 16:21:42,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:42,982 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 619 treesize of output 587 [2023-11-17 16:21:43,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:43,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 217 treesize of output 208 [2023-11-17 16:21:43,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:43,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 319 treesize of output 285 [2023-11-17 16:21:43,797 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-17 16:21:43,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:43,811 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 160 treesize of output 100 [2023-11-17 16:21:43,830 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:21:43,831 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 1790 treesize of output 1678 [2023-11-17 16:21:43,864 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:21:43,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 181 treesize of output 166 [2023-11-17 16:21:43,885 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:21:43,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 182 treesize of output 148 [2023-11-17 16:21:43,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:43,959 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 167 treesize of output 107 [2023-11-17 16:21:43,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:43,981 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 1915 treesize of output 1807 [2023-11-17 16:21:44,005 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 78 treesize of output 50 [2023-11-17 16:21:44,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:44,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 206 treesize of output 199 [2023-11-17 16:21:44,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:44,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 210 treesize of output 180 [2023-11-17 16:21:45,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:45,042 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 173 treesize of output 113 [2023-11-17 16:21:45,047 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:21:45,061 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:21:45,062 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 807 treesize of output 739 [2023-11-17 16:21:45,086 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:21:45,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 177 treesize of output 133 [2023-11-17 16:21:45,150 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:21:45,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 139 [2023-11-17 16:21:45,193 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:21:45,193 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 172 treesize of output 1 [2023-11-17 16:21:45,206 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:21:45,207 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 166 treesize of output 1 [2023-11-17 16:21:45,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:45,217 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 140 treesize of output 92 [2023-11-17 16:21:45,223 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:21:45,237 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:21:45,237 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 654 treesize of output 600 [2023-11-17 16:21:45,260 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:21:45,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 117 [2023-11-17 16:21:45,299 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:21:45,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 122 [2023-11-17 16:21:45,342 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:21:45,342 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 142 treesize of output 1 [2023-11-17 16:21:45,356 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:45,357 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 140 treesize of output 92 [2023-11-17 16:21:45,363 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:21:45,375 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:21:45,376 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 300 treesize of output 277 [2023-11-17 16:21:45,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:21:45,396 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:21:45,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 130 [2023-11-17 16:21:45,415 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:21:45,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 264 treesize of output 234 [2023-11-17 16:21:45,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:45,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 90 [2023-11-17 16:21:45,523 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:21:45,537 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:21:45,537 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 638 treesize of output 588 [2023-11-17 16:21:45,561 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:21:45,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 117 [2023-11-17 16:21:45,600 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:21:45,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 122 [2023-11-17 16:21:45,640 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:21:45,640 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 164 treesize of output 1 [2023-11-17 16:21:45,666 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:21:45,666 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 135 treesize of output 1 [2023-11-17 16:21:45,680 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:21:45,680 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 164 treesize of output 1 [2023-11-17 16:21:45,691 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:21:45,691 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 205 treesize of output 1 [2023-11-17 16:21:45,702 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:21:45,702 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 164 treesize of output 1 [2023-11-17 16:21:45,713 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:21:45,714 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 231 treesize of output 1 [2023-11-17 16:21:45,727 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:21:45,727 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 217 treesize of output 1 [2023-11-17 16:21:45,739 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-17 16:21:45,739 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 111 treesize of output 75 [2023-11-17 16:21:45,745 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:21:45,774 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:21:45,775 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 233 treesize of output 214 [2023-11-17 16:21:45,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-17 16:21:45,806 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-17 16:21:45,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 112 [2023-11-17 16:21:45,826 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-11-17 16:21:45,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 227 treesize of output 201 [2023-11-17 16:21:45,971 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:21:45,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 1 [2023-11-17 16:21:45,984 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:21:45,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 255 treesize of output 1 [2023-11-17 16:21:45,996 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:21:45,996 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 140 treesize of output 1 [2023-11-17 16:21:46,011 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:21:46,011 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 196 treesize of output 1 [2023-11-17 16:21:46,026 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:21:46,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 199 treesize of output 1 [2023-11-17 16:21:46,042 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:21:46,042 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 195 treesize of output 1 [2023-11-17 16:21:46,058 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:21:46,058 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 146 treesize of output 1 [2023-11-17 16:21:46,073 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:21:46,073 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 146 treesize of output 1 [2023-11-17 16:21:46,089 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:21:46,089 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 198 treesize of output 1 [2023-11-17 16:21:46,102 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:21:46,102 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 196 treesize of output 1 [2023-11-17 16:21:46,115 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:21:46,115 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 174 treesize of output 1 [2023-11-17 16:21:46,131 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:21:46,131 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 181 treesize of output 1 [2023-11-17 16:21:46,147 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:21:46,147 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 175 treesize of output 1 [2023-11-17 16:21:46,164 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:21:46,164 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 207 treesize of output 1 [2023-11-17 16:21:46,180 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:21:46,180 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 195 treesize of output 1 [2023-11-17 16:21:46,193 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-17 16:21:46,194 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 199 treesize of output 1 [2023-11-17 16:21:46,481 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 16:21:46,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438817691] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 16:21:46,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 16:21:46,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 40 [2023-11-17 16:21:46,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027638138] [2023-11-17 16:21:46,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 16:21:46,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-17 16:21:46,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 16:21:46,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-17 16:21:46,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1524, Unknown=20, NotChecked=0, Total=1722 [2023-11-17 16:21:46,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 306 [2023-11-17 16:21:46,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 552 transitions, 7629 flow. Second operand has 42 states, 42 states have (on average 79.71428571428571) internal successors, (3348), 42 states have internal predecessors, (3348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 16:21:46,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 16:21:46,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 306 [2023-11-17 16:21:46,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 16:21:52,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:22:01,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:22:03,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:22:05,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:22:08,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:22:13,942 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:22:24,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:22:32,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:22:35,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:22:37,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:22:44,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:22:46,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:22:53,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:22:56,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:22:58,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:01,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:08,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:10,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:18,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:20,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:28,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:30,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:32,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:35,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:47,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:49,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:54,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:23:57,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:06,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:09,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:16,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:18,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:20,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:23,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:25,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:27,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:29,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:37,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:40,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:47,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:49,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:24:57,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:00,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:03,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:16,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:24,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:26,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:32,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:35,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:42,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:44,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:47,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:49,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:51,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:54,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:56,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:25:58,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:01,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:03,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:09,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:11,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:13,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:15,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:17,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:20,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:22,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:25,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:27,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:29,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:32,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:34,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:36,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:39,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:41,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:43,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:45,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:53,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:26:58,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:03,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:06,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:08,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:10,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:13,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:15,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:17,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:20,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:22,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:24,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:27,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:29,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:32,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:35,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:37,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:40,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:42,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:45,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:47,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:49,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:51,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:53,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:56,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:27:58,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:28:01,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:28:08,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:28:10,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:28:18,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:28:21,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:28:23,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:28:25,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:28:28,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:28:30,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:28:32,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:28:34,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:28:37,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:28:39,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:28:42,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:28:44,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:28:52,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:28:55,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:28:58,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:29:00,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:29:03,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:29:05,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:29:15,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:29:15,900 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse23 (+ c_~max2~0 1)) (.cse44 (select |c_#memory_int| c_~A~0.base))) (let ((.cse43 (select .cse44 4)) (.cse13 (+ c_~A~0.offset 4)) (.cse16 (+ c_~max3~0 1)) (.cse11 (= c_~max1~0 c_~max2~0)) (.cse119 (<= c_~max3~0 c_~max2~0)) (.cse2 (= c_~max1~0 c_~max3~0)) (.cse203 (<= .cse23 c_~max3~0)) (.cse0 (select .cse44 c_~A~0.offset))) (let ((.cse201 (<= c_~max3~0 .cse0)) (.cse206 (= .cse0 c_~max1~0)) (.cse87 (and .cse2 .cse203)) (.cse88 (and .cse11 .cse119)) (.cse207 (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse218 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse218 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (= c_~max1~0 .cse218))))) (.cse7 (< .cse0 .cse23)) (.cse113 (+ .cse0 1)) (.cse199 (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse217 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse217 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (< .cse0 .cse217))))) (.cse117 (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse216 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse216 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (< c_~max2~0 .cse216))))) (.cse3 (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4)))) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118)))) (.cse120 (< c_~max2~0 .cse0)) (.cse8 (select .cse44 .cse13)) (.cse42 (= c_~max1~0 .cse43)) (.cse158 (= c_~max1~0 0))) (let ((.cse37 (< c_thread1Thread1of1ForFork2_~i~0 c_~N~0)) (.cse41 (and (or (< .cse43 1) .cse42) (or .cse158 (< 0 .cse43)))) (.cse39 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base))) (.cse9 (let ((.cse212 (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse215 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse215 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (= .cse215 .cse8))))) (.cse211 (= .cse8 c_~max3~0))) (and (or .cse7 (and (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse210 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse210 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (= .cse210 .cse8) (< .cse210 .cse113)))) .cse199 (or .cse211 .cse3) .cse212)) (or (let ((.cse214 (= .cse8 c_~max2~0))) (and (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse213 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse213 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (< .cse213 .cse23) (= .cse213 .cse8)))) (or .cse214 (and .cse117 .cse212)) (or (and .cse211 .cse203) .cse3 (and .cse214 .cse119)))) .cse120)))) (.cse60 (< c_~max2~0 c_~max3~0)) (.cse1 (or (and (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse209 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse209 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (< .cse209 .cse23) (= c_~max1~0 .cse209)))) (or .cse3 .cse87 .cse88) (or .cse11 (and .cse117 .cse207))) .cse120)) (.cse5 (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse208 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse208 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (< .cse208 .cse113) (= c_~max1~0 .cse208))))) (.cse6 (or (and .cse199 .cse207) .cse206)) (.cse4 (and .cse201 .cse206)) (.cse55 (< c_~max3~0 .cse23)) (.cse163 (<= 1 c_~max3~0)) (.cse38 (= c_~max2~0 0)) (.cse104 (<= 1 c_~max2~0)) (.cse155 (<= .cse23 c_~max1~0)) (.cse160 (= c_~max3~0 0)) (.cse10 (+ c_~max1~0 1)) (.cse165 (<= .cse113 c_~max3~0)) (.cse164 (select .cse44 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (and (or (< c_~max1~0 .cse0) (and (or (and .cse1 (or (and (or .cse2 .cse3 .cse4) .cse5 .cse6) .cse7)) (< c_~max1~0 .cse8)) (or .cse9 (< .cse8 .cse10)))) (or .cse11 (and (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse12 (select .cse17 c_~A~0.base))) (let ((.cse14 (select .cse12 c_~A~0.offset))) (or (< c_~max1~0 (select .cse12 .cse13)) (< c_~max1~0 .cse14) (< c_~max2~0 .cse14) (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse15 (select (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse15 .cse16) (< c_~max2~0 .cse15) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118))))))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse18 (select .cse20 c_~A~0.base))) (let ((.cse21 (select .cse18 c_~A~0.offset))) (or (< c_~max1~0 (select .cse18 .cse13)) (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse19 (select (select (store .cse20 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (= .cse19 c_~max1~0) (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse19 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118)))) (< c_~max1~0 .cse21) (< c_~max2~0 .cse21)))))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse24 (select .cse26 c_~A~0.base))) (let ((.cse22 (select .cse24 c_~A~0.offset))) (or (< .cse22 .cse10) (< .cse22 .cse23) (< (select .cse24 .cse13) (+ .cse22 1)) (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse25 (select (select (store .cse26 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse25 .cse16) (< .cse22 .cse25) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118))))))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse31 (select .cse29 c_~A~0.base))) (let ((.cse28 (select .cse31 .cse13)) (.cse30 (select .cse31 c_~A~0.offset))) (or (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse27 (select (select (store .cse29 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (= .cse27 .cse28) (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse27 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118)))) (< .cse30 .cse10) (= .cse28 c_~max2~0) (< .cse28 (+ .cse30 1)) (< c_~max2~0 .cse30)))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse36 (select .cse34 c_~A~0.base))) (let ((.cse33 (select .cse36 .cse13)) (.cse35 (select .cse36 c_~A~0.offset))) (or (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse32 (select (select (store .cse34 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (= .cse32 .cse33) (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse32 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (< .cse32 .cse23)))) (< .cse33 .cse10) (< c_~max1~0 .cse35) (< c_~max2~0 .cse35)))))) (or .cse37 (let ((.cse40 (select .cse44 0))) (and (<= c_~M~0 1) .cse38 .cse39 (or (< 0 .cse40) .cse41) (or (and .cse42 (<= (+ .cse40 1) .cse43)) (< .cse40 1) (and (= .cse40 c_~max1~0) (<= .cse43 .cse40)))))) (forall ((v_thread3Thread1of1ForFork1_~i~2_118 Int)) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_732 (Array Int Int))) (let ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse48 (select .cse45 c_~A~0.base))) (let ((.cse46 (select .cse48 .cse13)) (.cse47 (select .cse48 c_~A~0.offset))) (or (< c_~max3~0 (select (select (store .cse45 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4)))) (= .cse46 c_~max2~0) (< .cse46 .cse10) (= .cse46 c_~max3~0) (< c_~max1~0 .cse47) (< c_~max2~0 .cse47)))))))) (forall ((v_thread3Thread1of1ForFork1_~i~2_118 Int)) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_732 (Array Int Int))) (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse51 (select .cse49 c_~A~0.base))) (let ((.cse50 (select .cse51 c_~A~0.offset))) (or (< c_~max3~0 (select (select (store .cse49 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4)))) (< .cse50 .cse10) (= .cse50 c_~max2~0) (< .cse50 (select .cse51 .cse13)) (< c_~max2~0 .cse50)))))))) (or (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_732 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse52 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse54 (select .cse52 c_~A~0.base))) (let ((.cse53 (select .cse54 c_~A~0.offset))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< c_~max3~0 (select (select (store .cse52 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4)))) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (< .cse53 .cse10) (< .cse53 (select .cse54 .cse13)) (< c_~max2~0 .cse53)))))) .cse55) (or (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_732 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse56 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse59 (select .cse56 c_~A~0.base))) (let ((.cse57 (select .cse59 .cse13)) (.cse58 (select .cse59 c_~A~0.offset))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< c_~max3~0 (select (select (store .cse56 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4)))) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (= .cse57 c_~max2~0) (< .cse57 .cse10) (< c_~max1~0 .cse58) (< c_~max2~0 .cse58)))))) .cse60) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse63 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse65 (select .cse63 c_~A~0.base))) (let ((.cse62 (select .cse65 .cse13)) (.cse64 (select .cse65 c_~A~0.offset))) (or (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse61 (select (select (store .cse63 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (= .cse61 .cse62) (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse61 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118)))) (< .cse64 .cse10) (< .cse64 .cse23) (< .cse62 (+ .cse64 1))))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse68 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse69 (select .cse68 c_~A~0.base))) (let ((.cse67 (select .cse69 .cse13)) (.cse66 (select .cse69 c_~A~0.offset))) (or (< .cse66 .cse23) (< .cse67 .cse10) (= .cse67 c_~max3~0) (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< c_~max3~0 (select (select (store .cse68 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4)))) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118))) (< c_~max1~0 .cse66)))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse73 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse70 (select .cse73 c_~A~0.base))) (let ((.cse72 (select .cse70 c_~A~0.offset))) (or (< c_~max1~0 (select .cse70 .cse13)) (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse71 (select (select (store .cse73 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (= .cse71 c_~max1~0) (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse71 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (< .cse71 (+ .cse72 1))))) (< .cse72 .cse23) (< c_~max1~0 .cse72)))))) (= c_~N~0 2) (or (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_732 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse74 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse77 (select .cse74 c_~A~0.base))) (let ((.cse76 (select .cse77 .cse13)) (.cse75 (select .cse77 c_~A~0.offset))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< c_~max3~0 (select (select (store .cse74 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4)))) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (< .cse75 .cse10) (< .cse76 (+ .cse75 1)) (= .cse76 c_~max3~0) (< c_~max2~0 .cse75)))))) .cse55) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse81 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse78 (select .cse81 c_~A~0.base))) (let ((.cse79 (select .cse78 c_~A~0.offset))) (or (< c_~max1~0 (select .cse78 .cse13)) (< .cse79 .cse23) (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse80 (select (select (store .cse81 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (= .cse80 c_~max1~0) (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse80 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118)))) (< c_~max1~0 .cse79) (= c_~max1~0 .cse79)))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse85 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse86 (select .cse85 c_~A~0.base))) (let ((.cse83 (select .cse86 .cse13)) (.cse84 (select .cse86 c_~A~0.offset))) (or (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse82 (select (select (store .cse85 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (= .cse82 .cse83) (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse82 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (< .cse82 (+ .cse84 1))))) (< .cse84 .cse23) (< .cse83 .cse10) (< c_~max1~0 .cse84)))))) (or .cse87 .cse88 (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_732 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse90 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse89 (select .cse90 c_~A~0.base))) (let ((.cse91 (select .cse89 c_~A~0.offset))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< c_~max1~0 (select .cse89 .cse13)) (< c_~max3~0 (select (select (store .cse90 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4)))) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (< c_~max1~0 .cse91) (< c_~max2~0 .cse91))))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse95 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse97 (select .cse95 c_~A~0.base))) (let ((.cse96 (select .cse97 c_~A~0.offset))) (let ((.cse93 (select .cse97 .cse13)) (.cse94 (+ .cse96 1))) (or (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse92 (select (select (store .cse95 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (= .cse92 .cse93) (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse92 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (< .cse92 .cse94)))) (< .cse96 .cse10) (< .cse96 .cse23) (< .cse93 .cse94))))))) (or (and (forall ((v_thread3Thread1of1ForFork1_~i~2_118 Int)) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_732 (Array Int Int))) (let ((.cse99 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse98 (select .cse99 c_~A~0.base))) (let ((.cse100 (select .cse98 c_~A~0.offset))) (or (< c_~max1~0 (select .cse98 .cse13)) (< c_~max3~0 (select (select (store .cse99 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4)))) (< c_~max3~0 (+ .cse100 1)) (< .cse100 .cse23) (< c_~max1~0 .cse100)))))))) (forall ((v_thread3Thread1of1ForFork1_~i~2_118 Int)) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_732 (Array Int Int))) (let ((.cse102 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse101 (select .cse102 c_~A~0.base))) (let ((.cse103 (select .cse101 c_~A~0.offset))) (or (< c_~max1~0 (select .cse101 .cse13)) (< c_~max3~0 (select (select (store .cse102 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4)))) (< .cse103 .cse23) (< c_~max1~0 .cse103) (= c_~max1~0 .cse103))))))))) .cse2) (or .cse37 (and (or (and .cse104 .cse11 (<= .cse43 c_~max2~0)) .cse38 (and .cse104 .cse42 (<= .cse23 .cse43))) (= c_~M~0 1) (or (not .cse38) .cse41) .cse39)) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse107 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse108 (select .cse107 c_~A~0.base))) (let ((.cse105 (select .cse108 c_~A~0.offset)) (.cse106 (select .cse108 .cse13))) (or (< .cse105 .cse10) (< .cse105 .cse23) (< .cse106 (+ .cse105 1)) (= .cse106 c_~max3~0) (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< c_~max3~0 (select (select (store .cse107 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4)))) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118)))))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse112 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse110 (select .cse112 c_~A~0.base))) (let ((.cse109 (select .cse110 c_~A~0.offset))) (or (< .cse109 .cse10) (< .cse109 .cse23) (< .cse109 (select .cse110 .cse13)) (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse111 (select (select (store .cse112 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse111 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (< .cse111 (+ .cse109 1)))))))))) (or (< .cse0 .cse10) (and (or (< .cse8 .cse113) .cse9) (or (and (or .cse7 (and (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse114 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse114 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (< .cse114 .cse113)))) (or .cse3 (< c_~max3~0 .cse113)))) (or (let ((.cse116 (= .cse0 c_~max2~0))) (and (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse115 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse115 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (< .cse115 .cse23)))) (or .cse116 (and .cse117 (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse118 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse118 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (= .cse0 .cse118)))))) (or (and .cse116 .cse119) .cse3))) .cse120)) (< .cse0 .cse8)))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse123 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse125 (select .cse123 c_~A~0.base))) (let ((.cse122 (select .cse125 .cse13)) (.cse124 (select .cse125 c_~A~0.offset))) (or (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse121 (select (select (store .cse123 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (= .cse121 .cse122) (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse121 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (< .cse121 .cse23)))) (< .cse124 .cse10) (< .cse122 (+ .cse124 1)) (< c_~max2~0 .cse124)))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse129 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse127 (select .cse129 c_~A~0.base))) (let ((.cse126 (select .cse127 c_~A~0.offset))) (or (< .cse126 .cse23) (< (select .cse127 .cse13) .cse10) (< c_~max1~0 .cse126) (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse128 (select (select (store .cse129 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse128 .cse16) (< .cse126 .cse128) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118))))))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse132 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse130 (select .cse132 c_~A~0.base))) (let ((.cse133 (select .cse130 c_~A~0.offset))) (or (< c_~max1~0 (select .cse130 .cse13)) (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse131 (select (select (store .cse132 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (= .cse131 c_~max1~0) (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse131 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (< .cse131 .cse23)))) (< c_~max1~0 .cse133) (< c_~max2~0 .cse133)))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse135 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse137 (select .cse135 c_~A~0.base))) (let ((.cse136 (select .cse137 c_~A~0.offset))) (or (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse134 (select (select (store .cse135 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse134 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (< .cse134 .cse23)))) (< .cse136 .cse10) (< .cse136 (select .cse137 .cse13)) (< c_~max2~0 .cse136)))))) (or (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_732 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse138 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse141 (select .cse138 c_~A~0.base))) (let ((.cse140 (select .cse141 .cse13)) (.cse139 (select .cse141 c_~A~0.offset))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< c_~max3~0 (select (select (store .cse138 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4)))) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (< .cse139 .cse10) (= .cse140 c_~max2~0) (< .cse140 (+ .cse139 1)) (< c_~max2~0 .cse139)))))) .cse60) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse144 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse146 (select .cse144 c_~A~0.base))) (let ((.cse143 (select .cse146 .cse13)) (.cse145 (select .cse146 c_~A~0.offset))) (or (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse142 (select (select (store .cse144 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (= .cse142 .cse143) (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse142 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118)))) (= .cse143 c_~max2~0) (< .cse143 .cse10) (< c_~max1~0 .cse145) (< c_~max2~0 .cse145)))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse150 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse151 (select .cse150 c_~A~0.base))) (let ((.cse147 (select .cse151 .cse13)) (.cse148 (select .cse151 c_~A~0.offset))) (or (= .cse147 c_~max2~0) (< .cse147 .cse10) (< c_~max1~0 .cse148) (< c_~max2~0 .cse148) (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse149 (select (select (store .cse150 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse149 .cse16) (< c_~max2~0 .cse149) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118))))))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse154 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse153 (select .cse154 c_~A~0.base))) (let ((.cse152 (select .cse153 c_~A~0.offset))) (or (< .cse152 .cse10) (< c_~max3~0 (+ .cse152 1)) (< .cse152 .cse23) (< .cse152 (select .cse153 .cse13)) (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< c_~max3~0 (select (select (store .cse154 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4)))) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118)))))))) (let ((.cse156 (<= c_thread3Thread1of1ForFork1_~i~2 0)) (.cse159 (<= 1 c_~max1~0)) (.cse157 (<= c_thread3Thread1of1ForFork1_~i~2 2))) (or (and (or (and .cse104 (or (and .cse155 .cse156) (and .cse11 .cse157))) (and .cse38 (or (and .cse158 .cse157) (and (<= c_thread3Thread1of1ForFork1_~i~2 1) .cse159)))) .cse160) (and (let ((.cse161 (< c_thread3Thread1of1ForFork1_~i~2 1)) (.cse162 (and .cse2 .cse157))) (or (and .cse104 (or (and .cse155 (or (and (= c_~max2~0 c_~max3~0) (= c_thread3Thread1of1ForFork1_~i~2 1)) .cse161 .cse162)) (and .cse11 (or .cse161 (and .cse119 .cse157))))) (and .cse38 (or (and .cse158 .cse156) (and (or .cse161 .cse162) .cse159))))) .cse163))) (or (< c_~max1~0 .cse164) (and .cse1 (or .cse7 (and .cse5 .cse6 (or .cse3 .cse4 (and .cse2 .cse165)))))) (= c_~A~0.offset 0) (or (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_732 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse166 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse169 (select .cse166 c_~A~0.base))) (let ((.cse167 (select .cse169 .cse13)) (.cse168 (select .cse169 c_~A~0.offset))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< c_~max3~0 (select (select (store .cse166 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4)))) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (< .cse167 .cse10) (= .cse167 c_~max3~0) (< c_~max1~0 .cse168) (< c_~max2~0 .cse168)))))) .cse55) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse172 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse174 (select .cse172 c_~A~0.base))) (let ((.cse171 (select .cse174 .cse13)) (.cse173 (select .cse174 c_~A~0.offset))) (or (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse170 (select (select (store .cse172 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (= .cse170 .cse171) (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse170 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118)))) (< .cse173 .cse23) (< .cse171 .cse10) (< c_~max1~0 .cse173)))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse178 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse179 (select .cse178 c_~A~0.base))) (let ((.cse176 (select .cse179 .cse13)) (.cse175 (select .cse179 c_~A~0.offset))) (or (< .cse175 .cse10) (= .cse176 c_~max2~0) (< .cse176 (+ .cse175 1)) (< c_~max2~0 .cse175) (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse177 (select (select (store .cse178 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse177 .cse16) (< c_~max2~0 .cse177) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118))))))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse183 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse181 (select .cse183 c_~A~0.base))) (let ((.cse180 (select .cse181 c_~A~0.offset))) (or (< .cse180 .cse10) (= .cse180 c_~max2~0) (< .cse180 (select .cse181 .cse13)) (< c_~max2~0 .cse180) (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse182 (select (select (store .cse183 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse182 .cse16) (< c_~max2~0 .cse182) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118))))))))) (or (and (or (and .cse158 .cse38) (and .cse104 .cse11)) .cse160) (and .cse163 (or (and .cse2 .cse38) (and .cse104 (or .cse88 (and .cse155 .cse2)))))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse186 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse187 (select .cse186 c_~A~0.base))) (let ((.cse185 (select .cse187 c_~A~0.offset))) (or (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse184 (select (select (store .cse186 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse184 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (= .cse184 .cse185)))) (< .cse185 .cse10) (= .cse185 c_~max2~0) (< .cse185 (select .cse187 .cse13)) (< c_~max2~0 .cse185)))))) .cse160 (forall ((v_thread3Thread1of1ForFork1_~i~2_118 Int)) (or (forall ((v_ArrVal_733 (Array Int Int)) (v_ArrVal_732 (Array Int Int))) (let ((.cse188 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse191 (select .cse188 c_~A~0.base))) (let ((.cse190 (select .cse191 .cse13)) (.cse189 (select .cse191 c_~A~0.offset))) (or (< c_~max3~0 (select (select (store .cse188 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4)))) (< .cse189 .cse10) (= .cse190 c_~max2~0) (< .cse190 (+ .cse189 1)) (= .cse190 c_~max3~0) (< c_~max2~0 .cse189)))))) (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118))) (forall ((v_ArrVal_732 (Array Int Int))) (let ((.cse195 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_732))) (let ((.cse192 (select .cse195 c_~A~0.base))) (let ((.cse193 (select .cse192 c_~A~0.offset))) (or (< c_~max1~0 (select .cse192 .cse13)) (< .cse193 .cse23) (< c_~max1~0 .cse193) (= c_~max1~0 .cse193) (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse194 (select (select (store .cse195 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (< .cse194 .cse16) (< .cse193 .cse194) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118))))))))) (or (< .cse164 .cse10) (let ((.cse198 (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse205 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (= .cse164 .cse205) (< .cse205 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118))))) (.cse200 (= .cse164 c_~max3~0))) (and (or .cse7 (let ((.cse197 (= .cse0 .cse164))) (and (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse196 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (= .cse164 .cse196) (< .cse196 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (< .cse196 .cse113)))) (or .cse197 (and .cse198 .cse199)) (or .cse3 (and .cse165 .cse200) (and .cse197 .cse201))))) (or (let ((.cse202 (= .cse164 c_~max2~0))) (and (or .cse202 (and .cse117 .cse198)) (or .cse3 (and .cse203 .cse200) (and .cse119 .cse202)) (forall ((v_ArrVal_733 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_118 Int)) (let ((.cse204 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_733) c_~A~0.base) (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_118 4))))) (or (< (+ v_thread3Thread1of1ForFork1_~i~2_118 1) c_~N~0) (= .cse164 .cse204) (< .cse204 .cse16) (< c_~M~0 v_thread3Thread1of1ForFork1_~i~2_118) (< .cse204 .cse23)))))) .cse120))))))))) is different from false [2023-11-17 16:29:18,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:29:20,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:29:22,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:29:25,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:29:27,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:29:29,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:29:39,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:29:42,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:29:45,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:29:48,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:29:50,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:29:59,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:30:02,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:30:04,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:30:07,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-11-17 16:30:08,469 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 16:30:08,469 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-17 16:30:09,483 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:30:09,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-17 16:30:09,654 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-11-17 16:30:09,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-17 16:30:09,654 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-11-17 16:30:09,655 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-11-17 16:30:09,656 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-11-17 16:30:09,656 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-11-17 16:30:09,656 INFO L445 BasicCegarLoop]: Path program histogram: [17, 2, 1, 1, 1, 1] [2023-11-17 16:30:09,673 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 16:30:09,673 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 16:30:09,675 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-11-17 16:30:09,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 04:30:09 BasicIcfg [2023-11-17 16:30:09,676 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 16:30:09,676 INFO L158 Benchmark]: Toolchain (without parser) took 571376.27ms. Allocated memory was 177.2MB in the beginning and 2.9GB in the end (delta: 2.7GB). Free memory was 133.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2023-11-17 16:30:09,676 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 177.2MB. Free memory is still 134.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 16:30:09,676 INFO L158 Benchmark]: CACSL2BoogieTranslator took 212.82ms. Allocated memory is still 177.2MB. Free memory was 133.6MB in the beginning and 121.9MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-11-17 16:30:09,676 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.00ms. Allocated memory is still 177.2MB. Free memory was 121.7MB in the beginning and 119.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 16:30:09,676 INFO L158 Benchmark]: Boogie Preprocessor took 21.25ms. Allocated memory is still 177.2MB. Free memory was 119.9MB in the beginning and 118.3MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 16:30:09,677 INFO L158 Benchmark]: RCFGBuilder took 421.02ms. Allocated memory was 177.2MB in the beginning and 229.6MB in the end (delta: 52.4MB). Free memory was 118.3MB in the beginning and 198.1MB in the end (delta: -79.8MB). Peak memory consumption was 22.4MB. Max. memory is 8.0GB. [2023-11-17 16:30:09,677 INFO L158 Benchmark]: TraceAbstraction took 570681.22ms. Allocated memory was 229.6MB in the beginning and 2.9GB in the end (delta: 2.6GB). Free memory was 197.6MB in the beginning and 1.2GB in the end (delta: -991.3MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2023-11-17 16:30:09,677 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 177.2MB. Free memory is still 134.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 212.82ms. Allocated memory is still 177.2MB. Free memory was 133.6MB in the beginning and 121.9MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.00ms. Allocated memory is still 177.2MB. Free memory was 121.7MB in the beginning and 119.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.25ms. Allocated memory is still 177.2MB. Free memory was 119.9MB in the beginning and 118.3MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 421.02ms. Allocated memory was 177.2MB in the beginning and 229.6MB in the end (delta: 52.4MB). Free memory was 118.3MB in the beginning and 198.1MB in the end (delta: -79.8MB). Peak memory consumption was 22.4MB. Max. memory is 8.0GB. * TraceAbstraction took 570681.22ms. Allocated memory was 229.6MB in the beginning and 2.9GB in the end (delta: 2.6GB). Free memory was 197.6MB in the beginning and 1.2GB in the end (delta: -991.3MB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 144 PlacesBefore, 30 PlacesAfterwards, 146 TransitionsBefore, 24 TransitionsAfterwards, 1728 CoEnabledTransitionPairs, 8 FixpointIterations, 81 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 18 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 146 TotalNumberOfCompositions, 1838 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1729, independent: 1709, independent conditional: 0, independent unconditional: 1709, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1153, independent: 1144, independent conditional: 0, independent unconditional: 1144, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1153, independent: 1144, independent conditional: 0, independent unconditional: 1144, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1729, independent: 565, independent conditional: 0, independent unconditional: 565, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 1153, unknown conditional: 0, unknown unconditional: 1153] , Statistics on independence cache: Total cache size (in pairs): 63, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 185 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 570.6s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.0s, AutomataDifference: 523.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 191 mSolverCounterUnknown, 2452 SdHoareTripleChecker+Valid, 337.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2452 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 334.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 101 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 241 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15965 IncrementalHoareTripleChecker+Invalid, 16498 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 241 mSolverCounterUnsat, 0 mSDtfsCounter, 15965 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1395 GetRequests, 751 SyntacticMatches, 37 SemanticMatches, 607 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 7353 ImplicationChecksByTransitivity, 188.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8150occurred in iteration=21, InterpolantAutomatonStates: 346, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 36.3s InterpolantComputationTime, 1027 NumberOfCodeBlocks, 1015 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 1446 ConstructedInterpolants, 19 QuantifiedInterpolants, 36428 SizeOfPredicates, 138 NumberOfNonLiveVariables, 4236 ConjunctsInSsa, 324 ConjunctsInUnsatCore, 63 InterpolantComputations, 4 PerfectInterpolantSequences, 142/312 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown