/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -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-more-max-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:26:58,376 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:26:58,448 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-12-09 15:26:58,479 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:26:58,480 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:26:58,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:26:58,481 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:26:58,481 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:26:58,482 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:26:58,484 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:26:58,485 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:26:58,486 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:26:58,486 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:26:58,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:26:58,486 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:26:58,487 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:26:58,487 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:26:58,487 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:26:58,488 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:26:58,488 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:26:58,488 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:26:58,489 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:26:58,489 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:26:58,489 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:26:58,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:26:58,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:26:58,490 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:26:58,490 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:26:58,491 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:26:58,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:26:58,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:26:58,492 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:26:58,492 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:26:58,492 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-12-09 15:26:58,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:26:58,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:26:58,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:26:58,761 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:26:58,762 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:26:58,763 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2023-12-09 15:26:59,960 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:27:00,128 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:27:00,129 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2023-12-09 15:27:00,136 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab54fea02/6c3abcde7d144bffa4181df80c32b6b4/FLAGb46c31941 [2023-12-09 15:27:00,149 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab54fea02/6c3abcde7d144bffa4181df80c32b6b4 [2023-12-09 15:27:00,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:27:00,152 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:27:00,153 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:27:00,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:27:00,157 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:27:00,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:27:00" (1/1) ... [2023-12-09 15:27:00,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@373eefe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:00, skipping insertion in model container [2023-12-09 15:27:00,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:27:00" (1/1) ... [2023-12-09 15:27:00,192 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:27:00,367 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c[2625,2638] [2023-12-09 15:27:00,380 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:27:00,388 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:27:00,410 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c[2625,2638] [2023-12-09 15:27:00,413 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:27:00,423 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:27:00,423 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:27:00,429 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:27:00,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:00 WrapperNode [2023-12-09 15:27:00,432 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:27:00,433 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:27:00,434 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:27:00,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:27:00,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:00" (1/1) ... [2023-12-09 15:27:00,458 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:00" (1/1) ... [2023-12-09 15:27:00,486 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2023-12-09 15:27:00,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:27:00,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:27:00,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:27:00,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:27:00,497 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:00" (1/1) ... [2023-12-09 15:27:00,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:00" (1/1) ... [2023-12-09 15:27:00,499 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:00" (1/1) ... [2023-12-09 15:27:00,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:00" (1/1) ... [2023-12-09 15:27:00,505 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:00" (1/1) ... [2023-12-09 15:27:00,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:00" (1/1) ... [2023-12-09 15:27:00,515 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:00" (1/1) ... [2023-12-09 15:27:00,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:00" (1/1) ... [2023-12-09 15:27:00,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:27:00,522 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:27:00,522 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:27:00,522 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:27:00,523 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:00" (1/1) ... [2023-12-09 15:27:00,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:27:00,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:00,551 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-12-09 15:27:00,553 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-12-09 15:27:00,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:27:00,572 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:27:00,572 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:27:00,572 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:27:00,573 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:27:00,573 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-09 15:27:00,573 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-09 15:27:00,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:27:00,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:27:00,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:27:00,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-09 15:27:00,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-09 15:27:00,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-09 15:27:00,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:27:00,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:27:00,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:27:00,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:27:00,577 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-09 15:27:00,665 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:27:00,667 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:27:00,926 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:27:00,992 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:27:00,992 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-09 15:27:00,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:27:00 BoogieIcfgContainer [2023-12-09 15:27:00,994 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:27:00,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:27:00,996 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:27:00,998 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:27:00,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:27:00" (1/3) ... [2023-12-09 15:27:00,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a95ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:27:00, skipping insertion in model container [2023-12-09 15:27:00,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:00" (2/3) ... [2023-12-09 15:27:00,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a95ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:27:00, skipping insertion in model container [2023-12-09 15:27:01,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:27:00" (3/3) ... [2023-12-09 15:27:01,001 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2023-12-09 15:27:01,016 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:27:01,017 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:27:01,017 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:27:01,105 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-09 15:27:01,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 160 transitions, 341 flow [2023-12-09 15:27:01,211 INFO L124 PetriNetUnfolderBase]: 12/157 cut-off events. [2023-12-09 15:27:01,211 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:27:01,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 157 events. 12/157 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2023-12-09 15:27:01,217 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 160 transitions, 341 flow [2023-12-09 15:27:01,221 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 146 transitions, 310 flow [2023-12-09 15:27:01,240 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:27:01,247 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;@640dd57f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:27:01,247 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-09 15:27:01,298 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:27:01,299 INFO L124 PetriNetUnfolderBase]: 12/145 cut-off events. [2023-12-09 15:27:01,299 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:27:01,299 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:01,300 INFO L233 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] [2023-12-09 15:27:01,300 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 1 more)] === [2023-12-09 15:27:01,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:01,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1087243074, now seen corresponding path program 1 times [2023-12-09 15:27:01,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:01,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985780568] [2023-12-09 15:27:01,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:01,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:02,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:02,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:02,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985780568] [2023-12-09 15:27:02,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985780568] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:27:02,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:27:02,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:27:02,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113568015] [2023-12-09 15:27:02,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:27:02,221 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:27:02,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:02,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:27:02,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:27:02,250 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 160 [2023-12-09 15:27:02,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 146 transitions, 310 flow. Second operand has 8 states, 8 states have (on average 95.875) internal successors, (767), 8 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:02,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:02,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 160 [2023-12-09 15:27:02,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:02,599 INFO L124 PetriNetUnfolderBase]: 295/761 cut-off events. [2023-12-09 15:27:02,599 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2023-12-09 15:27:02,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1288 conditions, 761 events. 295/761 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3711 event pairs, 167 based on Foata normal form. 5/599 useless extension candidates. Maximal degree in co-relation 1052. Up to 416 conditions per place. [2023-12-09 15:27:02,615 INFO L140 encePairwiseOnDemand]: 140/160 looper letters, 53 selfloop transitions, 8 changer transitions 12/150 dead transitions. [2023-12-09 15:27:02,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 150 transitions, 464 flow [2023-12-09 15:27:02,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-09 15:27:02,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-09 15:27:02,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 804 transitions. [2023-12-09 15:27:02,634 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.628125 [2023-12-09 15:27:02,635 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 804 transitions. [2023-12-09 15:27:02,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 804 transitions. [2023-12-09 15:27:02,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:02,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 804 transitions. [2023-12-09 15:27:02,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 100.5) internal successors, (804), 8 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:02,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 160.0) internal successors, (1440), 9 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:02,655 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 160.0) internal successors, (1440), 9 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:02,662 INFO L308 CegarLoopForPetriNet]: 144 programPoint places, 7 predicate places. [2023-12-09 15:27:02,662 INFO L500 AbstractCegarLoop]: Abstraction has has 151 places, 150 transitions, 464 flow [2023-12-09 15:27:02,663 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.875) internal successors, (767), 8 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:02,663 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:02,664 INFO L233 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] [2023-12-09 15:27:02,664 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:27:02,664 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 1 more)] === [2023-12-09 15:27:02,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:02,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1096071011, now seen corresponding path program 1 times [2023-12-09 15:27:02,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:02,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141920471] [2023-12-09 15:27:02,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:02,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:02,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:02,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:02,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141920471] [2023-12-09 15:27:02,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141920471] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:02,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051535152] [2023-12-09 15:27:02,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:02,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:02,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:02,916 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-12-09 15:27:02,933 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-12-09 15:27:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:03,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-09 15:27:03,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:27:03,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:03,253 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:27:03,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:03,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051535152] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:03,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:27:03,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-12-09 15:27:03,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296123018] [2023-12-09 15:27:03,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:27:03,472 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:27:03,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:03,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:27:03,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-12-09 15:27:03,476 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 160 [2023-12-09 15:27:03,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 150 transitions, 464 flow. Second operand has 7 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:03,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:03,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 160 [2023-12-09 15:27:03,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:03,756 INFO L124 PetriNetUnfolderBase]: 412/950 cut-off events. [2023-12-09 15:27:03,756 INFO L125 PetriNetUnfolderBase]: For 373/440 co-relation queries the response was YES. [2023-12-09 15:27:03,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2138 conditions, 950 events. 412/950 cut-off events. For 373/440 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4764 event pairs, 188 based on Foata normal form. 11/777 useless extension candidates. Maximal degree in co-relation 1830. Up to 550 conditions per place. [2023-12-09 15:27:03,766 INFO L140 encePairwiseOnDemand]: 149/160 looper letters, 39 selfloop transitions, 7 changer transitions 12/157 dead transitions. [2023-12-09 15:27:03,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 157 transitions, 600 flow [2023-12-09 15:27:03,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-09 15:27:03,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-09 15:27:03,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 861 transitions. [2023-12-09 15:27:03,770 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.76875 [2023-12-09 15:27:03,770 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 861 transitions. [2023-12-09 15:27:03,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 861 transitions. [2023-12-09 15:27:03,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:03,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 861 transitions. [2023-12-09 15:27:03,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:03,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 160.0) internal successors, (1280), 8 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:03,775 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 160.0) internal successors, (1280), 8 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:03,776 INFO L308 CegarLoopForPetriNet]: 144 programPoint places, 13 predicate places. [2023-12-09 15:27:03,776 INFO L500 AbstractCegarLoop]: Abstraction has has 157 places, 157 transitions, 600 flow [2023-12-09 15:27:03,777 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:03,777 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:03,778 INFO L233 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] [2023-12-09 15:27:03,787 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-12-09 15:27:03,984 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:03,985 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 1 more)] === [2023-12-09 15:27:03,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:03,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1056125606, now seen corresponding path program 1 times [2023-12-09 15:27:03,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:03,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624241325] [2023-12-09 15:27:03,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:03,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:04,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:04,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:04,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624241325] [2023-12-09 15:27:04,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624241325] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:04,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796724991] [2023-12-09 15:27:04,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:04,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:04,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:04,229 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-12-09 15:27:04,249 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-12-09 15:27:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:04,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-09 15:27:04,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:27:04,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:04,478 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:27:04,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:04,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796724991] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:04,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:27:04,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 19 [2023-12-09 15:27:04,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583594719] [2023-12-09 15:27:04,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:27:04,695 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:27:04,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:04,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:27:04,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2023-12-09 15:27:04,703 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 160 [2023-12-09 15:27:04,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 157 transitions, 600 flow. Second operand has 9 states, 9 states have (on average 111.88888888888889) internal successors, (1007), 9 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:04,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:04,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 160 [2023-12-09 15:27:04,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:05,308 INFO L124 PetriNetUnfolderBase]: 1734/3206 cut-off events. [2023-12-09 15:27:05,309 INFO L125 PetriNetUnfolderBase]: For 2819/3151 co-relation queries the response was YES. [2023-12-09 15:27:05,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9349 conditions, 3206 events. 1734/3206 cut-off events. For 2819/3151 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 19734 event pairs, 320 based on Foata normal form. 41/2677 useless extension candidates. Maximal degree in co-relation 8933. Up to 1714 conditions per place. [2023-12-09 15:27:05,341 INFO L140 encePairwiseOnDemand]: 143/160 looper letters, 96 selfloop transitions, 27 changer transitions 12/226 dead transitions. [2023-12-09 15:27:05,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 226 transitions, 1216 flow [2023-12-09 15:27:05,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-09 15:27:05,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-09 15:27:05,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1183 transitions. [2023-12-09 15:27:05,344 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.739375 [2023-12-09 15:27:05,345 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1183 transitions. [2023-12-09 15:27:05,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1183 transitions. [2023-12-09 15:27:05,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:05,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1183 transitions. [2023-12-09 15:27:05,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 118.3) internal successors, (1183), 10 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:05,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 160.0) internal successors, (1760), 11 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:05,352 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 160.0) internal successors, (1760), 11 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:05,353 INFO L308 CegarLoopForPetriNet]: 144 programPoint places, 22 predicate places. [2023-12-09 15:27:05,353 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 226 transitions, 1216 flow [2023-12-09 15:27:05,356 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.88888888888889) internal successors, (1007), 9 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:05,356 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:05,356 INFO L233 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] [2023-12-09 15:27:05,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-09 15:27:05,561 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,SelfDestructingSolverStorable2 [2023-12-09 15:27:05,562 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 1 more)] === [2023-12-09 15:27:05,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:05,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1861703146, now seen corresponding path program 2 times [2023-12-09 15:27:05,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:05,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184775885] [2023-12-09 15:27:05,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:05,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:05,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:05,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:05,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184775885] [2023-12-09 15:27:05,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184775885] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:05,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340282230] [2023-12-09 15:27:05,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:27:05,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:05,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:05,793 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:27:05,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-09 15:27:05,910 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:27:05,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:27:05,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-09 15:27:05,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:27:06,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:06,049 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:27:06,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:06,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340282230] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:06,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:27:06,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2023-12-09 15:27:06,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803560622] [2023-12-09 15:27:06,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:27:06,223 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:27:06,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:06,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:27:06,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2023-12-09 15:27:06,226 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 160 [2023-12-09 15:27:06,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 226 transitions, 1216 flow. Second operand has 9 states, 9 states have (on average 111.88888888888889) internal successors, (1007), 9 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:06,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:06,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 160 [2023-12-09 15:27:06,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:07,243 INFO L124 PetriNetUnfolderBase]: 3070/5428 cut-off events. [2023-12-09 15:27:07,244 INFO L125 PetriNetUnfolderBase]: For 6400/7414 co-relation queries the response was YES. [2023-12-09 15:27:07,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20448 conditions, 5428 events. 3070/5428 cut-off events. For 6400/7414 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 36309 event pairs, 391 based on Foata normal form. 126/4576 useless extension candidates. Maximal degree in co-relation 19825. Up to 3018 conditions per place. [2023-12-09 15:27:07,308 INFO L140 encePairwiseOnDemand]: 145/160 looper letters, 251 selfloop transitions, 55 changer transitions 12/409 dead transitions. [2023-12-09 15:27:07,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 409 transitions, 3249 flow [2023-12-09 15:27:07,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-09 15:27:07,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-12-09 15:27:07,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1532 transitions. [2023-12-09 15:27:07,313 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7365384615384616 [2023-12-09 15:27:07,313 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1532 transitions. [2023-12-09 15:27:07,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1532 transitions. [2023-12-09 15:27:07,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:07,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1532 transitions. [2023-12-09 15:27:07,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 117.84615384615384) internal successors, (1532), 13 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:07,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 160.0) internal successors, (2240), 14 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:07,322 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 160.0) internal successors, (2240), 14 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:07,323 INFO L308 CegarLoopForPetriNet]: 144 programPoint places, 34 predicate places. [2023-12-09 15:27:07,323 INFO L500 AbstractCegarLoop]: Abstraction has has 178 places, 409 transitions, 3249 flow [2023-12-09 15:27:07,323 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.88888888888889) internal successors, (1007), 9 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:07,323 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:07,323 INFO L233 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] [2023-12-09 15:27:07,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-09 15:27:07,530 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:07,530 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 1 more)] === [2023-12-09 15:27:07,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:07,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1949570920, now seen corresponding path program 3 times [2023-12-09 15:27:07,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:07,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856806216] [2023-12-09 15:27:07,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:07,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:07,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:07,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:07,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856806216] [2023-12-09 15:27:07,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856806216] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:07,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402142776] [2023-12-09 15:27:07,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-09 15:27:07,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:07,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:07,744 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:27:07,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-09 15:27:07,859 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-09 15:27:07,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:27:07,860 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-09 15:27:07,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:27:07,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:07,984 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:27:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:08,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402142776] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:27:08,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:27:08,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2023-12-09 15:27:08,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417041734] [2023-12-09 15:27:08,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:27:08,163 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-09 15:27:08,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:08,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-09 15:27:08,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2023-12-09 15:27:08,167 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 160 [2023-12-09 15:27:08,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 409 transitions, 3249 flow. Second operand has 18 states, 18 states have (on average 111.05555555555556) internal successors, (1999), 18 states have internal predecessors, (1999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:08,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:08,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 160 [2023-12-09 15:27:08,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:09,666 INFO L124 PetriNetUnfolderBase]: 3758/7080 cut-off events. [2023-12-09 15:27:09,666 INFO L125 PetriNetUnfolderBase]: For 7471/9589 co-relation queries the response was YES. [2023-12-09 15:27:09,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31046 conditions, 7080 events. 3758/7080 cut-off events. For 7471/9589 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 52746 event pairs, 421 based on Foata normal form. 77/6141 useless extension candidates. Maximal degree in co-relation 27529. Up to 3557 conditions per place. [2023-12-09 15:27:09,758 INFO L140 encePairwiseOnDemand]: 143/160 looper letters, 516 selfloop transitions, 112 changer transitions 12/731 dead transitions. [2023-12-09 15:27:09,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 731 transitions, 7599 flow [2023-12-09 15:27:09,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-09 15:27:09,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-12-09 15:27:09,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2320 transitions. [2023-12-09 15:27:09,764 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.725 [2023-12-09 15:27:09,764 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2320 transitions. [2023-12-09 15:27:09,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2320 transitions. [2023-12-09 15:27:09,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:09,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2320 transitions. [2023-12-09 15:27:09,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 116.0) internal successors, (2320), 20 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:09,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 160.0) internal successors, (3360), 21 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:09,779 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 160.0) internal successors, (3360), 21 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:09,781 INFO L308 CegarLoopForPetriNet]: 144 programPoint places, 53 predicate places. [2023-12-09 15:27:09,781 INFO L500 AbstractCegarLoop]: Abstraction has has 197 places, 731 transitions, 7599 flow [2023-12-09 15:27:09,782 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 111.05555555555556) internal successors, (1999), 18 states have internal predecessors, (1999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:09,782 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:09,782 INFO L233 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] [2023-12-09 15:27:09,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-09 15:27:09,989 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:09,989 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 1 more)] === [2023-12-09 15:27:09,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:09,990 INFO L85 PathProgramCache]: Analyzing trace with hash 147853648, now seen corresponding path program 4 times [2023-12-09 15:27:09,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:09,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049220687] [2023-12-09 15:27:09,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:09,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:10,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:10,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:10,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049220687] [2023-12-09 15:27:10,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049220687] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:10,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145286812] [2023-12-09 15:27:10,236 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-09 15:27:10,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:10,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:10,238 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:27:10,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-09 15:27:10,338 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-09 15:27:10,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:27:10,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-09 15:27:10,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:27:10,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:10,471 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:27:10,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:10,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145286812] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:10,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:27:10,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 19 [2023-12-09 15:27:10,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012435363] [2023-12-09 15:27:10,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:27:10,676 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:27:10,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:10,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:27:10,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-12-09 15:27:10,678 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 160 [2023-12-09 15:27:10,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 731 transitions, 7599 flow. Second operand has 9 states, 9 states have (on average 111.88888888888889) internal successors, (1007), 9 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:10,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:10,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 160 [2023-12-09 15:27:10,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:12,128 INFO L124 PetriNetUnfolderBase]: 3740/7019 cut-off events. [2023-12-09 15:27:12,129 INFO L125 PetriNetUnfolderBase]: For 11931/14653 co-relation queries the response was YES. [2023-12-09 15:27:12,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36202 conditions, 7019 events. 3740/7019 cut-off events. For 11931/14653 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 52298 event pairs, 348 based on Foata normal form. 292/6287 useless extension candidates. Maximal degree in co-relation 35256. Up to 3545 conditions per place. [2023-12-09 15:27:12,221 INFO L140 encePairwiseOnDemand]: 142/160 looper letters, 515 selfloop transitions, 115 changer transitions 12/733 dead transitions. [2023-12-09 15:27:12,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 733 transitions, 8892 flow [2023-12-09 15:27:12,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-09 15:27:12,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-09 15:27:12,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1310 transitions. [2023-12-09 15:27:12,225 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7443181818181818 [2023-12-09 15:27:12,225 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1310 transitions. [2023-12-09 15:27:12,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1310 transitions. [2023-12-09 15:27:12,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:12,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1310 transitions. [2023-12-09 15:27:12,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 119.0909090909091) internal successors, (1310), 11 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:12,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 160.0) internal successors, (1920), 12 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:12,232 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 160.0) internal successors, (1920), 12 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:12,234 INFO L308 CegarLoopForPetriNet]: 144 programPoint places, 63 predicate places. [2023-12-09 15:27:12,234 INFO L500 AbstractCegarLoop]: Abstraction has has 207 places, 733 transitions, 8892 flow [2023-12-09 15:27:12,234 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.88888888888889) internal successors, (1007), 9 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:12,234 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:12,235 INFO L233 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] [2023-12-09 15:27:12,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-09 15:27:12,444 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:12,444 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 1 more)] === [2023-12-09 15:27:12,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:12,445 INFO L85 PathProgramCache]: Analyzing trace with hash -963035946, now seen corresponding path program 5 times [2023-12-09 15:27:12,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:12,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898456974] [2023-12-09 15:27:12,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:12,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:12,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:12,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:12,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898456974] [2023-12-09 15:27:12,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898456974] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:12,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243784089] [2023-12-09 15:27:12,708 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-09 15:27:12,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:12,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:12,710 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:27:12,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-09 15:27:12,818 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:27:12,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:27:12,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-09 15:27:12,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:27:12,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:12,897 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:27:12,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:12,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243784089] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:27:12,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:27:12,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 17 [2023-12-09 15:27:12,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084380847] [2023-12-09 15:27:12,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:27:12,979 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-09 15:27:12,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:12,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-09 15:27:12,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2023-12-09 15:27:12,984 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 160 [2023-12-09 15:27:12,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 733 transitions, 8892 flow. Second operand has 17 states, 17 states have (on average 108.11764705882354) internal successors, (1838), 17 states have internal predecessors, (1838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:12,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:12,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 160 [2023-12-09 15:27:12,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:15,661 INFO L124 PetriNetUnfolderBase]: 7586/13325 cut-off events. [2023-12-09 15:27:15,662 INFO L125 PetriNetUnfolderBase]: For 15884/19470 co-relation queries the response was YES. [2023-12-09 15:27:15,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75805 conditions, 13325 events. 7586/13325 cut-off events. For 15884/19470 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 101692 event pairs, 302 based on Foata normal form. 120/12072 useless extension candidates. Maximal degree in co-relation 69077. Up to 5770 conditions per place. [2023-12-09 15:27:15,846 INFO L140 encePairwiseOnDemand]: 138/160 looper letters, 982 selfloop transitions, 335 changer transitions 12/1416 dead transitions. [2023-12-09 15:27:15,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 1416 transitions, 19818 flow [2023-12-09 15:27:15,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-09 15:27:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-12-09 15:27:15,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3017 transitions. [2023-12-09 15:27:15,854 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7252403846153846 [2023-12-09 15:27:15,854 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 3017 transitions. [2023-12-09 15:27:15,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 3017 transitions. [2023-12-09 15:27:15,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:15,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 3017 transitions. [2023-12-09 15:27:15,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 116.03846153846153) internal successors, (3017), 26 states have internal predecessors, (3017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:15,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 160.0) internal successors, (4320), 27 states have internal predecessors, (4320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:15,870 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 160.0) internal successors, (4320), 27 states have internal predecessors, (4320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:15,871 INFO L308 CegarLoopForPetriNet]: 144 programPoint places, 88 predicate places. [2023-12-09 15:27:15,871 INFO L500 AbstractCegarLoop]: Abstraction has has 232 places, 1416 transitions, 19818 flow [2023-12-09 15:27:15,871 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 108.11764705882354) internal successors, (1838), 17 states have internal predecessors, (1838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:15,872 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:15,872 INFO L233 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] [2023-12-09 15:27:15,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-09 15:27:16,076 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:16,077 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 1 more)] === [2023-12-09 15:27:16,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:16,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1834185562, now seen corresponding path program 6 times [2023-12-09 15:27:16,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:16,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611584047] [2023-12-09 15:27:16,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:16,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:16,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:16,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:16,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611584047] [2023-12-09 15:27:16,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611584047] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:16,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803166463] [2023-12-09 15:27:16,276 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-09 15:27:16,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:16,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:16,277 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:27:16,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-09 15:27:16,388 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-12-09 15:27:16,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:27:16,390 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-09 15:27:16,392 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:27:16,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:27:16,606 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-09 15:27:16,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803166463] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:27:16,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-09 15:27:16,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2023-12-09 15:27:16,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079819756] [2023-12-09 15:27:16,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:27:16,608 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:27:16,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:16,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:27:16,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2023-12-09 15:27:16,609 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 160 [2023-12-09 15:27:16,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 1416 transitions, 19818 flow. Second operand has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:16,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:16,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 160 [2023-12-09 15:27:16,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:18,762 INFO L124 PetriNetUnfolderBase]: 6359/10969 cut-off events. [2023-12-09 15:27:18,762 INFO L125 PetriNetUnfolderBase]: For 19956/23342 co-relation queries the response was YES. [2023-12-09 15:27:18,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69670 conditions, 10969 events. 6359/10969 cut-off events. For 19956/23342 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 78956 event pairs, 311 based on Foata normal form. 36/9994 useless extension candidates. Maximal degree in co-relation 63419. Up to 4885 conditions per place. [2023-12-09 15:27:18,880 INFO L140 encePairwiseOnDemand]: 151/160 looper letters, 725 selfloop transitions, 103 changer transitions 12/1078 dead transitions. [2023-12-09 15:27:18,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 1078 transitions, 16376 flow [2023-12-09 15:27:18,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-09 15:27:18,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-09 15:27:18,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 854 transitions. [2023-12-09 15:27:18,884 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6671875 [2023-12-09 15:27:18,885 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 854 transitions. [2023-12-09 15:27:18,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 854 transitions. [2023-12-09 15:27:18,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:18,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 854 transitions. [2023-12-09 15:27:18,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 106.75) internal successors, (854), 8 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:18,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 160.0) internal successors, (1440), 9 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:18,890 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 160.0) internal successors, (1440), 9 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:18,893 INFO L308 CegarLoopForPetriNet]: 144 programPoint places, 89 predicate places. [2023-12-09 15:27:18,893 INFO L500 AbstractCegarLoop]: Abstraction has has 233 places, 1078 transitions, 16376 flow [2023-12-09 15:27:18,893 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:18,893 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:18,893 INFO L233 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] [2023-12-09 15:27:18,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-09 15:27:19,100 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:19,101 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:27:19,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:19,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1949756477, now seen corresponding path program 1 times [2023-12-09 15:27:19,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:19,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943527349] [2023-12-09 15:27:19,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:19,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:21,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:21,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:21,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943527349] [2023-12-09 15:27:21,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943527349] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:21,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980925052] [2023-12-09 15:27:21,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:21,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:21,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:21,032 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:27:21,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-09 15:27:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:21,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-09 15:27:21,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:27:21,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-09 15:27:21,529 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-09 15:27:21,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-09 15:27:22,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-12-09 15:27:22,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:22,861 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 67 treesize of output 39 [2023-12-09 15:27:23,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:23,436 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:27:24,635 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~max3~0 1)) (.cse3 (= c_~max1~0 c_~max2~0)) (.cse2 (+ c_~max2~0 1))) (and (forall ((~M~0 Int) (v_ArrVal_272 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_272) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse0 .cse1) (= c_~max1~0 .cse0) (< .cse0 .cse2) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)))) (or .cse3 (forall ((~M~0 Int) (v_ArrVal_272 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_272) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse4 .cse1) (< c_~max2~0 .cse4) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0))))) (or (forall ((~M~0 Int) (v_ArrVal_272 (Array Int Int))) (or (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_272) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0))) (and (or .cse3 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (< c_~max3~0 .cse2)))))) is different from false [2023-12-09 15:27:25,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:25,499 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 282 treesize of output 258 [2023-12-09 15:27:25,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 176 [2023-12-09 15:27:25,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 158 [2023-12-09 15:27:25,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 146 [2023-12-09 15:27:32,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:32,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980925052] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:27:32,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:27:32,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 26] total 69 [2023-12-09 15:27:32,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704961683] [2023-12-09 15:27:32,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:27:32,835 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2023-12-09 15:27:32,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:32,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2023-12-09 15:27:32,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=4062, Unknown=4, NotChecked=132, Total=4692 [2023-12-09 15:27:32,841 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 160 [2023-12-09 15:27:32,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 1078 transitions, 16376 flow. Second operand has 69 states, 69 states have (on average 49.42028985507246) internal successors, (3410), 69 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:32,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:32,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 160 [2023-12-09 15:27:32,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:46,928 INFO L124 PetriNetUnfolderBase]: 26737/41649 cut-off events. [2023-12-09 15:27:46,928 INFO L125 PetriNetUnfolderBase]: For 112833/113198 co-relation queries the response was YES. [2023-12-09 15:27:47,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275100 conditions, 41649 events. 26737/41649 cut-off events. For 112833/113198 co-relation queries the response was YES. Maximal size of possible extension queue 1841. Compared 333827 event pairs, 1200 based on Foata normal form. 45/38236 useless extension candidates. Maximal degree in co-relation 245826. Up to 19688 conditions per place. [2023-12-09 15:27:47,475 INFO L140 encePairwiseOnDemand]: 115/160 looper letters, 2845 selfloop transitions, 1298 changer transitions 42/4223 dead transitions. [2023-12-09 15:27:47,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 4223 transitions, 72692 flow [2023-12-09 15:27:47,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-12-09 15:27:47,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2023-12-09 15:27:47,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 3837 transitions. [2023-12-09 15:27:47,484 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.34755434782608696 [2023-12-09 15:27:47,484 INFO L72 ComplementDD]: Start complementDD. Operand 69 states and 3837 transitions. [2023-12-09 15:27:47,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 3837 transitions. [2023-12-09 15:27:47,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:47,485 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 69 states and 3837 transitions. [2023-12-09 15:27:47,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 70 states, 69 states have (on average 55.608695652173914) internal successors, (3837), 69 states have internal predecessors, (3837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:47,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 70 states, 70 states have (on average 160.0) internal successors, (11200), 70 states have internal predecessors, (11200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:47,509 INFO L81 ComplementDD]: Finished complementDD. Result has 70 states, 70 states have (on average 160.0) internal successors, (11200), 70 states have internal predecessors, (11200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:47,510 INFO L308 CegarLoopForPetriNet]: 144 programPoint places, 157 predicate places. [2023-12-09 15:27:47,510 INFO L500 AbstractCegarLoop]: Abstraction has has 301 places, 4223 transitions, 72692 flow [2023-12-09 15:27:47,511 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 49.42028985507246) internal successors, (3410), 69 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:47,511 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:47,511 INFO L233 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] [2023-12-09 15:27:47,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-09 15:27:47,717 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-12-09 15:27:47,718 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:27:47,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:47,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1474234531, now seen corresponding path program 2 times [2023-12-09 15:27:47,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:47,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871672183] [2023-12-09 15:27:47,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:47,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:49,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:49,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871672183] [2023-12-09 15:27:49,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871672183] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:49,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791117173] [2023-12-09 15:27:49,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:27:49,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:49,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:49,048 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:27:49,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-09 15:27:49,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:27:49,162 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:27:49,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-09 15:27:49,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:27:49,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-09 15:27:50,353 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-12-09 15:27:50,436 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-12-09 15:27:50,518 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-12-09 15:27:50,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:50,919 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 67 treesize of output 39 [2023-12-09 15:27:51,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:51,480 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:28:01,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:28:01,077 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 129 treesize of output 93 [2023-12-09 15:28:01,098 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:28:01,098 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 2421 treesize of output 2317 [2023-12-09 15:28:01,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:28:01,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 257 treesize of output 245 [2023-12-09 15:28:01,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:28:01,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 237 treesize of output 205 [2023-12-09 15:28:01,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:28:01,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 273 treesize of output 201 [2023-12-09 15:28:02,105 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-09 15:28:02,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 156 treesize of output 1 [2023-12-09 15:28:02,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:28:02,116 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 61 treesize of output 49 [2023-12-09 15:28:02,127 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-09 15:28:02,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1083 treesize of output 1039 [2023-12-09 15:28:02,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:28:02,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 119 [2023-12-09 15:28:02,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:28:02,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 111 [2023-12-09 15:28:02,199 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-09 15:28:02,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 113 [2023-12-09 15:28:02,228 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-09 15:28:02,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-12-09 15:28:02,237 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-09 15:28:02,237 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 95 treesize of output 1 [2023-12-09 15:28:02,244 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-09 15:28:02,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 1 [2023-12-09 15:28:02,255 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-09 15:28:02,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 1 [2023-12-09 15:28:03,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:28:03,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791117173] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:28:03,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:28:03,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 32, 26] total 74 [2023-12-09 15:28:03,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677654319] [2023-12-09 15:28:03,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:28:03,134 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2023-12-09 15:28:03,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:28:03,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2023-12-09 15:28:03,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=893, Invalid=4415, Unknown=94, NotChecked=0, Total=5402 [2023-12-09 15:28:03,140 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 160 [2023-12-09 15:28:03,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 4223 transitions, 72692 flow. Second operand has 74 states, 74 states have (on average 49.310810810810814) internal successors, (3649), 74 states have internal predecessors, (3649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:28:03,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:28:03,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 160 [2023-12-09 15:28:03,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:28:32,526 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-12-09 15:28:42,351 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-12-09 15:29:05,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:29:37,622 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_~max2~0 1))) (let ((.cse3 (= c_~max1~0 c_~max2~0)) (.cse11 (< c_~max2~0 c_~max3~0)) (.cse2 (= c_~max1~0 c_~max3~0)) (.cse12 (< c_~max3~0 .cse6)) (.cse7 (+ c_~max3~0 1)) (.cse9 (select |c_#memory_int| c_~A~0.base))) (let ((.cse14 (forall ((~M~0 Int)) (let ((.cse49 (select .cse9 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< c_~max2~0 .cse49) (< .cse49 .cse7) (< (+ ~M~0 1) c_~N~0))))) (.cse1 (and (or .cse3 .cse11) (or .cse2 .cse12))) (.cse13 (forall ((~M~0 Int)) (or (< c_~max3~0 (select .cse9 (+ c_~A~0.offset (* ~M~0 4)))) (< 0 ~M~0) (< (+ ~M~0 1) c_~N~0))))) (let ((.cse8 (select .cse9 c_~A~0.offset)) (.cse21 (and (or .cse3 .cse14) (or .cse1 .cse13) (forall ((~M~0 Int)) (let ((.cse48 (select .cse9 (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~max1~0 .cse48) (< 0 ~M~0) (< .cse48 .cse6) (< .cse48 .cse7) (< (+ ~M~0 1) c_~N~0)))))) (.cse22 (select .cse9 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (.cse15 (+ c_~max1~0 1))) (and (or (forall ((v_ArrVal_308 (Array Int Int)) (~M~0 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (or (< c_~max3~0 (select .cse0 (+ c_~A~0.offset (* ~M~0 4)))) (< 0 ~M~0) (< c_~max1~0 (select .cse0 c_~A~0.offset)) (< (+ ~M~0 1) c_~N~0)))) .cse1) (or (< c_thread3Thread1of1ForFork1_~i~2 c_~N~0) (and .cse2 (<= 1 c_~max3~0) (= c_~max2~0 0)) (and .cse2 .cse3)) (or (forall ((v_ArrVal_308 (Array Int Int)) (~M~0 Int) (v_ArrVal_307 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (or (< 0 ~M~0) (< c_~max1~0 (select .cse4 c_~A~0.offset)) (< c_~max3~0 (select .cse4 (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0)))) .cse1) (or (let ((.cse10 (= .cse8 c_~max2~0))) (and (forall ((~M~0 Int)) (let ((.cse5 (select .cse9 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< .cse5 .cse6) (< .cse5 .cse7) (= .cse8 .cse5) (< (+ ~M~0 1) c_~N~0)))) (or (and (or .cse10 .cse11) (or (= .cse8 c_~max3~0) .cse12)) .cse13) (or .cse10 .cse14))) (< .cse8 .cse15)) (forall ((v_ArrVal_308 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (or (forall ((~M~0 Int)) (let ((.cse16 (select .cse17 (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse16 .cse6) (< .cse16 .cse7) (< 0 ~M~0) (= .cse16 c_~max1~0) (< (+ ~M~0 1) c_~N~0)))) (< c_~max1~0 (select .cse17 c_~A~0.offset))))) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse19 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse20 (select .cse19 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse18 (select .cse19 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< .cse18 .cse7) (< c_~max2~0 .cse18) (< (+ ~M~0 1) c_~N~0)))) (= .cse20 c_~max2~0) (< .cse20 .cse15))))) (or (< c_thread2Thread1of1ForFork0_~i~1 c_~M~0) .cse1) (or (< c_~max1~0 .cse8) .cse21) (or (< c_~max1~0 .cse22) .cse21) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse25 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse24 (select .cse25 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse23 (select .cse25 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (= .cse23 .cse24) (< .cse23 .cse7) (< .cse23 .cse6) (< (+ ~M~0 1) c_~N~0)))) (< .cse24 .cse15))))) (or (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (~M~0 Int)) (let ((.cse27 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse26 (select .cse27 c_~A~0.offset))) (or (< 0 ~M~0) (= .cse26 c_~max2~0) (< c_~max3~0 (select .cse27 (+ c_~A~0.offset (* ~M~0 4)))) (< .cse26 .cse15) (< (+ ~M~0 1) c_~N~0))))) .cse11) (forall ((v_ArrVal_308 (Array Int Int))) (let ((.cse30 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse29 (select .cse30 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse28 (select .cse30 (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse28 .cse6) (< .cse28 .cse7) (< 0 ~M~0) (= .cse28 .cse29) (< (+ ~M~0 1) c_~N~0)))) (< .cse29 .cse15))))) (or (forall ((v_ArrVal_308 (Array Int Int)) (~M~0 Int)) (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse31 (select .cse32 (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse31 .cse7) (< 0 ~M~0) (< c_~max2~0 .cse31) (< c_~max1~0 (select .cse32 c_~A~0.offset)) (< (+ ~M~0 1) c_~N~0))))) .cse3) (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse34 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (or (forall ((~M~0 Int)) (let ((.cse33 (select .cse34 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (= .cse33 c_~max1~0) (< .cse33 .cse7) (< .cse33 .cse6) (< (+ ~M~0 1) c_~N~0)))) (< c_~max1~0 (select .cse34 c_~A~0.offset))))) (or (forall ((v_ArrVal_308 (Array Int Int)) (~M~0 Int)) (let ((.cse35 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse36 (select .cse35 c_~A~0.offset))) (or (< c_~max3~0 (select .cse35 (+ c_~A~0.offset (* ~M~0 4)))) (< 0 ~M~0) (< .cse36 .cse15) (= .cse36 c_~max3~0) (< (+ ~M~0 1) c_~N~0))))) .cse12) (or (let ((.cse38 (= .cse22 c_~max2~0))) (and (forall ((~M~0 Int)) (let ((.cse37 (select .cse9 (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse22 .cse37) (< 0 ~M~0) (< .cse37 .cse6) (< .cse37 .cse7) (< (+ ~M~0 1) c_~N~0)))) (or (and (or .cse12 (= .cse22 c_~max3~0)) (or .cse11 .cse38)) .cse13) (or .cse14 .cse38))) (< .cse22 .cse15)) (or (forall ((v_ArrVal_308 (Array Int Int)) (v_ArrVal_307 (Array Int Int)) (~M~0 Int)) (let ((.cse40 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse39 (select .cse40 c_~A~0.offset))) (or (< 0 ~M~0) (= .cse39 c_~max3~0) (< c_~max3~0 (select .cse40 (+ c_~A~0.offset (* ~M~0 4)))) (< .cse39 .cse15) (< (+ ~M~0 1) c_~N~0))))) .cse12) (or .cse3 (forall ((v_ArrVal_308 (Array Int Int)) (~M~0 Int) (v_ArrVal_307 (Array Int Int))) (let ((.cse42 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse41 (select .cse42 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< .cse41 .cse7) (< c_~max1~0 (select .cse42 c_~A~0.offset)) (< c_~max2~0 .cse41) (< (+ ~M~0 1) c_~N~0)))))) (or (forall ((v_ArrVal_308 (Array Int Int)) (~M~0 Int)) (let ((.cse43 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse44 (select .cse43 c_~A~0.offset))) (or (< c_~max3~0 (select .cse43 (+ c_~A~0.offset (* ~M~0 4)))) (= .cse44 c_~max2~0) (< 0 ~M~0) (< .cse44 .cse15) (< (+ ~M~0 1) c_~N~0))))) .cse11) (forall ((v_ArrVal_308 (Array Int Int))) (let ((.cse47 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_308) c_~A~0.base))) (let ((.cse45 (select .cse47 c_~A~0.offset))) (or (= .cse45 c_~max2~0) (< .cse45 .cse15) (forall ((~M~0 Int)) (let ((.cse46 (select .cse47 (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse46 .cse7) (< 0 ~M~0) (< c_~max2~0 .cse46) (< (+ ~M~0 1) c_~N~0))))))))))))) is different from false [2023-12-09 15:30:19,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:30:21,484 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-12-09 15:30:39,572 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-12-09 15:30:46,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:30:48,642 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-12-09 15:30:52,791 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-12-09 15:30:54,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-12-09 15:31:12,618 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-09 15:31:12,618 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-12-09 15:31:12,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2023-12-09 15:31:12,626 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-12-09 15:31:12,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-09 15:31:12,826 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-09 15:31:12,826 WARN L624 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 229 known predicates. [2023-12-09 15:31:12,828 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-12-09 15:31:12,828 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-12-09 15:31:12,828 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-12-09 15:31:12,829 INFO L457 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1] [2023-12-09 15:31:12,831 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-09 15:31:12,832 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-09 15:31:12,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:31:12 BasicIcfg [2023-12-09 15:31:12,835 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-09 15:31:12,835 INFO L158 Benchmark]: Toolchain (without parser) took 252683.07ms. Allocated memory was 209.7MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 164.9MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-12-09 15:31:12,835 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 209.7MB. Free memory is still 168.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-09 15:31:12,835 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.32ms. Allocated memory is still 209.7MB. Free memory was 164.9MB in the beginning and 152.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-09 15:31:12,836 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.60ms. Allocated memory is still 209.7MB. Free memory was 152.3MB in the beginning and 150.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 15:31:12,836 INFO L158 Benchmark]: Boogie Preprocessor took 33.23ms. Allocated memory is still 209.7MB. Free memory was 150.6MB in the beginning and 148.8MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-09 15:31:12,836 INFO L158 Benchmark]: RCFGBuilder took 471.67ms. Allocated memory is still 209.7MB. Free memory was 148.8MB in the beginning and 126.5MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-12-09 15:31:12,836 INFO L158 Benchmark]: TraceAbstraction took 251839.14ms. Allocated memory was 209.7MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 125.8MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2023-12-09 15:31:12,837 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.15ms. Allocated memory is still 209.7MB. Free memory is still 168.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 279.32ms. Allocated memory is still 209.7MB. Free memory was 164.9MB in the beginning and 152.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.60ms. Allocated memory is still 209.7MB. Free memory was 152.3MB in the beginning and 150.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.23ms. Allocated memory is still 209.7MB. Free memory was 150.6MB in the beginning and 148.8MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 471.67ms. Allocated memory is still 209.7MB. Free memory was 148.8MB in the beginning and 126.5MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 251839.14ms. Allocated memory was 209.7MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 125.8MB in the beginning and 1.6GB in the end (delta: -1.4GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 229 known predicates. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 229 known predicates. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 229 known predicates. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 229 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 185 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 251.7s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 215.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 683 mSolverCounterUnknown, 4608 SdHoareTripleChecker+Valid, 66.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4608 mSDsluCounter, 10056 SdHoareTripleChecker+Invalid, 64.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1004 IncrementalHoareTripleChecker+Unchecked, 9450 mSDsCounter, 268 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17460 IncrementalHoareTripleChecker+Invalid, 19415 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 268 mSolverCounterUnsat, 606 mSDtfsCounter, 17460 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 683 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2527 GetRequests, 1977 SyntacticMatches, 17 SemanticMatches, 532 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 25900 ImplicationChecksByTransitivity, 132.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72692occurred in iteration=9, InterpolantAutomatonStates: 172, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 33.0s InterpolantComputationTime, 2353 NumberOfCodeBlocks, 2330 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3323 ConstructedInterpolants, 95 QuantifiedInterpolants, 47017 SizeOfPredicates, 114 NumberOfNonLiveVariables, 2669 ConjunctsInSsa, 148 ConjunctsInUnsatCore, 27 InterpolantComputations, 6 PerfectInterpolantSequences, 21/55 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