/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-29 23:34:43,518 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 23:34:43,578 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-NoLbe.epf [2023-11-29 23:34:43,601 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 23:34:43,602 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 23:34:43,602 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 23:34:43,603 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 23:34:43,603 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 23:34:43,603 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 23:34:43,606 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 23:34:43,606 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 23:34:43,607 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 23:34:43,607 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 23:34:43,608 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 23:34:43,608 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 23:34:43,608 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 23:34:43,608 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 23:34:43,608 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 23:34:43,609 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 23:34:43,609 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 23:34:43,609 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 23:34:43,609 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 23:34:43,610 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 23:34:43,610 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-29 23:34:43,610 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 23:34:43,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 23:34:43,611 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 23:34:43,611 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 23:34:43,611 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 23:34:43,612 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 23:34:43,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 23:34:43,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 23:34:43,613 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 23:34:43,613 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-11-29 23:34:43,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 23:34:43,770 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 23:34:43,772 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 23:34:43,773 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 23:34:43,773 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 23:34:43,773 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-2.wvr.c [2023-11-29 23:34:44,772 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 23:34:44,945 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 23:34:44,945 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-2.wvr.c [2023-11-29 23:34:44,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1563f67d5/2286ea73afc84cc0bbd09d7b6d632b58/FLAG677da96e8 [2023-11-29 23:34:45,363 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1563f67d5/2286ea73afc84cc0bbd09d7b6d632b58 [2023-11-29 23:34:45,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 23:34:45,365 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-29 23:34:45,366 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 23:34:45,366 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 23:34:45,369 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 23:34:45,369 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 11:34:45" (1/1) ... [2023-11-29 23:34:45,370 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@532952cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:34:45, skipping insertion in model container [2023-11-29 23:34:45,370 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 11:34:45" (1/1) ... [2023-11-29 23:34:45,399 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 23:34:45,507 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/unroll-2.wvr.c[2454,2467] [2023-11-29 23:34:45,512 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 23:34:45,517 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 23:34:45,530 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/unroll-2.wvr.c[2454,2467] [2023-11-29 23:34:45,531 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 23:34:45,540 INFO L206 MainTranslator]: Completed translation [2023-11-29 23:34:45,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:34:45 WrapperNode [2023-11-29 23:34:45,541 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 23:34:45,542 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 23:34:45,542 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 23:34:45,542 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 23:34:45,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:34:45" (1/1) ... [2023-11-29 23:34:45,551 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:34:45" (1/1) ... [2023-11-29 23:34:45,566 INFO L138 Inliner]: procedures = 24, calls = 32, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 139 [2023-11-29 23:34:45,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 23:34:45,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 23:34:45,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 23:34:45,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 23:34:45,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:34:45" (1/1) ... [2023-11-29 23:34:45,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:34:45" (1/1) ... [2023-11-29 23:34:45,576 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:34:45" (1/1) ... [2023-11-29 23:34:45,577 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:34:45" (1/1) ... [2023-11-29 23:34:45,583 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:34:45" (1/1) ... [2023-11-29 23:34:45,585 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:34:45" (1/1) ... [2023-11-29 23:34:45,586 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:34:45" (1/1) ... [2023-11-29 23:34:45,587 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:34:45" (1/1) ... [2023-11-29 23:34:45,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 23:34:45,589 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 23:34:45,589 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 23:34:45,589 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 23:34:45,589 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:34:45" (1/1) ... [2023-11-29 23:34:45,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 23:34:45,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:34:45,612 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-29 23:34:45,617 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-29 23:34:45,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 23:34:45,634 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 23:34:45,634 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 23:34:45,634 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 23:34:45,634 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 23:34:45,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 23:34:45,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 23:34:45,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 23:34:45,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 23:34:45,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 23:34:45,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 23:34:45,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 23:34:45,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 23:34:45,636 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 23:34:45,750 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 23:34:45,751 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 23:34:45,941 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 23:34:45,949 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 23:34:45,949 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-29 23:34:45,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:34:45 BoogieIcfgContainer [2023-11-29 23:34:45,951 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 23:34:45,952 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 23:34:45,952 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 23:34:45,954 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 23:34:45,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 11:34:45" (1/3) ... [2023-11-29 23:34:45,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@525ca901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 11:34:45, skipping insertion in model container [2023-11-29 23:34:45,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:34:45" (2/3) ... [2023-11-29 23:34:45,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@525ca901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 11:34:45, skipping insertion in model container [2023-11-29 23:34:45,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:34:45" (3/3) ... [2023-11-29 23:34:45,956 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-2.wvr.c [2023-11-29 23:34:45,967 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 23:34:45,967 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 23:34:45,968 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 23:34:46,033 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-29 23:34:46,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 173 transitions, 360 flow [2023-11-29 23:34:46,104 INFO L124 PetriNetUnfolderBase]: 14/171 cut-off events. [2023-11-29 23:34:46,105 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 23:34:46,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 171 events. 14/171 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 158 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 111. Up to 2 conditions per place. [2023-11-29 23:34:46,110 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 173 transitions, 360 flow [2023-11-29 23:34:46,113 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 162 transitions, 336 flow [2023-11-29 23:34:46,119 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 23:34:46,124 INFO L362 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=true, 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;@51cf454c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 23:34:46,124 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-29 23:34:46,166 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 23:34:46,166 INFO L124 PetriNetUnfolderBase]: 13/158 cut-off events. [2023-11-29 23:34:46,166 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 23:34:46,167 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:34:46,167 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:34:46,168 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:34:46,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:34:46,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1963916174, now seen corresponding path program 1 times [2023-11-29 23:34:46,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:34:46,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503703400] [2023-11-29 23:34:46,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:34:46,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:34:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:34:46,588 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-29 23:34:46,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:34:46,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503703400] [2023-11-29 23:34:46,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503703400] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 23:34:46,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 23:34:46,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 23:34:46,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868938294] [2023-11-29 23:34:46,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 23:34:46,596 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 23:34:46,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:34:46,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 23:34:46,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 23:34:46,620 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 173 [2023-11-29 23:34:46,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 162 transitions, 336 flow. Second operand has 8 states, 8 states have (on average 109.625) internal successors, (877), 8 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:46,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:34:46,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 173 [2023-11-29 23:34:46,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:34:46,732 INFO L124 PetriNetUnfolderBase]: 14/226 cut-off events. [2023-11-29 23:34:46,733 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-29 23:34:46,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 226 events. 14/226 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 469 event pairs, 5 based on Foata normal form. 25/231 useless extension candidates. Maximal degree in co-relation 160. Up to 41 conditions per place. [2023-11-29 23:34:46,735 INFO L140 encePairwiseOnDemand]: 152/173 looper letters, 47 selfloop transitions, 9 changer transitions 5/155 dead transitions. [2023-11-29 23:34:46,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 155 transitions, 444 flow [2023-11-29 23:34:46,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 23:34:46,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 23:34:46,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 906 transitions. [2023-11-29 23:34:46,748 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6546242774566474 [2023-11-29 23:34:46,748 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 906 transitions. [2023-11-29 23:34:46,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 906 transitions. [2023-11-29 23:34:46,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:34:46,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 906 transitions. [2023-11-29 23:34:46,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 113.25) internal successors, (906), 8 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:46,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 173.0) internal successors, (1557), 9 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:46,760 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 173.0) internal successors, (1557), 9 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:46,763 INFO L307 CegarLoopForPetriNet]: 155 programPoint places, 7 predicate places. [2023-11-29 23:34:46,763 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 155 transitions, 444 flow [2023-11-29 23:34:46,764 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.625) internal successors, (877), 8 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:46,764 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:34:46,764 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:34:46,765 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 23:34:46,765 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:34:46,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:34:46,765 INFO L85 PathProgramCache]: Analyzing trace with hash 33060110, now seen corresponding path program 1 times [2023-11-29 23:34:46,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:34:46,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979616676] [2023-11-29 23:34:46,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:34:46,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:34:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:34:46,987 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-29 23:34:46,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:34:46,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979616676] [2023-11-29 23:34:46,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979616676] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 23:34:46,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 23:34:46,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 23:34:46,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097560240] [2023-11-29 23:34:46,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 23:34:46,989 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 23:34:46,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:34:46,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 23:34:46,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 23:34:46,991 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 173 [2023-11-29 23:34:46,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 155 transitions, 444 flow. Second operand has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:46,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:34:46,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 173 [2023-11-29 23:34:46,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:34:47,134 INFO L124 PetriNetUnfolderBase]: 73/538 cut-off events. [2023-11-29 23:34:47,134 INFO L125 PetriNetUnfolderBase]: For 168/173 co-relation queries the response was YES. [2023-11-29 23:34:47,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 904 conditions, 538 events. 73/538 cut-off events. For 168/173 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2596 event pairs, 20 based on Foata normal form. 0/490 useless extension candidates. Maximal degree in co-relation 589. Up to 98 conditions per place. [2023-11-29 23:34:47,139 INFO L140 encePairwiseOnDemand]: 161/173 looper letters, 65 selfloop transitions, 5 changer transitions 11/186 dead transitions. [2023-11-29 23:34:47,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 186 transitions, 725 flow [2023-11-29 23:34:47,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 23:34:47,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 23:34:47,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1081 transitions. [2023-11-29 23:34:47,142 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6942838792549775 [2023-11-29 23:34:47,142 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1081 transitions. [2023-11-29 23:34:47,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1081 transitions. [2023-11-29 23:34:47,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:34:47,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1081 transitions. [2023-11-29 23:34:47,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.11111111111111) internal successors, (1081), 9 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:47,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 173.0) internal successors, (1730), 10 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:47,147 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 173.0) internal successors, (1730), 10 states have internal predecessors, (1730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:47,148 INFO L307 CegarLoopForPetriNet]: 155 programPoint places, 15 predicate places. [2023-11-29 23:34:47,148 INFO L500 AbstractCegarLoop]: Abstraction has has 170 places, 186 transitions, 725 flow [2023-11-29 23:34:47,149 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:47,149 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:34:47,149 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:34:47,149 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 23:34:47,149 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:34:47,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:34:47,150 INFO L85 PathProgramCache]: Analyzing trace with hash -499559490, now seen corresponding path program 1 times [2023-11-29 23:34:47,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:34:47,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827136719] [2023-11-29 23:34:47,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:34:47,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:34:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:34:47,278 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-29 23:34:47,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:34:47,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827136719] [2023-11-29 23:34:47,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827136719] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 23:34:47,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 23:34:47,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 23:34:47,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430407225] [2023-11-29 23:34:47,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 23:34:47,280 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 23:34:47,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:34:47,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 23:34:47,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 23:34:47,282 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 173 [2023-11-29 23:34:47,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 186 transitions, 725 flow. Second operand has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:47,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:34:47,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 173 [2023-11-29 23:34:47,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:34:47,455 INFO L124 PetriNetUnfolderBase]: 203/995 cut-off events. [2023-11-29 23:34:47,458 INFO L125 PetriNetUnfolderBase]: For 682/718 co-relation queries the response was YES. [2023-11-29 23:34:47,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1876 conditions, 995 events. 203/995 cut-off events. For 682/718 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5941 event pairs, 80 based on Foata normal form. 0/871 useless extension candidates. Maximal degree in co-relation 1451. Up to 200 conditions per place. [2023-11-29 23:34:47,465 INFO L140 encePairwiseOnDemand]: 166/173 looper letters, 35 selfloop transitions, 5 changer transitions 16/208 dead transitions. [2023-11-29 23:34:47,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 208 transitions, 917 flow [2023-11-29 23:34:47,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 23:34:47,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 23:34:47,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 892 transitions. [2023-11-29 23:34:47,467 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.859344894026975 [2023-11-29 23:34:47,467 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 892 transitions. [2023-11-29 23:34:47,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 892 transitions. [2023-11-29 23:34:47,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:34:47,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 892 transitions. [2023-11-29 23:34:47,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 148.66666666666666) internal successors, (892), 6 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:47,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:47,472 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:47,473 INFO L307 CegarLoopForPetriNet]: 155 programPoint places, 20 predicate places. [2023-11-29 23:34:47,473 INFO L500 AbstractCegarLoop]: Abstraction has has 175 places, 208 transitions, 917 flow [2023-11-29 23:34:47,474 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:47,474 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:34:47,475 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:34:47,475 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 23:34:47,475 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:34:47,476 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:34:47,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1369216784, now seen corresponding path program 2 times [2023-11-29 23:34:47,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:34:47,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893163853] [2023-11-29 23:34:47,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:34:47,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:34:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:34:47,703 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-29 23:34:47,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:34:47,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893163853] [2023-11-29 23:34:47,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893163853] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:34:47,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [797425548] [2023-11-29 23:34:47,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 23:34:47,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:34:47,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:34:47,735 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-29 23:34:47,736 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-29 23:34:47,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 23:34:47,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:34:47,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 23:34:47,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:34:47,926 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-29 23:34:47,926 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:34:47,996 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-29 23:34:47,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [797425548] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 23:34:47,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 23:34:47,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 7 [2023-11-29 23:34:47,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915209307] [2023-11-29 23:34:47,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 23:34:47,999 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 23:34:47,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:34:48,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 23:34:48,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-29 23:34:48,001 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 173 [2023-11-29 23:34:48,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 208 transitions, 917 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:48,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:34:48,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 173 [2023-11-29 23:34:48,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:34:48,122 INFO L124 PetriNetUnfolderBase]: 201/1074 cut-off events. [2023-11-29 23:34:48,122 INFO L125 PetriNetUnfolderBase]: For 887/911 co-relation queries the response was YES. [2023-11-29 23:34:48,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2267 conditions, 1074 events. 201/1074 cut-off events. For 887/911 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 6584 event pairs, 52 based on Foata normal form. 2/961 useless extension candidates. Maximal degree in co-relation 1815. Up to 206 conditions per place. [2023-11-29 23:34:48,128 INFO L140 encePairwiseOnDemand]: 168/173 looper letters, 40 selfloop transitions, 8 changer transitions 18/226 dead transitions. [2023-11-29 23:34:48,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 226 transitions, 1134 flow [2023-11-29 23:34:48,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 23:34:48,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 23:34:48,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 609 transitions. [2023-11-29 23:34:48,130 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.880057803468208 [2023-11-29 23:34:48,131 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 609 transitions. [2023-11-29 23:34:48,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 609 transitions. [2023-11-29 23:34:48,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:34:48,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 609 transitions. [2023-11-29 23:34:48,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 152.25) internal successors, (609), 4 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:48,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:48,133 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:48,134 INFO L307 CegarLoopForPetriNet]: 155 programPoint places, 23 predicate places. [2023-11-29 23:34:48,134 INFO L500 AbstractCegarLoop]: Abstraction has has 178 places, 226 transitions, 1134 flow [2023-11-29 23:34:48,135 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:48,135 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:34:48,135 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:34:48,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-29 23:34:48,340 WARN L482 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-29 23:34:48,340 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:34:48,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:34:48,341 INFO L85 PathProgramCache]: Analyzing trace with hash 613534818, now seen corresponding path program 3 times [2023-11-29 23:34:48,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:34:48,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614317415] [2023-11-29 23:34:48,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:34:48,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:34:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:34:48,525 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-29 23:34:48,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:34:48,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614317415] [2023-11-29 23:34:48,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614317415] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:34:48,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066324037] [2023-11-29 23:34:48,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 23:34:48,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:34:48,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:34:48,528 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-29 23:34:48,551 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-29 23:34:48,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 23:34:48,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:34:48,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 23:34:48,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:34:48,729 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-29 23:34:48,730 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:34:48,800 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-29 23:34:48,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066324037] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:34:48,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:34:48,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2023-11-29 23:34:48,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444674113] [2023-11-29 23:34:48,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:34:48,802 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 23:34:48,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:34:48,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 23:34:48,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 23:34:48,803 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 173 [2023-11-29 23:34:48,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 226 transitions, 1134 flow. Second operand has 8 states, 8 states have (on average 145.0) internal successors, (1160), 8 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:48,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:34:48,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 173 [2023-11-29 23:34:48,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:34:49,065 INFO L124 PetriNetUnfolderBase]: 332/1639 cut-off events. [2023-11-29 23:34:49,065 INFO L125 PetriNetUnfolderBase]: For 2176/2389 co-relation queries the response was YES. [2023-11-29 23:34:49,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3931 conditions, 1639 events. 332/1639 cut-off events. For 2176/2389 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 11891 event pairs, 71 based on Foata normal form. 16/1485 useless extension candidates. Maximal degree in co-relation 3406. Up to 268 conditions per place. [2023-11-29 23:34:49,072 INFO L140 encePairwiseOnDemand]: 165/173 looper letters, 99 selfloop transitions, 39 changer transitions 23/313 dead transitions. [2023-11-29 23:34:49,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 313 transitions, 1997 flow [2023-11-29 23:34:49,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 23:34:49,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 23:34:49,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1508 transitions. [2023-11-29 23:34:49,075 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8716763005780347 [2023-11-29 23:34:49,075 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1508 transitions. [2023-11-29 23:34:49,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1508 transitions. [2023-11-29 23:34:49,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:34:49,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1508 transitions. [2023-11-29 23:34:49,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 150.8) internal successors, (1508), 10 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:49,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 173.0) internal successors, (1903), 11 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:49,080 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 173.0) internal successors, (1903), 11 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:49,080 INFO L307 CegarLoopForPetriNet]: 155 programPoint places, 32 predicate places. [2023-11-29 23:34:49,081 INFO L500 AbstractCegarLoop]: Abstraction has has 187 places, 313 transitions, 1997 flow [2023-11-29 23:34:49,081 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 145.0) internal successors, (1160), 8 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:49,081 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:34:49,081 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:34:49,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 23:34:49,286 WARN L482 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-29 23:34:49,287 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:34:49,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:34:49,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1959887028, now seen corresponding path program 4 times [2023-11-29 23:34:49,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:34:49,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690111959] [2023-11-29 23:34:49,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:34:49,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:34:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:34:49,419 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-29 23:34:49,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:34:49,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690111959] [2023-11-29 23:34:49,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690111959] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 23:34:49,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 23:34:49,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 23:34:49,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266893437] [2023-11-29 23:34:49,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 23:34:49,423 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 23:34:49,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:34:49,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 23:34:49,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 23:34:49,424 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 173 [2023-11-29 23:34:49,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 313 transitions, 1997 flow. Second operand has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:49,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:34:49,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 173 [2023-11-29 23:34:49,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:34:49,595 INFO L124 PetriNetUnfolderBase]: 332/1666 cut-off events. [2023-11-29 23:34:49,595 INFO L125 PetriNetUnfolderBase]: For 3162/3644 co-relation queries the response was YES. [2023-11-29 23:34:49,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4479 conditions, 1666 events. 332/1666 cut-off events. For 3162/3644 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 12154 event pairs, 81 based on Foata normal form. 27/1522 useless extension candidates. Maximal degree in co-relation 3233. Up to 268 conditions per place. [2023-11-29 23:34:49,604 INFO L140 encePairwiseOnDemand]: 166/173 looper letters, 121 selfloop transitions, 17 changer transitions 23/313 dead transitions. [2023-11-29 23:34:49,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 313 transitions, 2303 flow [2023-11-29 23:34:49,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 23:34:49,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 23:34:49,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 756 transitions. [2023-11-29 23:34:49,606 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8739884393063584 [2023-11-29 23:34:49,606 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 756 transitions. [2023-11-29 23:34:49,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 756 transitions. [2023-11-29 23:34:49,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:34:49,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 756 transitions. [2023-11-29 23:34:49,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.2) internal successors, (756), 5 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:49,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:49,608 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 173.0) internal successors, (1038), 6 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:49,610 INFO L307 CegarLoopForPetriNet]: 155 programPoint places, 36 predicate places. [2023-11-29 23:34:49,610 INFO L500 AbstractCegarLoop]: Abstraction has has 191 places, 313 transitions, 2303 flow [2023-11-29 23:34:49,610 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:49,611 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:34:49,611 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:34:49,611 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 23:34:49,611 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:34:49,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:34:49,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1107705814, now seen corresponding path program 5 times [2023-11-29 23:34:49,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:34:49,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415895845] [2023-11-29 23:34:49,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:34:49,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:34:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:34:49,747 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-29 23:34:49,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:34:49,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415895845] [2023-11-29 23:34:49,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415895845] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:34:49,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941278298] [2023-11-29 23:34:49,748 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 23:34:49,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:34:49,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:34:49,764 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-29 23:34:49,803 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-29 23:34:49,856 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 23:34:49,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:34:49,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 23:34:49,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:34:49,933 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-29 23:34:49,933 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:34:49,985 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-29 23:34:49,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941278298] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:34:49,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:34:49,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2023-11-29 23:34:49,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632638330] [2023-11-29 23:34:49,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:34:49,986 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 23:34:49,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:34:49,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 23:34:49,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-11-29 23:34:49,988 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 173 [2023-11-29 23:34:49,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 313 transitions, 2303 flow. Second operand has 10 states, 10 states have (on average 144.4) internal successors, (1444), 10 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:49,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:34:49,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 173 [2023-11-29 23:34:49,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:34:50,223 INFO L124 PetriNetUnfolderBase]: 331/1644 cut-off events. [2023-11-29 23:34:50,223 INFO L125 PetriNetUnfolderBase]: For 4335/5138 co-relation queries the response was YES. [2023-11-29 23:34:50,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4937 conditions, 1644 events. 331/1644 cut-off events. For 4335/5138 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 11909 event pairs, 78 based on Foata normal form. 37/1516 useless extension candidates. Maximal degree in co-relation 3609. Up to 262 conditions per place. [2023-11-29 23:34:50,234 INFO L140 encePairwiseOnDemand]: 165/173 looper letters, 106 selfloop transitions, 30 changer transitions 23/311 dead transitions. [2023-11-29 23:34:50,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 311 transitions, 2578 flow [2023-11-29 23:34:50,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 23:34:50,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 23:34:50,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1196 transitions. [2023-11-29 23:34:50,237 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8641618497109826 [2023-11-29 23:34:50,237 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1196 transitions. [2023-11-29 23:34:50,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1196 transitions. [2023-11-29 23:34:50,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:34:50,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1196 transitions. [2023-11-29 23:34:50,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 149.5) internal successors, (1196), 8 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:50,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 173.0) internal successors, (1557), 9 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:50,242 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 173.0) internal successors, (1557), 9 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:50,243 INFO L307 CegarLoopForPetriNet]: 155 programPoint places, 43 predicate places. [2023-11-29 23:34:50,244 INFO L500 AbstractCegarLoop]: Abstraction has has 198 places, 311 transitions, 2578 flow [2023-11-29 23:34:50,245 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 144.4) internal successors, (1444), 10 states have internal predecessors, (1444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:50,245 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:34:50,245 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:34:50,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 23:34:50,451 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:34:50,452 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:34:50,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:34:50,454 INFO L85 PathProgramCache]: Analyzing trace with hash -420189570, now seen corresponding path program 1 times [2023-11-29 23:34:50,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:34:50,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758597814] [2023-11-29 23:34:50,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:34:50,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:34:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:34:50,623 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-29 23:34:50,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:34:50,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758597814] [2023-11-29 23:34:50,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758597814] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 23:34:50,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 23:34:50,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 23:34:50,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731539231] [2023-11-29 23:34:50,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 23:34:50,625 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 23:34:50,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:34:50,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 23:34:50,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 23:34:50,626 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 173 [2023-11-29 23:34:50,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 311 transitions, 2578 flow. Second operand has 5 states, 5 states have (on average 145.2) internal successors, (726), 5 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:50,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:34:50,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 173 [2023-11-29 23:34:50,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:34:50,811 INFO L124 PetriNetUnfolderBase]: 314/1542 cut-off events. [2023-11-29 23:34:50,811 INFO L125 PetriNetUnfolderBase]: For 5287/6007 co-relation queries the response was YES. [2023-11-29 23:34:50,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5076 conditions, 1542 events. 314/1542 cut-off events. For 5287/6007 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 10863 event pairs, 73 based on Foata normal form. 22/1412 useless extension candidates. Maximal degree in co-relation 4456. Up to 301 conditions per place. [2023-11-29 23:34:50,820 INFO L140 encePairwiseOnDemand]: 166/173 looper letters, 115 selfloop transitions, 13 changer transitions 37/317 dead transitions. [2023-11-29 23:34:50,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 317 transitions, 2953 flow [2023-11-29 23:34:50,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 23:34:50,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 23:34:50,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 895 transitions. [2023-11-29 23:34:50,822 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8622350674373795 [2023-11-29 23:34:50,823 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 895 transitions. [2023-11-29 23:34:50,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 895 transitions. [2023-11-29 23:34:50,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:34:50,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 895 transitions. [2023-11-29 23:34:50,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 149.16666666666666) internal successors, (895), 6 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:50,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:50,826 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:50,828 INFO L307 CegarLoopForPetriNet]: 155 programPoint places, 48 predicate places. [2023-11-29 23:34:50,828 INFO L500 AbstractCegarLoop]: Abstraction has has 203 places, 317 transitions, 2953 flow [2023-11-29 23:34:50,828 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 145.2) internal successors, (726), 5 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:50,828 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:34:50,828 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:34:50,828 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 23:34:50,829 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:34:50,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:34:50,829 INFO L85 PathProgramCache]: Analyzing trace with hash 528282952, now seen corresponding path program 2 times [2023-11-29 23:34:50,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:34:50,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721594219] [2023-11-29 23:34:50,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:34:50,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:34:50,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:34:50,931 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-29 23:34:50,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:34:50,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721594219] [2023-11-29 23:34:50,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721594219] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 23:34:50,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 23:34:50,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 23:34:50,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273006049] [2023-11-29 23:34:50,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 23:34:50,934 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 23:34:50,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:34:50,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 23:34:50,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 23:34:50,935 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 173 [2023-11-29 23:34:50,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 317 transitions, 2953 flow. Second operand has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:50,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:34:50,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 173 [2023-11-29 23:34:50,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:34:51,156 INFO L124 PetriNetUnfolderBase]: 364/1844 cut-off events. [2023-11-29 23:34:51,156 INFO L125 PetriNetUnfolderBase]: For 6768/7327 co-relation queries the response was YES. [2023-11-29 23:34:51,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6311 conditions, 1844 events. 364/1844 cut-off events. For 6768/7327 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 13825 event pairs, 85 based on Foata normal form. 9/1677 useless extension candidates. Maximal degree in co-relation 4995. Up to 318 conditions per place. [2023-11-29 23:34:51,166 INFO L140 encePairwiseOnDemand]: 168/173 looper letters, 99 selfloop transitions, 12 changer transitions 37/328 dead transitions. [2023-11-29 23:34:51,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 328 transitions, 3367 flow [2023-11-29 23:34:51,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 23:34:51,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 23:34:51,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 616 transitions. [2023-11-29 23:34:51,167 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8901734104046243 [2023-11-29 23:34:51,167 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 616 transitions. [2023-11-29 23:34:51,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 616 transitions. [2023-11-29 23:34:51,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:34:51,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 616 transitions. [2023-11-29 23:34:51,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 154.0) internal successors, (616), 4 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:51,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:51,169 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 173.0) internal successors, (865), 5 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:51,170 INFO L307 CegarLoopForPetriNet]: 155 programPoint places, 51 predicate places. [2023-11-29 23:34:51,170 INFO L500 AbstractCegarLoop]: Abstraction has has 206 places, 328 transitions, 3367 flow [2023-11-29 23:34:51,171 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:51,171 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:34:51,171 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:34:51,171 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 23:34:51,171 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:34:51,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:34:51,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1736136520, now seen corresponding path program 3 times [2023-11-29 23:34:51,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:34:51,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826995519] [2023-11-29 23:34:51,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:34:51,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:34:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:34:51,283 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-29 23:34:51,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:34:51,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826995519] [2023-11-29 23:34:51,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826995519] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 23:34:51,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 23:34:51,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 23:34:51,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117305126] [2023-11-29 23:34:51,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 23:34:51,284 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 23:34:51,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:34:51,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 23:34:51,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-29 23:34:51,285 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 173 [2023-11-29 23:34:51,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 328 transitions, 3367 flow. Second operand has 6 states, 6 states have (on average 144.66666666666666) internal successors, (868), 6 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:51,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:34:51,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 173 [2023-11-29 23:34:51,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:34:51,541 INFO L124 PetriNetUnfolderBase]: 361/1817 cut-off events. [2023-11-29 23:34:51,541 INFO L125 PetriNetUnfolderBase]: For 8268/9321 co-relation queries the response was YES. [2023-11-29 23:34:51,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6753 conditions, 1817 events. 361/1817 cut-off events. For 8268/9321 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 13433 event pairs, 81 based on Foata normal form. 47/1693 useless extension candidates. Maximal degree in co-relation 5507. Up to 319 conditions per place. [2023-11-29 23:34:51,555 INFO L140 encePairwiseOnDemand]: 166/173 looper letters, 115 selfloop transitions, 26 changer transitions 36/323 dead transitions. [2023-11-29 23:34:51,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 323 transitions, 3675 flow [2023-11-29 23:34:51,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 23:34:51,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 23:34:51,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 907 transitions. [2023-11-29 23:34:51,557 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.873795761078998 [2023-11-29 23:34:51,557 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 907 transitions. [2023-11-29 23:34:51,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 907 transitions. [2023-11-29 23:34:51,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:34:51,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 907 transitions. [2023-11-29 23:34:51,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 151.16666666666666) internal successors, (907), 6 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:51,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:51,560 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:51,560 INFO L307 CegarLoopForPetriNet]: 155 programPoint places, 55 predicate places. [2023-11-29 23:34:51,561 INFO L500 AbstractCegarLoop]: Abstraction has has 210 places, 323 transitions, 3675 flow [2023-11-29 23:34:51,561 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 144.66666666666666) internal successors, (868), 6 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:51,561 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:34:51,561 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:34:51,561 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 23:34:51,562 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:34:51,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:34:51,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1363634026, now seen corresponding path program 1 times [2023-11-29 23:34:51,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:34:51,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300477684] [2023-11-29 23:34:51,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:34:51,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:34:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:34:51,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:34:51,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:34:51,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300477684] [2023-11-29 23:34:51,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300477684] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:34:51,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632450414] [2023-11-29 23:34:51,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:34:51,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:34:51,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:34:51,738 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-29 23:34:51,777 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-29 23:34:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:34:51,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-29 23:34:51,839 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:34:52,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 23:34:52,601 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-29 23:34:52,601 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:34:52,895 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 23:34:52,895 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 19 treesize of output 7 [2023-11-29 23:34:53,535 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-29 23:34:53,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632450414] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:34:53,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:34:53,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 23, 18] total 38 [2023-11-29 23:34:53,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709261432] [2023-11-29 23:34:53,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:34:53,536 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-29 23:34:53,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:34:53,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-29 23:34:53,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1261, Unknown=0, NotChecked=0, Total=1406 [2023-11-29 23:34:53,539 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 173 [2023-11-29 23:34:53,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 323 transitions, 3675 flow. Second operand has 38 states, 38 states have (on average 61.89473684210526) internal successors, (2352), 38 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:34:53,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:34:53,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 173 [2023-11-29 23:34:53,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:35:02,003 INFO L124 PetriNetUnfolderBase]: 9392/19380 cut-off events. [2023-11-29 23:35:02,003 INFO L125 PetriNetUnfolderBase]: For 91647/92406 co-relation queries the response was YES. [2023-11-29 23:35:02,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75869 conditions, 19380 events. 9392/19380 cut-off events. For 91647/92406 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 170606 event pairs, 483 based on Foata normal form. 60/18124 useless extension candidates. Maximal degree in co-relation 57995. Up to 3081 conditions per place. [2023-11-29 23:35:02,140 INFO L140 encePairwiseOnDemand]: 116/173 looper letters, 795 selfloop transitions, 358 changer transitions 638/1862 dead transitions. [2023-11-29 23:35:02,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 1862 transitions, 19443 flow [2023-11-29 23:35:02,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2023-11-29 23:35:02,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2023-11-29 23:35:02,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 11345 transitions. [2023-11-29 23:35:02,162 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.3623095838789001 [2023-11-29 23:35:02,162 INFO L72 ComplementDD]: Start complementDD. Operand 181 states and 11345 transitions. [2023-11-29 23:35:02,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 181 states and 11345 transitions. [2023-11-29 23:35:02,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:35:02,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 181 states and 11345 transitions. [2023-11-29 23:35:02,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 182 states, 181 states have (on average 62.67955801104972) internal successors, (11345), 181 states have internal predecessors, (11345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:35:02,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 182 states, 182 states have (on average 173.0) internal successors, (31486), 182 states have internal predecessors, (31486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:35:02,243 INFO L81 ComplementDD]: Finished complementDD. Result has 182 states, 182 states have (on average 173.0) internal successors, (31486), 182 states have internal predecessors, (31486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:35:02,244 INFO L307 CegarLoopForPetriNet]: 155 programPoint places, 235 predicate places. [2023-11-29 23:35:02,244 INFO L500 AbstractCegarLoop]: Abstraction has has 390 places, 1862 transitions, 19443 flow [2023-11-29 23:35:02,245 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 61.89473684210526) internal successors, (2352), 38 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:35:02,245 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:35:02,245 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:35:02,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-29 23:35:02,450 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:35:02,450 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:35:02,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:35:02,452 INFO L85 PathProgramCache]: Analyzing trace with hash -267058476, now seen corresponding path program 2 times [2023-11-29 23:35:02,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:35:02,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046772094] [2023-11-29 23:35:02,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:35:02,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:35:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:35:04,161 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:35:04,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:35:04,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046772094] [2023-11-29 23:35:04,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046772094] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:35:04,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629134222] [2023-11-29 23:35:04,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 23:35:04,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:35:04,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:35:04,176 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-29 23:35:04,215 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-29 23:35:04,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 23:35:04,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:35:04,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 23:35:04,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:35:04,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 23:35:05,106 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-29 23:35:05,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 23:35:05,660 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 23:35:05,660 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:35:06,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 23:35:06,718 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 168 treesize of output 108 [2023-11-29 23:35:06,762 INFO L349 Elim1Store]: treesize reduction 5, result has 92.3 percent of original size [2023-11-29 23:35:06,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 608 treesize of output 587 [2023-11-29 23:35:06,806 INFO L349 Elim1Store]: treesize reduction 8, result has 87.7 percent of original size [2023-11-29 23:35:06,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 137 treesize of output 137 [2023-11-29 23:35:06,928 INFO L349 Elim1Store]: treesize reduction 8, result has 87.7 percent of original size [2023-11-29 23:35:06,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 104 treesize of output 140 [2023-11-29 23:35:07,342 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:35:07,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629134222] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:35:07,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:35:07,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 28] total 74 [2023-11-29 23:35:07,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609437385] [2023-11-29 23:35:07,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:35:07,343 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2023-11-29 23:35:07,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:35:07,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2023-11-29 23:35:07,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=926, Invalid=4451, Unknown=25, NotChecked=0, Total=5402 [2023-11-29 23:35:07,347 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 173 [2023-11-29 23:35:07,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 1862 transitions, 19443 flow. Second operand has 74 states, 74 states have (on average 57.37837837837838) internal successors, (4246), 74 states have internal predecessors, (4246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:35:07,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:35:07,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 173 [2023-11-29 23:35:07,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:35:08,884 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* c_~x1~0 4) c_~f~0.offset)) (.cse4 (select |c_#memory_int| c_~f~0.base)) (.cse3 (+ (* c_~x2~0 4) c_~f~0.offset))) (and (forall ((v_ArrVal_205 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_205) c_~f~0.base))) (let ((.cse0 (select .cse1 .cse3))) (or (< .cse0 0) (= (select .cse1 (+ c_~f~0.offset (* (select .cse1 .cse2) 4))) (select .cse1 (+ (* .cse0 4) c_~f~0.offset))) (< c_~size~0 (+ .cse0 1)))))) (= c_~f~0.offset 0) (= c_~x1~0 (select .cse4 0)) (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_204 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_204) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_205) c_~f~0.base))) (let ((.cse5 (select .cse6 .cse3))) (or (< c_~size~0 (+ .cse5 1)) (< .cse5 0) (= (select .cse6 (+ (* .cse5 4) c_~f~0.offset)) (select .cse6 (+ c_~f~0.offset (* (select .cse6 .cse2) 4)))))))) (= c_~x2~0 0) (let ((.cse7 (select .cse4 .cse3))) (or (< .cse7 0) (< c_~size~0 (+ .cse7 1)) (= (select .cse4 (+ c_~f~0.offset (* (select .cse4 .cse2) 4))) (select .cse4 (+ (* .cse7 4) c_~f~0.offset))))))) is different from false [2023-11-29 23:35:23,738 INFO L124 PetriNetUnfolderBase]: 20972/42661 cut-off events. [2023-11-29 23:35:23,738 INFO L125 PetriNetUnfolderBase]: For 215345/218909 co-relation queries the response was YES. [2023-11-29 23:35:23,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190534 conditions, 42661 events. 20972/42661 cut-off events. For 215345/218909 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 419338 event pairs, 1179 based on Foata normal form. 205/39901 useless extension candidates. Maximal degree in co-relation 153926. Up to 8584 conditions per place. [2023-11-29 23:35:24,019 INFO L140 encePairwiseOnDemand]: 116/173 looper letters, 1716 selfloop transitions, 697 changer transitions 1639/4487 dead transitions. [2023-11-29 23:35:24,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 4487 transitions, 42952 flow [2023-11-29 23:35:24,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2023-11-29 23:35:24,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2023-11-29 23:35:24,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 9765 transitions. [2023-11-29 23:35:24,031 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.3484264611432242 [2023-11-29 23:35:24,031 INFO L72 ComplementDD]: Start complementDD. Operand 162 states and 9765 transitions. [2023-11-29 23:35:24,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 162 states and 9765 transitions. [2023-11-29 23:35:24,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:35:24,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 162 states and 9765 transitions. [2023-11-29 23:35:24,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 163 states, 162 states have (on average 60.27777777777778) internal successors, (9765), 162 states have internal predecessors, (9765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:35:24,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 163 states, 163 states have (on average 173.0) internal successors, (28199), 163 states have internal predecessors, (28199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:35:24,183 INFO L81 ComplementDD]: Finished complementDD. Result has 163 states, 163 states have (on average 173.0) internal successors, (28199), 163 states have internal predecessors, (28199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:35:24,183 INFO L307 CegarLoopForPetriNet]: 155 programPoint places, 396 predicate places. [2023-11-29 23:35:24,183 INFO L500 AbstractCegarLoop]: Abstraction has has 551 places, 4487 transitions, 42952 flow [2023-11-29 23:35:24,184 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 57.37837837837838) internal successors, (4246), 74 states have internal predecessors, (4246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:35:24,184 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:35:24,184 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:35:24,220 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-29 23:35:24,400 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 23:35:24,401 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:35:24,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:35:24,401 INFO L85 PathProgramCache]: Analyzing trace with hash -659910688, now seen corresponding path program 3 times [2023-11-29 23:35:24,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:35:24,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456134776] [2023-11-29 23:35:24,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:35:24,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:35:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:35:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:35:25,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:35:25,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456134776] [2023-11-29 23:35:25,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456134776] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:35:25,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184182103] [2023-11-29 23:35:25,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 23:35:25,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:35:25,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:35:25,798 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-29 23:35:25,824 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-29 23:35:25,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 23:35:25,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:35:25,995 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-29 23:35:25,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:35:27,138 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:35:27,138 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:35:27,497 INFO L349 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2023-11-29 23:35:27,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 82 [2023-11-29 23:35:27,841 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:35:27,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184182103] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:35:27,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:35:27,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 27, 22] total 66 [2023-11-29 23:35:27,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489728877] [2023-11-29 23:35:27,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:35:27,843 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-11-29 23:35:27,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:35:27,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-11-29 23:35:27,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=553, Invalid=3737, Unknown=0, NotChecked=0, Total=4290 [2023-11-29 23:35:27,847 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 173 [2023-11-29 23:35:27,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 4487 transitions, 42952 flow. Second operand has 66 states, 66 states have (on average 63.803030303030305) internal successors, (4211), 66 states have internal predecessors, (4211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:35:27,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:35:27,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 173 [2023-11-29 23:35:27,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:35:39,735 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L61-->L61-1: Formula: (= (select (select |v_#memory_int_3| v_~f~0.base_3) (+ (* v_~x2~0_4 4) v_~f~0.offset_3)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3} OutVars{#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][2151], [205#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 1641#(= |thread2Thread1of1ForFork1_~i~1#1| 0), thread1Thread1of1ForFork0InUse, 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread2Thread1of1ForFork1InUse, 3623#true, 186#true, 4918#true, 173#(<= 1 ~size~0), 1650#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 95#L37-1true, 155#L84-1true, 38#L61-1true, 2375#true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 928#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 2360#true, 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))]) [2023-11-29 23:35:39,736 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2023-11-29 23:35:39,736 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-29 23:35:39,736 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-29 23:35:39,736 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-29 23:35:39,739 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L61-->L61-1: Formula: (= (select (select |v_#memory_int_3| v_~f~0.base_3) (+ (* v_~x2~0_4 4) v_~f~0.offset_3)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3} OutVars{#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][2483], [205#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 1641#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 20#L38-1true, thread1Thread1of1ForFork0InUse, 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread2Thread1of1ForFork1InUse, 3623#true, 186#true, 173#(<= 1 ~size~0), 1650#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 155#L84-1true, 38#L61-1true, 2375#true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 5528#(or (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ (* ~x1~0 4) ~f~0.offset))) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), 928#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 2360#true, 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))]) [2023-11-29 23:35:39,739 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2023-11-29 23:35:39,739 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-29 23:35:39,739 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-29 23:35:39,739 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-29 23:35:39,740 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L61-->L61-1: Formula: (= (select (select |v_#memory_int_3| v_~f~0.base_3) (+ (* v_~x2~0_4 4) v_~f~0.offset_3)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3} OutVars{#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][2151], [205#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 1641#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 3623#true, 186#true, 1650#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 4918#true, 173#(<= 1 ~size~0), 155#L84-1true, 95#L37-1true, 38#L61-1true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2375#true, 2360#true, 1634#(and (<= (* 2 (div (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 2)) (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* 2 (mod ~n~0 2147483648)))), 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))]) [2023-11-29 23:35:39,740 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2023-11-29 23:35:39,740 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-29 23:35:39,740 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-29 23:35:39,740 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-29 23:35:39,743 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L61-->L61-1: Formula: (= (select (select |v_#memory_int_3| v_~f~0.base_3) (+ (* v_~x2~0_4 4) v_~f~0.offset_3)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3} OutVars{#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][2483], [205#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 20#L38-1true, 1641#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 3623#true, 186#true, 1650#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 173#(<= 1 ~size~0), 155#L84-1true, 38#L61-1true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2375#true, 5528#(or (= ~x2~0 (select (select |#memory_int| ~f~0.base) (+ (* ~x1~0 4) ~f~0.offset))) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)), 2360#true, 1634#(and (<= (* 2 (div (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 2)) (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* 2 (mod ~n~0 2147483648)))), 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))]) [2023-11-29 23:35:39,743 INFO L294 olderBase$Statistics]: this new event has 121 ancestors and is cut-off event [2023-11-29 23:35:39,743 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-29 23:35:39,743 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-29 23:35:39,743 INFO L297 olderBase$Statistics]: existing Event has 121 ancestors and is cut-off event [2023-11-29 23:35:40,526 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L61-->L61-1: Formula: (= (select (select |v_#memory_int_3| v_~f~0.base_3) (+ (* v_~x2~0_4 4) v_~f~0.offset_3)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3} OutVars{#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][2151], [205#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 1641#(= |thread2Thread1of1ForFork1_~i~1#1| 0), thread1Thread1of1ForFork0InUse, 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread2Thread1of1ForFork1InUse, 3623#true, 186#true, 173#(<= 1 ~size~0), 4918#true, 1650#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 155#L84-1true, 38#L61-1true, 2375#true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 928#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 2360#true, 21#L50-2true, 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))]) [2023-11-29 23:35:40,527 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2023-11-29 23:35:40,527 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-11-29 23:35:40,527 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-11-29 23:35:40,527 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-11-29 23:35:40,529 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L61-->L61-1: Formula: (= (select (select |v_#memory_int_3| v_~f~0.base_3) (+ (* v_~x2~0_4 4) v_~f~0.offset_3)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3} OutVars{#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][2151], [205#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 1641#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 3623#true, 186#true, 4918#true, 1650#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 173#(<= 1 ~size~0), 155#L84-1true, 38#L61-1true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2375#true, 2360#true, 1634#(and (<= (* 2 (div (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 2)) (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* 2 (mod ~n~0 2147483648)))), 21#L50-2true, 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))]) [2023-11-29 23:35:40,529 INFO L294 olderBase$Statistics]: this new event has 122 ancestors and is cut-off event [2023-11-29 23:35:40,529 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-11-29 23:35:40,529 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-11-29 23:35:40,529 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2023-11-29 23:35:41,237 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L61-->L61-1: Formula: (= (select (select |v_#memory_int_3| v_~f~0.base_3) (+ (* v_~x2~0_4 4) v_~f~0.offset_3)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3} OutVars{#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][2151], [205#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 1641#(= |thread2Thread1of1ForFork1_~i~1#1| 0), thread1Thread1of1ForFork0InUse, 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread2Thread1of1ForFork1InUse, 3623#true, 186#true, 173#(<= 1 ~size~0), 4918#true, 1650#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 155#L84-1true, 38#L61-1true, 2375#true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 928#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 2360#true, 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))), 11#L51true]) [2023-11-29 23:35:41,237 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2023-11-29 23:35:41,237 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-29 23:35:41,237 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-29 23:35:41,238 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-29 23:35:41,238 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][1659], [205#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 1641#(= |thread2Thread1of1ForFork1_~i~1#1| 0), thread1Thread1of1ForFork0InUse, 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread2Thread1of1ForFork1InUse, 3#L51-1true, 3623#true, 186#true, 173#(<= 1 ~size~0), 4918#true, 1650#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 155#L84-1true, 2375#true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 928#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 2360#true, 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))), 126#L61true]) [2023-11-29 23:35:41,238 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2023-11-29 23:35:41,238 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-29 23:35:41,238 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-29 23:35:41,238 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-29 23:35:41,239 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L61-->L61-1: Formula: (= (select (select |v_#memory_int_3| v_~f~0.base_3) (+ (* v_~x2~0_4 4) v_~f~0.offset_3)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3} OutVars{#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][2151], [205#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 1641#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 3623#true, 186#true, 1650#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 4918#true, 173#(<= 1 ~size~0), 155#L84-1true, 38#L61-1true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2375#true, 2360#true, 1634#(and (<= (* 2 (div (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 2)) (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* 2 (mod ~n~0 2147483648)))), 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))), 11#L51true]) [2023-11-29 23:35:41,239 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2023-11-29 23:35:41,239 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-29 23:35:41,239 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-29 23:35:41,239 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-29 23:35:41,239 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][1659], [205#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 1641#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 3#L51-1true, 3623#true, 186#true, 4918#true, 1650#(and (<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 173#(<= 1 ~size~0), 155#L84-1true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2375#true, 2360#true, 1634#(and (<= (* 2 (div (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 2)) (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* 2 (mod ~n~0 2147483648)))), 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))), 126#L61true]) [2023-11-29 23:35:41,239 INFO L294 olderBase$Statistics]: this new event has 123 ancestors and is cut-off event [2023-11-29 23:35:41,239 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-29 23:35:41,239 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-29 23:35:41,239 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2023-11-29 23:35:43,631 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][3268], [1639#true, thread1Thread1of1ForFork0InUse, 3419#(and (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) ~x1~0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296) 1) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))), thread2Thread1of1ForFork1InUse, 3#L51-1true, 186#true, 4760#(and (or (< ~size~0 (+ ~x2~0 1)) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~x1~0 4) ~f~0.offset))) (< ~x2~0 0)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~x1~0 4) ~f~0.offset))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~x1~0 4) ~f~0.offset))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0))), 173#(<= 1 ~size~0), 155#L84-1true, 203#true, 217#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 10#L38-4true, 5979#(and (= ~x1~0 0) (= |thread1Thread1of1ForFork0_#t~mem1#1| 0) (<= ~size~0 1) (= (select (select |#memory_int| ~f~0.base) 0) 0) (= ~x2~0 0) (= ~f~0.offset 0)), 923#true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2375#true, 1645#true, 2360#true]) [2023-11-29 23:35:43,632 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2023-11-29 23:35:43,632 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-29 23:35:43,632 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-29 23:35:43,632 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-29 23:35:44,468 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][3270], [1639#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 3#L51-1true, 186#true, 173#(<= 1 ~size~0), 155#L84-1true, 217#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 203#true, 5979#(and (= ~x1~0 0) (= |thread1Thread1of1ForFork0_#t~mem1#1| 0) (<= ~size~0 1) (= (select (select |#memory_int| ~f~0.base) 0) 0) (= ~x2~0 0) (= ~f~0.offset 0)), 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2375#true, 923#true, 1645#true, 4824#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~x1~0 4) ~f~0.offset)))), 2360#true, 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))), 128#L37-3true]) [2023-11-29 23:35:44,468 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is not cut-off event [2023-11-29 23:35:44,468 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2023-11-29 23:35:44,468 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2023-11-29 23:35:44,469 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2023-11-29 23:35:45,155 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][3270], [1639#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 3#L51-1true, 186#true, 173#(<= 1 ~size~0), 52#L63-2true, 155#L84-1true, 217#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 203#true, 5979#(and (= ~x1~0 0) (= |thread1Thread1of1ForFork0_#t~mem1#1| 0) (<= ~size~0 1) (= (select (select |#memory_int| ~f~0.base) 0) 0) (= ~x2~0 0) (= ~f~0.offset 0)), 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2375#true, 923#true, 1645#true, 4824#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~x1~0 4) ~f~0.offset)))), 2360#true, 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))]) [2023-11-29 23:35:45,155 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is not cut-off event [2023-11-29 23:35:45,155 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2023-11-29 23:35:45,155 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2023-11-29 23:35:45,155 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is not cut-off event [2023-11-29 23:35:45,864 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][3270], [1639#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 3#L51-1true, 186#true, 173#(<= 1 ~size~0), 155#L84-1true, 217#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 203#true, 5979#(and (= ~x1~0 0) (= |thread1Thread1of1ForFork0_#t~mem1#1| 0) (<= ~size~0 1) (= (select (select |#memory_int| ~f~0.base) 0) 0) (= ~x2~0 0) (= ~f~0.offset 0)), 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2375#true, 923#true, 1645#true, 156#L64true, 4824#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset))) (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~x1~0 4) ~f~0.offset)))), 2360#true, 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))]) [2023-11-29 23:35:45,864 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is not cut-off event [2023-11-29 23:35:45,864 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2023-11-29 23:35:45,864 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2023-11-29 23:35:45,864 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2023-11-29 23:35:45,865 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([454] L64-->L64-1: Formula: (= |v_thread2Thread1of1ForFork1_#t~mem5#1_1| (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_1 4) v_~f~0.offset_2))) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_1, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_1, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem5#1][3396], [4233#(= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~x1~0 4) ~f~0.offset))), 1639#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 186#true, 173#(<= 1 ~size~0), 155#L84-1true, 217#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 203#true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2375#true, 923#true, 6077#(and (= ~x1~0 0) (or (= |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) (= 0 |thread2Thread1of1ForFork1_#t~mem5#1|)) (<= ~size~0 1) (= (select (select |#memory_int| ~f~0.base) 0) 0) (= ~x2~0 0) (= ~f~0.offset 0)), 1645#true, 61#L64-1true, 2360#true, 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))), 11#L51true]) [2023-11-29 23:35:45,865 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is not cut-off event [2023-11-29 23:35:45,865 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2023-11-29 23:35:45,865 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2023-11-29 23:35:45,865 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2023-11-29 23:35:51,431 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][5366], [114#L38-1true, 1639#true, thread1Thread1of1ForFork0InUse, 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 3531#(and (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0) (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= ~x2~0 0))) (= (select (select |#memory_int| ~f~0.base) 0) ~x1~0) (or (and (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1) (= ~x2~0 0)) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)) (<= ~size~0 1) (= ~x2~0 ~x1~0) (= ~f~0.offset 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296) 1) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))), thread2Thread1of1ForFork1InUse, 3#L51-1true, 186#true, 6123#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| ~x2~0) (= ~x1~0 0) (= (select (select |#memory_int| ~f~0.base) 0) ~x2~0) (= ~f~0.offset 0)), 4276#(or (= (select (select |#memory_int| ~f~0.base) (+ (* ~x2~0 4) ~f~0.offset)) (select (select |#memory_int| ~f~0.base) (+ (* ~x1~0 4) ~f~0.offset))) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0)), 173#(<= 1 ~size~0), 155#L84-1true, 203#true, 2063#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 1322#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 2375#true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2360#true]) [2023-11-29 23:35:51,432 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is cut-off event [2023-11-29 23:35:51,432 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-29 23:35:51,432 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-29 23:35:51,432 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-29 23:35:51,914 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][5364], [3557#(and (= ~x1~0 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 0) (= |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| 1)) (= |thread1Thread1of1ForFork0_#t~mem1#1| 0) (<= ~size~0 1) (= (select (select |#memory_int| ~f~0.base) 0) 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~x2~0 0) (= ~f~0.offset 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296) 1) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))), 26#L37-1true, 1639#true, thread1Thread1of1ForFork0InUse, 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread2Thread1of1ForFork1InUse, 3623#true, 3#L51-1true, 186#true, 6123#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| ~x2~0) (= ~x1~0 0) (= (select (select |#memory_int| ~f~0.base) 0) ~x2~0) (= ~f~0.offset 0)), 173#(<= 1 ~size~0), 155#L84-1true, 203#true, 2063#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 2375#true, 1322#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2360#true]) [2023-11-29 23:35:51,914 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is not cut-off event [2023-11-29 23:35:51,914 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is not cut-off event [2023-11-29 23:35:51,914 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is not cut-off event [2023-11-29 23:35:51,914 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is not cut-off event [2023-11-29 23:35:52,222 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][1659], [1639#true, thread1Thread1of1ForFork0InUse, 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread2Thread1of1ForFork1InUse, 3#L51-1true, 3623#true, 186#true, 173#(<= 1 ~size~0), 4918#true, 155#L84-1true, 203#true, 2063#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 2375#true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 1322#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 2360#true, 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))), 82#L60-2true]) [2023-11-29 23:35:52,222 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2023-11-29 23:35:52,222 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 23:35:52,222 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 23:35:52,222 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-29 23:35:52,425 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][5369], [3561#(and (= ~x1~0 0) (= |thread1Thread1of1ForFork0_#t~mem1#1| 0) (<= ~size~0 1) (= (select (select |#memory_int| ~f~0.base) 0) 0) (or (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 1) (= |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| 0)) (= ~x2~0 0) (= ~f~0.offset 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296) 1) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))), 1639#true, thread1Thread1of1ForFork0InUse, 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread2Thread1of1ForFork1InUse, 3623#true, 3#L51-1true, 186#true, 6123#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| ~x2~0) (= ~x1~0 0) (= (select (select |#memory_int| ~f~0.base) 0) ~x2~0) (= ~f~0.offset 0)), 173#(<= 1 ~size~0), 155#L84-1true, 203#true, 2063#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 2375#true, 1322#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2360#true, 82#L60-2true]) [2023-11-29 23:35:52,425 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is not cut-off event [2023-11-29 23:35:52,425 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2023-11-29 23:35:52,425 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2023-11-29 23:35:52,425 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2023-11-29 23:35:52,441 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L61-->L61-1: Formula: (= (select (select |v_#memory_int_3| v_~f~0.base_3) (+ (* v_~x2~0_4 4) v_~f~0.offset_3)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3} OutVars{#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][5494], [1639#true, thread1Thread1of1ForFork0InUse, 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread2Thread1of1ForFork1InUse, 3623#true, 3553#(and (= ~x1~0 0) (<= ~size~0 1) (= (select (select |#memory_int| ~f~0.base) 0) 0) (= ~x2~0 0) (= ~f~0.offset 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296) 1) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))), 186#true, 173#(<= 1 ~size~0), 155#L84-1true, 203#true, 38#L61-1true, 2063#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 1322#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 2375#true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2360#true, 11#L51true, 4945#(and (= ~x1~0 0) (= (select (select |#memory_int| ~f~0.base) 0) ~x2~0) (= ~f~0.offset 0))]) [2023-11-29 23:35:52,441 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2023-11-29 23:35:52,441 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-29 23:35:52,441 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-29 23:35:52,441 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-29 23:35:52,740 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([440] L61-->L61-1: Formula: (= (select (select |v_#memory_int_3| v_~f~0.base_3) (+ (* v_~x2~0_4 4) v_~f~0.offset_3)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3} OutVars{#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_4, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][2151], [1639#true, thread1Thread1of1ForFork0InUse, 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread2Thread1of1ForFork1InUse, 3623#true, 186#true, 173#(<= 1 ~size~0), 4918#true, 155#L84-1true, 203#true, 2063#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 38#L61-1true, 2375#true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 1322#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 2360#true, 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))), 11#L51true]) [2023-11-29 23:35:52,740 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2023-11-29 23:35:52,740 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-29 23:35:52,740 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-29 23:35:52,740 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-29 23:35:52,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][1659], [1639#true, thread1Thread1of1ForFork0InUse, 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread2Thread1of1ForFork1InUse, 3#L51-1true, 3623#true, 186#true, 173#(<= 1 ~size~0), 4918#true, 155#L84-1true, 203#true, 2063#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 2375#true, 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 1322#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 2360#true, 2387#(< (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296)) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296))), 126#L61true]) [2023-11-29 23:35:52,741 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2023-11-29 23:35:52,741 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-29 23:35:52,741 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-29 23:35:52,741 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-29 23:35:52,933 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([419] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][5495], [1639#true, thread1Thread1of1ForFork0InUse, 612#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), thread2Thread1of1ForFork1InUse, 3#L51-1true, 3623#true, 186#true, 6123#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| ~x2~0) (= ~x1~0 0) (= (select (select |#memory_int| ~f~0.base) 0) ~x2~0) (= ~f~0.offset 0)), 173#(<= 1 ~size~0), 155#L84-1true, 203#true, 2063#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 2375#true, 1322#(< (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) (* 2 (mod ~n~0 2147483648))), 2372#(<= (+ (* (div ~n~0 2147483648) 2147483648) 1) ~n~0), 2360#true, 3565#(and (= ~x1~0 0) (= |thread1Thread1of1ForFork0_#t~mem1#1| 0) (<= ~size~0 1) (= (select (select |#memory_int| ~f~0.base) 0) 0) (= ~x2~0 0) (= ~f~0.offset 0) (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* (div ~n~0 2147483648) 4294967296) 1) (+ (* 2 ~n~0) (* (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))), 126#L61true]) [2023-11-29 23:35:52,933 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is not cut-off event [2023-11-29 23:35:52,933 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is not cut-off event [2023-11-29 23:35:52,934 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is not cut-off event [2023-11-29 23:35:52,934 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is not cut-off event [2023-11-29 23:36:04,745 INFO L124 PetriNetUnfolderBase]: 55199/110002 cut-off events. [2023-11-29 23:36:04,746 INFO L125 PetriNetUnfolderBase]: For 527368/536726 co-relation queries the response was YES. [2023-11-29 23:36:05,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511554 conditions, 110002 events. 55199/110002 cut-off events. For 527368/536726 co-relation queries the response was YES. Maximal size of possible extension queue 2286. Compared 1207472 event pairs, 5092 based on Foata normal form. 523/101451 useless extension candidates. Maximal degree in co-relation 416830. Up to 34214 conditions per place. [2023-11-29 23:36:05,568 INFO L140 encePairwiseOnDemand]: 126/173 looper letters, 4092 selfloop transitions, 1336 changer transitions 2111/9014 dead transitions. [2023-11-29 23:36:05,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 733 places, 9014 transitions, 94866 flow [2023-11-29 23:36:05,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2023-11-29 23:36:05,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2023-11-29 23:36:05,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 12140 transitions. [2023-11-29 23:36:05,580 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.3834612590416627 [2023-11-29 23:36:05,580 INFO L72 ComplementDD]: Start complementDD. Operand 183 states and 12140 transitions. [2023-11-29 23:36:05,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 183 states and 12140 transitions. [2023-11-29 23:36:05,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:36:05,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 183 states and 12140 transitions. [2023-11-29 23:36:05,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 184 states, 183 states have (on average 66.33879781420765) internal successors, (12140), 183 states have internal predecessors, (12140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:36:05,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 184 states, 184 states have (on average 173.0) internal successors, (31832), 184 states have internal predecessors, (31832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:36:05,614 INFO L81 ComplementDD]: Finished complementDD. Result has 184 states, 184 states have (on average 173.0) internal successors, (31832), 184 states have internal predecessors, (31832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:36:05,614 INFO L307 CegarLoopForPetriNet]: 155 programPoint places, 578 predicate places. [2023-11-29 23:36:05,614 INFO L500 AbstractCegarLoop]: Abstraction has has 733 places, 9014 transitions, 94866 flow [2023-11-29 23:36:05,615 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 63.803030303030305) internal successors, (4211), 66 states have internal predecessors, (4211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:36:05,615 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:36:05,615 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:36:05,620 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-29 23:36:05,820 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:36:05,821 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:36:05,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:36:05,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1555091038, now seen corresponding path program 4 times [2023-11-29 23:36:05,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:36:05,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434657574] [2023-11-29 23:36:05,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:36:05,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:36:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:36:06,841 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:36:06,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:36:06,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434657574] [2023-11-29 23:36:06,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434657574] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:36:06,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292107244] [2023-11-29 23:36:06,842 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 23:36:06,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:36:06,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:36:06,854 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-29 23:36:06,858 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-29 23:36:06,944 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 23:36:06,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:36:06,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-29 23:36:06,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:36:07,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 23:36:07,462 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:36:07,462 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:36:07,630 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 23:36:07,630 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 19 treesize of output 7 [2023-11-29 23:36:08,084 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:36:08,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292107244] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:36:08,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:36:08,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20, 20] total 55 [2023-11-29 23:36:08,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973840166] [2023-11-29 23:36:08,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:36:08,085 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-11-29 23:36:08,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:36:08,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-11-29 23:36:08,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=2675, Unknown=0, NotChecked=0, Total=2970 [2023-11-29 23:36:08,088 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 173 [2023-11-29 23:36:08,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 733 places, 9014 transitions, 94866 flow. Second operand has 55 states, 55 states have (on average 62.21818181818182) internal successors, (3422), 55 states have internal predecessors, (3422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:36:08,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:36:08,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 173 [2023-11-29 23:36:08,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:39:16,582 INFO L124 PetriNetUnfolderBase]: 129111/247899 cut-off events. [2023-11-29 23:39:16,582 INFO L125 PetriNetUnfolderBase]: For 1248413/1273004 co-relation queries the response was YES. [2023-11-29 23:39:17,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1303833 conditions, 247899 events. 129111/247899 cut-off events. For 1248413/1273004 co-relation queries the response was YES. Maximal size of possible extension queue 4148. Compared 2834277 event pairs, 8748 based on Foata normal form. 896/228639 useless extension candidates. Maximal degree in co-relation 1078666. Up to 88719 conditions per place. [2023-11-29 23:39:19,660 INFO L140 encePairwiseOnDemand]: 114/173 looper letters, 12170 selfloop transitions, 4816 changer transitions 13672/31093 dead transitions. [2023-11-29 23:39:19,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1016 places, 31093 transitions, 359416 flow [2023-11-29 23:39:19,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 284 states. [2023-11-29 23:39:19,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2023-11-29 23:39:19,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 18426 transitions. [2023-11-29 23:39:19,713 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.37503053000081416 [2023-11-29 23:39:19,714 INFO L72 ComplementDD]: Start complementDD. Operand 284 states and 18426 transitions. [2023-11-29 23:39:19,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 284 states and 18426 transitions. [2023-11-29 23:39:19,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:39:19,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 284 states and 18426 transitions. [2023-11-29 23:39:19,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 285 states, 284 states have (on average 64.88028169014085) internal successors, (18426), 284 states have internal predecessors, (18426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:19,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 285 states, 285 states have (on average 173.0) internal successors, (49305), 285 states have internal predecessors, (49305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:19,895 INFO L81 ComplementDD]: Finished complementDD. Result has 285 states, 285 states have (on average 173.0) internal successors, (49305), 285 states have internal predecessors, (49305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:19,908 INFO L307 CegarLoopForPetriNet]: 155 programPoint places, 861 predicate places. [2023-11-29 23:39:19,908 INFO L500 AbstractCegarLoop]: Abstraction has has 1016 places, 31093 transitions, 359416 flow [2023-11-29 23:39:19,909 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 62.21818181818182) internal successors, (3422), 55 states have internal predecessors, (3422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:19,909 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:39:19,909 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 23:39:19,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-29 23:39:20,113 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:39:20,114 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:39:20,114 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:39:20,114 INFO L85 PathProgramCache]: Analyzing trace with hash -716334180, now seen corresponding path program 5 times [2023-11-29 23:39:20,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:39:20,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853184501] [2023-11-29 23:39:20,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:39:20,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:39:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:39:22,288 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:39:22,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:39:22,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853184501] [2023-11-29 23:39:22,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853184501] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:39:22,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373425016] [2023-11-29 23:39:22,289 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 23:39:22,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:39:22,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:39:22,304 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-29 23:39:22,340 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-29 23:39:22,537 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-11-29 23:39:22,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:39:22,539 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-29 23:39:22,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:39:23,681 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:39:23,682 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:39:24,068 INFO L349 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2023-11-29 23:39:24,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 82 [2023-11-29 23:39:24,411 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:39:24,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373425016] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:39:24,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:39:24,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 26, 23] total 68 [2023-11-29 23:39:24,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355455100] [2023-11-29 23:39:24,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:39:24,412 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-11-29 23:39:24,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:39:24,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-11-29 23:39:24,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=3984, Unknown=0, NotChecked=0, Total=4556 [2023-11-29 23:39:24,416 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 173 [2023-11-29 23:39:24,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1016 places, 31093 transitions, 359416 flow. Second operand has 68 states, 68 states have (on average 63.75) internal successors, (4335), 68 states have internal predecessors, (4335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:39:24,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:39:24,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 173 [2023-11-29 23:39:24,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-11-29 23:48:01,444 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-29 23:48:01,455 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-29 23:48:02,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2023-11-29 23:48:02,132 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-11-29 23:48:02,139 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-29 23:48:02,337 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-29 23:48:02,337 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (68states, 60/173 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 968975 conditions, 164488 events (85896/164487 cut-off events. For 1001069/1023492 co-relation queries the response was YES. Maximal size of possible extension queue 5598. Compared 1961133 event pairs, 5724 based on Foata normal form. 893/157118 useless extension candidates. Maximal degree in co-relation 781746. Up to 57509 conditions per place.). [2023-11-29 23:48:02,339 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-11-29 23:48:02,339 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-11-29 23:48:02,339 INFO L457 BasicCegarLoop]: Path program histogram: [5, 5, 3, 1, 1] [2023-11-29 23:48:02,341 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 23:48:02,341 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 23:48:02,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 11:48:02 BasicIcfg [2023-11-29 23:48:02,344 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 23:48:02,345 INFO L158 Benchmark]: Toolchain (without parser) took 796979.59ms. Allocated memory was 402.7MB in the beginning and 7.8GB in the end (delta: 7.4GB). Free memory was 356.8MB in the beginning and 3.5GB in the end (delta: -3.2GB). Peak memory consumption was 5.6GB. Max. memory is 16.0GB. [2023-11-29 23:48:02,345 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 402.7MB. Free memory is still 350.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-29 23:48:02,345 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.26ms. Allocated memory is still 402.7MB. Free memory was 356.8MB in the beginning and 345.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-29 23:48:02,345 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.68ms. Allocated memory is still 402.7MB. Free memory was 345.1MB in the beginning and 343.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 23:48:02,346 INFO L158 Benchmark]: Boogie Preprocessor took 21.68ms. Allocated memory is still 402.7MB. Free memory was 343.0MB in the beginning and 341.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 23:48:02,346 INFO L158 Benchmark]: RCFGBuilder took 361.89ms. Allocated memory is still 402.7MB. Free memory was 341.3MB in the beginning and 324.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2023-11-29 23:48:02,346 INFO L158 Benchmark]: TraceAbstraction took 796392.30ms. Allocated memory was 402.7MB in the beginning and 7.8GB in the end (delta: 7.4GB). Free memory was 323.8MB in the beginning and 3.5GB in the end (delta: -3.2GB). Peak memory consumption was 5.5GB. Max. memory is 16.0GB. [2023-11-29 23:48:02,347 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.10ms. Allocated memory is still 402.7MB. Free memory is still 350.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 175.26ms. Allocated memory is still 402.7MB. Free memory was 356.8MB in the beginning and 345.1MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 24.68ms. Allocated memory is still 402.7MB. Free memory was 345.1MB in the beginning and 343.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 21.68ms. Allocated memory is still 402.7MB. Free memory was 343.0MB in the beginning and 341.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 361.89ms. Allocated memory is still 402.7MB. Free memory was 341.3MB in the beginning and 324.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 796392.30ms. Allocated memory was 402.7MB in the beginning and 7.8GB in the end (delta: 7.4GB). Free memory was 323.8MB in the beginning and 3.5GB in the end (delta: -3.2GB). Peak memory consumption was 5.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (68states, 60/173 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 968975 conditions, 164488 events (85896/164487 cut-off events. For 1001069/1023492 co-relation queries the response was YES. Maximal size of possible extension queue 5598. Compared 1961133 event pairs, 5724 based on Foata normal form. 893/157118 useless extension candidates. Maximal degree in co-relation 781746. Up to 57509 conditions per place.). - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (68states, 60/173 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 968975 conditions, 164488 events (85896/164487 cut-off events. For 1001069/1023492 co-relation queries the response was YES. Maximal size of possible extension queue 5598. Compared 1961133 event pairs, 5724 based on Foata normal form. 893/157118 useless extension candidates. Maximal degree in co-relation 781746. Up to 57509 conditions per place.). - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (68states, 60/173 universal loopers) in iteration 15,while PetriNetUnfolder was constructing finite prefix that currently has 968975 conditions, 164488 events (85896/164487 cut-off events. For 1001069/1023492 co-relation queries the response was YES. Maximal size of possible extension queue 5598. Compared 1961133 event pairs, 5724 based on Foata normal form. 893/157118 useless extension candidates. Maximal degree in co-relation 781746. Up to 57509 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 213 locations, 3 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: 796.3s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 774.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 72 mSolverCounterUnknown, 9904 SdHoareTripleChecker+Valid, 13.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9904 mSDsluCounter, 22255 SdHoareTripleChecker+Invalid, 11.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 865 IncrementalHoareTripleChecker+Unchecked, 21135 mSDsCounter, 700 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32584 IncrementalHoareTripleChecker+Invalid, 34221 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 700 mSolverCounterUnsat, 1120 mSDtfsCounter, 32584 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3272 GetRequests, 2087 SyntacticMatches, 8 SemanticMatches, 1177 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 99914 ImplicationChecksByTransitivity, 29.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=359416occurred in iteration=14, InterpolantAutomatonStates: 876, 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.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 17.7s InterpolantComputationTime, 3070 NumberOfCodeBlocks, 3056 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 4160 ConstructedInterpolants, 49 QuantifiedInterpolants, 31862 SizeOfPredicates, 163 NumberOfNonLiveVariables, 2292 ConjunctsInSsa, 256 ConjunctsInUnsatCore, 31 InterpolantComputations, 8 PerfectInterpolantSequences, 44/242 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