/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/popl20-prod-cons3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-29 22:59:35,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 22:59:35,506 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 22:59:35,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 22:59:35,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 22:59:35,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 22:59:35,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 22:59:35,528 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 22:59:35,528 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 22:59:35,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 22:59:35,529 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 22:59:35,529 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 22:59:35,529 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 22:59:35,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 22:59:35,530 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 22:59:35,530 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 22:59:35,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 22:59:35,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 22:59:35,531 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 22:59:35,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 22:59:35,532 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 22:59:35,532 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 22:59:35,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 22:59:35,533 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-29 22:59:35,533 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 22:59:35,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 22:59:35,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 22:59:35,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 22:59:35,534 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 22:59:35,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 22:59:35,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 22:59:35,535 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 22:59:35,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 22:59:35,536 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 22:59:35,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 22:59:35,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 22:59:35,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 22:59:35,785 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 22:59:35,788 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 22:59:35,789 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-prod-cons3.wvr.c [2023-11-29 22:59:36,905 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 22:59:37,122 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 22:59:37,123 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons3.wvr.c [2023-11-29 22:59:37,129 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e42667fba/8cccadd6d82841a4a0a11d10486a9c7e/FLAGa708ec415 [2023-11-29 22:59:37,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e42667fba/8cccadd6d82841a4a0a11d10486a9c7e [2023-11-29 22:59:37,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 22:59:37,146 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-29 22:59:37,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 22:59:37,147 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 22:59:37,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 22:59:37,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 10:59:37" (1/1) ... [2023-11-29 22:59:37,157 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@581caaf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:59:37, skipping insertion in model container [2023-11-29 22:59:37,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 10:59:37" (1/1) ... [2023-11-29 22:59:37,179 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 22:59:37,318 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons3.wvr.c[4059,4072] [2023-11-29 22:59:37,331 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 22:59:37,339 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 22:59:37,362 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-prod-cons3.wvr.c[4059,4072] [2023-11-29 22:59:37,365 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 22:59:37,371 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 22:59:37,372 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 22:59:37,378 INFO L206 MainTranslator]: Completed translation [2023-11-29 22:59:37,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:59:37 WrapperNode [2023-11-29 22:59:37,382 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 22:59:37,383 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 22:59:37,383 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 22:59:37,383 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 22:59:37,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:59:37" (1/1) ... [2023-11-29 22:59:37,395 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:59:37" (1/1) ... [2023-11-29 22:59:37,424 INFO L138 Inliner]: procedures = 26, calls = 73, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 279 [2023-11-29 22:59:37,426 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 22:59:37,427 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 22:59:37,427 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 22:59:37,427 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 22:59:37,435 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:59:37" (1/1) ... [2023-11-29 22:59:37,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:59:37" (1/1) ... [2023-11-29 22:59:37,439 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:59:37" (1/1) ... [2023-11-29 22:59:37,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:59:37" (1/1) ... [2023-11-29 22:59:37,463 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:59:37" (1/1) ... [2023-11-29 22:59:37,467 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:59:37" (1/1) ... [2023-11-29 22:59:37,479 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:59:37" (1/1) ... [2023-11-29 22:59:37,480 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:59:37" (1/1) ... [2023-11-29 22:59:37,484 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 22:59:37,484 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 22:59:37,484 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 22:59:37,485 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 22:59:37,485 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:59:37" (1/1) ... [2023-11-29 22:59:37,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 22:59:37,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:59:37,510 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 22:59:37,512 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 22:59:37,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 22:59:37,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 22:59:37,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 22:59:37,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 22:59:37,539 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 22:59:37,539 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 22:59:37,539 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 22:59:37,539 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 22:59:37,539 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 22:59:37,539 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 22:59:37,539 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-29 22:59:37,540 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-29 22:59:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 22:59:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 22:59:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 22:59:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 22:59:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 22:59:37,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 22:59:37,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 22:59:37,542 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 22:59:37,632 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 22:59:37,634 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 22:59:37,939 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 22:59:38,059 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 22:59:38,059 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-29 22:59:38,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:59:38 BoogieIcfgContainer [2023-11-29 22:59:38,061 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 22:59:38,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 22:59:38,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 22:59:38,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 22:59:38,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 10:59:37" (1/3) ... [2023-11-29 22:59:38,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b5ff8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 10:59:38, skipping insertion in model container [2023-11-29 22:59:38,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:59:37" (2/3) ... [2023-11-29 22:59:38,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47b5ff8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 10:59:38, skipping insertion in model container [2023-11-29 22:59:38,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:59:38" (3/3) ... [2023-11-29 22:59:38,067 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons3.wvr.c [2023-11-29 22:59:38,082 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 22:59:38,082 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 22:59:38,082 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 22:59:38,158 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-29 22:59:38,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 244 places, 249 transitions, 526 flow [2023-11-29 22:59:38,279 INFO L124 PetriNetUnfolderBase]: 18/245 cut-off events. [2023-11-29 22:59:38,279 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 22:59:38,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 245 events. 18/245 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 145 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 210. Up to 3 conditions per place. [2023-11-29 22:59:38,286 INFO L82 GeneralOperation]: Start removeDead. Operand has 244 places, 249 transitions, 526 flow [2023-11-29 22:59:38,291 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 227 places, 232 transitions, 488 flow [2023-11-29 22:59:38,298 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 22:59:38,304 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;@71c99573, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 22:59:38,304 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-29 22:59:38,350 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 22:59:38,350 INFO L124 PetriNetUnfolderBase]: 18/231 cut-off events. [2023-11-29 22:59:38,350 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-29 22:59:38,351 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:59:38,351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:59:38,352 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 22:59:38,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:59:38,356 INFO L85 PathProgramCache]: Analyzing trace with hash 955148803, now seen corresponding path program 1 times [2023-11-29 22:59:38,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:59:38,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194602053] [2023-11-29 22:59:38,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:59:38,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:59:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:59:39,551 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 22:59:39,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:59:39,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194602053] [2023-11-29 22:59:39,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194602053] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 22:59:39,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 22:59:39,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 22:59:39,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667567314] [2023-11-29 22:59:39,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:59:39,563 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 22:59:39,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:59:39,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 22:59:39,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-29 22:59:39,597 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 249 [2023-11-29 22:59:39,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 232 transitions, 488 flow. Second operand has 9 states, 9 states have (on average 166.66666666666666) internal successors, (1500), 9 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states 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 22:59:39,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:59:39,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 249 [2023-11-29 22:59:39,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:59:40,444 INFO L124 PetriNetUnfolderBase]: 1687/3713 cut-off events. [2023-11-29 22:59:40,444 INFO L125 PetriNetUnfolderBase]: For 584/584 co-relation queries the response was YES. [2023-11-29 22:59:40,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6706 conditions, 3713 events. 1687/3713 cut-off events. For 584/584 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 28135 event pairs, 386 based on Foata normal form. 411/3836 useless extension candidates. Maximal degree in co-relation 6273. Up to 946 conditions per place. [2023-11-29 22:59:40,482 INFO L140 encePairwiseOnDemand]: 221/249 looper letters, 135 selfloop transitions, 14 changer transitions 11/304 dead transitions. [2023-11-29 22:59:40,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 304 transitions, 994 flow [2023-11-29 22:59:40,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 22:59:40,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 22:59:40,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1951 transitions. [2023-11-29 22:59:40,497 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7123037604965315 [2023-11-29 22:59:40,498 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1951 transitions. [2023-11-29 22:59:40,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1951 transitions. [2023-11-29 22:59:40,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:59:40,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1951 transitions. [2023-11-29 22:59:40,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 177.36363636363637) internal successors, (1951), 11 states have internal predecessors, (1951), 0 states have call successors, (0), 0 states 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 22:59:40,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 249.0) internal successors, (2988), 12 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states 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 22:59:40,521 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 249.0) internal successors, (2988), 12 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states 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 22:59:40,526 INFO L307 CegarLoopForPetriNet]: 227 programPoint places, 10 predicate places. [2023-11-29 22:59:40,526 INFO L500 AbstractCegarLoop]: Abstraction has has 237 places, 304 transitions, 994 flow [2023-11-29 22:59:40,527 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 166.66666666666666) internal successors, (1500), 9 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states 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 22:59:40,528 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:59:40,528 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:59:40,528 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 22:59:40,528 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 22:59:40,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:59:40,529 INFO L85 PathProgramCache]: Analyzing trace with hash 463066869, now seen corresponding path program 2 times [2023-11-29 22:59:40,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:59:40,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940030365] [2023-11-29 22:59:40,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:59:40,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:59:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:59:40,765 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 22:59:40,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:59:40,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940030365] [2023-11-29 22:59:40,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940030365] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 22:59:40,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 22:59:40,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 22:59:40,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886626805] [2023-11-29 22:59:40,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:59:40,769 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 22:59:40,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:59:40,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 22:59:40,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 22:59:40,773 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 249 [2023-11-29 22:59:40,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 304 transitions, 994 flow. Second operand has 4 states, 4 states have (on average 216.75) internal successors, (867), 4 states have internal predecessors, (867), 0 states have call successors, (0), 0 states 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 22:59:40,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:59:40,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 249 [2023-11-29 22:59:40,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:59:41,258 INFO L124 PetriNetUnfolderBase]: 1562/3290 cut-off events. [2023-11-29 22:59:41,258 INFO L125 PetriNetUnfolderBase]: For 989/1076 co-relation queries the response was YES. [2023-11-29 22:59:41,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7916 conditions, 3290 events. 1562/3290 cut-off events. For 989/1076 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 23832 event pairs, 59 based on Foata normal form. 3/3144 useless extension candidates. Maximal degree in co-relation 7619. Up to 991 conditions per place. [2023-11-29 22:59:41,294 INFO L140 encePairwiseOnDemand]: 244/249 looper letters, 100 selfloop transitions, 10 changer transitions 13/323 dead transitions. [2023-11-29 22:59:41,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 323 transitions, 1305 flow [2023-11-29 22:59:41,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 22:59:41,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 22:59:41,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1120 transitions. [2023-11-29 22:59:41,297 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8995983935742972 [2023-11-29 22:59:41,297 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1120 transitions. [2023-11-29 22:59:41,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1120 transitions. [2023-11-29 22:59:41,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:59:41,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1120 transitions. [2023-11-29 22:59:41,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states 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 22:59:41,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states 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 22:59:41,303 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states 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 22:59:41,304 INFO L307 CegarLoopForPetriNet]: 227 programPoint places, 14 predicate places. [2023-11-29 22:59:41,304 INFO L500 AbstractCegarLoop]: Abstraction has has 241 places, 323 transitions, 1305 flow [2023-11-29 22:59:41,305 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 216.75) internal successors, (867), 4 states have internal predecessors, (867), 0 states have call successors, (0), 0 states 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 22:59:41,305 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:59:41,305 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:59:41,305 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 22:59:41,306 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 22:59:41,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:59:41,306 INFO L85 PathProgramCache]: Analyzing trace with hash -676251574, now seen corresponding path program 1 times [2023-11-29 22:59:41,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:59:41,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56522476] [2023-11-29 22:59:41,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:59:41,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:59:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:59:41,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:59:41,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:59:41,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56522476] [2023-11-29 22:59:41,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56522476] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 22:59:41,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 22:59:41,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 22:59:41,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080821570] [2023-11-29 22:59:41,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:59:41,468 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 22:59:41,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:59:41,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 22:59:41,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 22:59:41,474 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 249 [2023-11-29 22:59:41,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 323 transitions, 1305 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states 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 22:59:41,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:59:41,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 249 [2023-11-29 22:59:41,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:59:41,974 INFO L124 PetriNetUnfolderBase]: 1605/3557 cut-off events. [2023-11-29 22:59:41,974 INFO L125 PetriNetUnfolderBase]: For 2485/2916 co-relation queries the response was YES. [2023-11-29 22:59:41,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9487 conditions, 3557 events. 1605/3557 cut-off events. For 2485/2916 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 26318 event pairs, 177 based on Foata normal form. 70/3417 useless extension candidates. Maximal degree in co-relation 9173. Up to 883 conditions per place. [2023-11-29 22:59:42,007 INFO L140 encePairwiseOnDemand]: 246/249 looper letters, 61 selfloop transitions, 4 changer transitions 14/320 dead transitions. [2023-11-29 22:59:42,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 320 transitions, 1437 flow [2023-11-29 22:59:42,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 22:59:42,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 22:59:42,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 683 transitions. [2023-11-29 22:59:42,009 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9143239625167336 [2023-11-29 22:59:42,009 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 683 transitions. [2023-11-29 22:59:42,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 683 transitions. [2023-11-29 22:59:42,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:59:42,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 683 transitions. [2023-11-29 22:59:42,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 0 states 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 22:59:42,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states 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 22:59:42,013 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states 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 22:59:42,014 INFO L307 CegarLoopForPetriNet]: 227 programPoint places, 16 predicate places. [2023-11-29 22:59:42,015 INFO L500 AbstractCegarLoop]: Abstraction has has 243 places, 320 transitions, 1437 flow [2023-11-29 22:59:42,015 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states 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 22:59:42,015 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:59:42,015 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:59:42,015 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 22:59:42,016 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 22:59:42,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:59:42,016 INFO L85 PathProgramCache]: Analyzing trace with hash 693012331, now seen corresponding path program 1 times [2023-11-29 22:59:42,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:59:42,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463716238] [2023-11-29 22:59:42,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:59:42,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:59:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:59:42,152 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 22:59:42,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:59:42,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463716238] [2023-11-29 22:59:42,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463716238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 22:59:42,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 22:59:42,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 22:59:42,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299199562] [2023-11-29 22:59:42,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:59:42,157 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 22:59:42,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:59:42,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 22:59:42,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 22:59:42,159 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 249 [2023-11-29 22:59:42,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 320 transitions, 1437 flow. Second operand has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states 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 22:59:42,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:59:42,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 249 [2023-11-29 22:59:42,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:59:42,480 INFO L124 PetriNetUnfolderBase]: 1176/2563 cut-off events. [2023-11-29 22:59:42,480 INFO L125 PetriNetUnfolderBase]: For 3662/3886 co-relation queries the response was YES. [2023-11-29 22:59:42,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7837 conditions, 2563 events. 1176/2563 cut-off events. For 3662/3886 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 17152 event pairs, 74 based on Foata normal form. 35/2456 useless extension candidates. Maximal degree in co-relation 7484. Up to 736 conditions per place. [2023-11-29 22:59:42,504 INFO L140 encePairwiseOnDemand]: 246/249 looper letters, 69 selfloop transitions, 6 changer transitions 19/332 dead transitions. [2023-11-29 22:59:42,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 332 transitions, 1749 flow [2023-11-29 22:59:42,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 22:59:42,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 22:59:42,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2023-11-29 22:59:42,506 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9129852744310576 [2023-11-29 22:59:42,507 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 682 transitions. [2023-11-29 22:59:42,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 682 transitions. [2023-11-29 22:59:42,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:59:42,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 682 transitions. [2023-11-29 22:59:42,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states 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 22:59:42,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states 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 22:59:42,512 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states 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 22:59:42,513 INFO L307 CegarLoopForPetriNet]: 227 programPoint places, 18 predicate places. [2023-11-29 22:59:42,513 INFO L500 AbstractCegarLoop]: Abstraction has has 245 places, 332 transitions, 1749 flow [2023-11-29 22:59:42,514 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 0 states 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 22:59:42,514 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:59:42,514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:59:42,514 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 22:59:42,514 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 22:59:42,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:59:42,515 INFO L85 PathProgramCache]: Analyzing trace with hash 174856375, now seen corresponding path program 1 times [2023-11-29 22:59:42,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:59:42,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278843855] [2023-11-29 22:59:42,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:59:42,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:59:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:59:42,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 22:59:42,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:59:42,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278843855] [2023-11-29 22:59:42,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278843855] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 22:59:42,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 22:59:42,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 22:59:42,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805614177] [2023-11-29 22:59:42,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:59:42,785 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 22:59:42,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:59:42,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 22:59:42,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 22:59:42,787 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 249 [2023-11-29 22:59:42,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 332 transitions, 1749 flow. Second operand has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states 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 22:59:42,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:59:42,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 249 [2023-11-29 22:59:42,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:59:43,341 INFO L124 PetriNetUnfolderBase]: 1310/2971 cut-off events. [2023-11-29 22:59:43,342 INFO L125 PetriNetUnfolderBase]: For 6755/7087 co-relation queries the response was YES. [2023-11-29 22:59:43,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9738 conditions, 2971 events. 1310/2971 cut-off events. For 6755/7087 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 20002 event pairs, 84 based on Foata normal form. 28/2837 useless extension candidates. Maximal degree in co-relation 8200. Up to 797 conditions per place. [2023-11-29 22:59:43,370 INFO L140 encePairwiseOnDemand]: 238/249 looper letters, 99 selfloop transitions, 8 changer transitions 49/366 dead transitions. [2023-11-29 22:59:43,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 366 transitions, 2240 flow [2023-11-29 22:59:43,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 22:59:43,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 22:59:43,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1801 transitions. [2023-11-29 22:59:43,374 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8036590807675145 [2023-11-29 22:59:43,374 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1801 transitions. [2023-11-29 22:59:43,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1801 transitions. [2023-11-29 22:59:43,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:59:43,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1801 transitions. [2023-11-29 22:59:43,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 200.11111111111111) internal successors, (1801), 9 states have internal predecessors, (1801), 0 states have call successors, (0), 0 states 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 22:59:43,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 249.0) internal successors, (2490), 10 states have internal predecessors, (2490), 0 states have call successors, (0), 0 states 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 22:59:43,382 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 249.0) internal successors, (2490), 10 states have internal predecessors, (2490), 0 states have call successors, (0), 0 states 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 22:59:43,382 INFO L307 CegarLoopForPetriNet]: 227 programPoint places, 26 predicate places. [2023-11-29 22:59:43,382 INFO L500 AbstractCegarLoop]: Abstraction has has 253 places, 366 transitions, 2240 flow [2023-11-29 22:59:43,383 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states 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 22:59:43,383 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:59:43,383 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:59:43,383 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 22:59:43,384 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 22:59:43,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:59:43,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1905164292, now seen corresponding path program 1 times [2023-11-29 22:59:43,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:59:43,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700491624] [2023-11-29 22:59:43,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:59:43,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:59:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:59:43,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 22:59:43,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:59:43,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700491624] [2023-11-29 22:59:43,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700491624] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 22:59:43,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 22:59:43,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 22:59:43,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936268027] [2023-11-29 22:59:43,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:59:43,575 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 22:59:43,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:59:43,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 22:59:43,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 22:59:43,577 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 249 [2023-11-29 22:59:43,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 366 transitions, 2240 flow. Second operand has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states 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 22:59:43,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:59:43,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 249 [2023-11-29 22:59:43,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:59:44,208 INFO L124 PetriNetUnfolderBase]: 1764/4196 cut-off events. [2023-11-29 22:59:44,208 INFO L125 PetriNetUnfolderBase]: For 13502/14108 co-relation queries the response was YES. [2023-11-29 22:59:44,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14415 conditions, 4196 events. 1764/4196 cut-off events. For 13502/14108 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 30847 event pairs, 159 based on Foata normal form. 26/3951 useless extension candidates. Maximal degree in co-relation 8965. Up to 1026 conditions per place. [2023-11-29 22:59:44,252 INFO L140 encePairwiseOnDemand]: 238/249 looper letters, 103 selfloop transitions, 8 changer transitions 106/427 dead transitions. [2023-11-29 22:59:44,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 427 transitions, 3360 flow [2023-11-29 22:59:44,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 22:59:44,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 22:59:44,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1788 transitions. [2023-11-29 22:59:44,257 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7978580990629184 [2023-11-29 22:59:44,257 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1788 transitions. [2023-11-29 22:59:44,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1788 transitions. [2023-11-29 22:59:44,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:59:44,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1788 transitions. [2023-11-29 22:59:44,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 198.66666666666666) internal successors, (1788), 9 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states 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 22:59:44,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 249.0) internal successors, (2490), 10 states have internal predecessors, (2490), 0 states have call successors, (0), 0 states 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 22:59:44,264 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 249.0) internal successors, (2490), 10 states have internal predecessors, (2490), 0 states have call successors, (0), 0 states 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 22:59:44,267 INFO L307 CegarLoopForPetriNet]: 227 programPoint places, 34 predicate places. [2023-11-29 22:59:44,267 INFO L500 AbstractCegarLoop]: Abstraction has has 261 places, 427 transitions, 3360 flow [2023-11-29 22:59:44,267 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states 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 22:59:44,267 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:59:44,267 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:59:44,268 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 22:59:44,268 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 22:59:44,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:59:44,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1844495938, now seen corresponding path program 1 times [2023-11-29 22:59:44,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:59:44,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072180726] [2023-11-29 22:59:44,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:59:44,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:59:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:59:44,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 22:59:44,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:59:44,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072180726] [2023-11-29 22:59:44,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072180726] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:59:44,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432206688] [2023-11-29 22:59:44,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:59:44,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:59:44,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:59:44,484 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 22:59:44,498 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 22:59:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:59:44,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 22:59:44,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:59:44,852 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 22:59:44,852 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:59:44,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 22:59:44,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432206688] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 22:59:44,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 22:59:44,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2023-11-29 22:59:44,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322138532] [2023-11-29 22:59:44,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 22:59:44,982 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 22:59:44,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:59:44,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 22:59:44,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-29 22:59:44,985 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 249 [2023-11-29 22:59:44,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 427 transitions, 3360 flow. Second operand has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states 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 22:59:44,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:59:44,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 249 [2023-11-29 22:59:44,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:59:48,594 INFO L124 PetriNetUnfolderBase]: 10514/20708 cut-off events. [2023-11-29 22:59:48,595 INFO L125 PetriNetUnfolderBase]: For 89278/92409 co-relation queries the response was YES. [2023-11-29 22:59:48,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78153 conditions, 20708 events. 10514/20708 cut-off events. For 89278/92409 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 178577 event pairs, 768 based on Foata normal form. 66/18343 useless extension candidates. Maximal degree in co-relation 47142. Up to 4782 conditions per place. [2023-11-29 22:59:48,746 INFO L140 encePairwiseOnDemand]: 239/249 looper letters, 230 selfloop transitions, 41 changer transitions 587/1057 dead transitions. [2023-11-29 22:59:48,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 1057 transitions, 12681 flow [2023-11-29 22:59:48,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 22:59:48,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-29 22:59:48,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3119 transitions. [2023-11-29 22:59:48,753 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8947217441193345 [2023-11-29 22:59:48,753 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3119 transitions. [2023-11-29 22:59:48,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3119 transitions. [2023-11-29 22:59:48,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:59:48,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3119 transitions. [2023-11-29 22:59:48,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 222.78571428571428) internal successors, (3119), 14 states have internal predecessors, (3119), 0 states have call successors, (0), 0 states 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 22:59:48,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 249.0) internal successors, (3735), 15 states have internal predecessors, (3735), 0 states have call successors, (0), 0 states 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 22:59:48,768 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 249.0) internal successors, (3735), 15 states have internal predecessors, (3735), 0 states have call successors, (0), 0 states 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 22:59:48,768 INFO L307 CegarLoopForPetriNet]: 227 programPoint places, 47 predicate places. [2023-11-29 22:59:48,768 INFO L500 AbstractCegarLoop]: Abstraction has has 274 places, 1057 transitions, 12681 flow [2023-11-29 22:59:48,769 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 216.0) internal successors, (1728), 8 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states 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 22:59:48,769 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:59:48,769 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:59:48,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 22:59:48,977 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:59:48,977 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-29 22:59:48,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:59:48,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1490284344, now seen corresponding path program 2 times [2023-11-29 22:59:48,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:59:48,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664559882] [2023-11-29 22:59:48,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:59:48,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:59:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:59:53,531 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:59:53,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:59:53,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664559882] [2023-11-29 22:59:53,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664559882] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:59:53,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180181798] [2023-11-29 22:59:53,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 22:59:53,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:59:53,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:59:53,533 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 22:59:53,541 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 22:59:53,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 22:59:53,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 22:59:53,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 79 conjunts are in the unsatisfiable core [2023-11-29 22:59:53,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:59:57,113 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 23 treesize of output 1 [2023-11-29 22:59:58,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 22:59:58,607 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 22:59:59,117 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 22:59:59,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 22:59:59,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-29 23:00:00,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 23:00:00,266 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 22 treesize of output 22 [2023-11-29 23:00:00,450 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:00:00,450 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:00:05,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 23:00:05,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 104 [2023-11-29 23:00:05,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 23:00:05,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1807781 treesize of output 1741809 [2023-11-29 23:00:06,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 23:00:06,817 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 7011 treesize of output 6683 [2023-11-29 23:00:07,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 23:00:07,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6488 treesize of output 4944 [2023-11-29 23:00:07,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 23:00:07,405 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 5067 treesize of output 4331 [2023-11-29 23:00:07,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 23:00:07,682 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 4251 treesize of output 4127 [2023-11-29 23:04:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:04:47,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180181798] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:04:47,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:04:47,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 47, 43] total 122 [2023-11-29 23:04:47,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275706698] [2023-11-29 23:04:47,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:04:47,477 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 122 states [2023-11-29 23:04:47,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:04:47,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2023-11-29 23:04:47,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1078, Invalid=13592, Unknown=92, NotChecked=0, Total=14762 [2023-11-29 23:04:47,491 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 249 [2023-11-29 23:04:47,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 1057 transitions, 12681 flow. Second operand has 122 states, 122 states have (on average 108.62295081967213) internal successors, (13252), 122 states have internal predecessors, (13252), 0 states have call successors, (0), 0 states 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:04:47,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:04:47,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 249 [2023-11-29 23:04:47,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:06:09,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:06:30,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:06:47,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:06:49,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:06:57,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:06:59,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:07:01,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:07:29,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:07:35,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:07:37,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:08:23,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:08:44,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:08:46,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:09:05,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:09:09,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:09:29,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:09:53,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:09:55,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:10:16,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:10:23,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:10:27,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:11:24,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:11:48,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-11-29 23:12:42,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 617 states. [2023-11-29 23:12:42,554 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-29 23:12:42,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-29 23:12:42,566 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-29 23:12:42,566 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:12:42,761 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-29 23:12:42,762 WARN L624 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-53-9-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-7-1 context. [2023-11-29 23:12:42,763 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-11-29 23:12:42,763 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-29 23:12:42,763 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-29 23:12:42,763 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-11-29 23:12:42,764 INFO L457 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2023-11-29 23:12:42,767 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 23:12:42,767 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 23:12:42,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 11:12:42 BasicIcfg [2023-11-29 23:12:42,770 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 23:12:42,771 INFO L158 Benchmark]: Toolchain (without parser) took 785625.17ms. Allocated memory was 522.2MB in the beginning and 6.0GB in the end (delta: 5.5GB). Free memory was 471.2MB in the beginning and 3.4GB in the end (delta: -2.9GB). Peak memory consumption was 2.9GB. Max. memory is 16.0GB. [2023-11-29 23:12:42,771 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 352.3MB. Free memory is still 302.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-29 23:12:42,771 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.61ms. Allocated memory is still 522.2MB. Free memory was 470.8MB in the beginning and 458.3MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-29 23:12:42,771 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.71ms. Allocated memory is still 522.2MB. Free memory was 458.3MB in the beginning and 455.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 23:12:42,772 INFO L158 Benchmark]: Boogie Preprocessor took 56.65ms. Allocated memory is still 522.2MB. Free memory was 455.9MB in the beginning and 453.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 23:12:42,772 INFO L158 Benchmark]: RCFGBuilder took 576.47ms. Allocated memory is still 522.2MB. Free memory was 453.8MB in the beginning and 487.5MB in the end (delta: -33.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. [2023-11-29 23:12:42,772 INFO L158 Benchmark]: TraceAbstraction took 784707.98ms. Allocated memory was 522.2MB in the beginning and 6.0GB in the end (delta: 5.5GB). Free memory was 487.0MB in the beginning and 3.4GB in the end (delta: -2.9GB). Peak memory consumption was 3.0GB. Max. memory is 16.0GB. [2023-11-29 23:12:42,776 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.13ms. Allocated memory is still 352.3MB. Free memory is still 302.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 235.61ms. Allocated memory is still 522.2MB. Free memory was 470.8MB in the beginning and 458.3MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 43.71ms. Allocated memory is still 522.2MB. Free memory was 458.3MB in the beginning and 455.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 56.65ms. Allocated memory is still 522.2MB. Free memory was 455.9MB in the beginning and 453.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 576.47ms. Allocated memory is still 522.2MB. Free memory was 453.8MB in the beginning and 487.5MB in the end (delta: -33.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. * TraceAbstraction took 784707.98ms. Allocated memory was 522.2MB in the beginning and 6.0GB in the end (delta: 5.5GB). Free memory was 487.0MB in the beginning and 3.4GB in the end (delta: -2.9GB). Peak memory consumption was 3.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 150]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-53-9-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-7-1 context. - TimeoutResultAtElement [Line: 141]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-53-9-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-7-1 context. - TimeoutResultAtElement [Line: 140]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-53-9-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-7-1 context. - TimeoutResultAtElement [Line: 142]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-53-9-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-7-1 context. - TimeoutResultAtElement [Line: 143]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-53-9-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∧-7-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 275 locations, 5 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: 784.6s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 482.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 2459 mSolverCounterUnknown, 13827 SdHoareTripleChecker+Valid, 92.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13827 mSDsluCounter, 12999 SdHoareTripleChecker+Invalid, 88.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12664 mSDsCounter, 3094 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32425 IncrementalHoareTripleChecker+Invalid, 37978 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3094 mSolverCounterUnsat, 335 mSDtfsCounter, 32425 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 2459 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1553 GetRequests, 770 SyntacticMatches, 5 SemanticMatches, 777 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226689 ImplicationChecksByTransitivity, 336.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12681occurred in iteration=7, InterpolantAutomatonStates: 54, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 300.4s InterpolantComputationTime, 1981 NumberOfCodeBlocks, 1981 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2393 ConstructedInterpolants, 75 QuantifiedInterpolants, 27568 SizeOfPredicates, 59 NumberOfNonLiveVariables, 1026 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 20/40 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