/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/parallel-min-max-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:17:26,658 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:17:26,721 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:17:26,750 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:17:26,751 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:17:26,751 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:17:26,751 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:17:26,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:17:26,752 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:17:26,755 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:17:26,755 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:17:26,755 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:17:26,756 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:17:26,757 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:17:26,757 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:17:26,757 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:17:26,757 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:17:26,757 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:17:26,757 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:17:26,757 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:17:26,758 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:17:26,758 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:17:26,758 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:17:26,758 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:17:26,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:17:26,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:17:26,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:17:26,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:17:26,759 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:17:26,759 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:17:26,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:17:26,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:17:26,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:17:26,760 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:17:26,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:17:26,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:17:26,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:17:26,961 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:17:26,961 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:17:26,962 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c [2023-12-09 15:17:27,940 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:17:28,123 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:17:28,123 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c [2023-12-09 15:17:28,130 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48689b2fc/13762abfb5c941e2b66fb37c821fe0fa/FLAG0d77f1721 [2023-12-09 15:17:28,143 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48689b2fc/13762abfb5c941e2b66fb37c821fe0fa [2023-12-09 15:17:28,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:17:28,146 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:17:28,148 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:17:28,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:17:28,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:17:28,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:17:28" (1/1) ... [2023-12-09 15:17:28,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67ee4ce4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:17:28, skipping insertion in model container [2023-12-09 15:17:28,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:17:28" (1/1) ... [2023-12-09 15:17:28,176 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:17:28,279 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/parallel-min-max-1.wvr.c[3096,3109] [2023-12-09 15:17:28,285 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:17:28,296 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:17:28,312 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/parallel-min-max-1.wvr.c[3096,3109] [2023-12-09 15:17:28,314 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:17:28,319 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:17:28,319 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:17:28,324 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:17:28,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:17:28 WrapperNode [2023-12-09 15:17:28,324 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:17:28,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:17:28,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:17:28,326 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:17:28,330 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:17:28" (1/1) ... [2023-12-09 15:17:28,336 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:17:28" (1/1) ... [2023-12-09 15:17:28,350 INFO L138 Inliner]: procedures = 25, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2023-12-09 15:17:28,350 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:17:28,351 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:17:28,351 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:17:28,351 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:17:28,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:17:28" (1/1) ... [2023-12-09 15:17:28,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:17:28" (1/1) ... [2023-12-09 15:17:28,359 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:17:28" (1/1) ... [2023-12-09 15:17:28,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:17:28" (1/1) ... [2023-12-09 15:17:28,365 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:17:28" (1/1) ... [2023-12-09 15:17:28,372 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:17:28" (1/1) ... [2023-12-09 15:17:28,373 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:17:28" (1/1) ... [2023-12-09 15:17:28,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:17:28" (1/1) ... [2023-12-09 15:17:28,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:17:28,377 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:17:28,377 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:17:28,377 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:17:28,377 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:17:28" (1/1) ... [2023-12-09 15:17:28,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:17:28,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:17:28,429 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:17:28,448 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:17:28,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:17:28,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:17:28,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:17:28,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:17:28,456 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:17:28,456 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:17:28,457 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:17:28,457 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:17:28,457 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-09 15:17:28,457 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-09 15:17:28,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:17:28,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-09 15:17:28,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-09 15:17:28,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-09 15:17:28,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:17:28,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:17:28,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:17:28,460 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:17:28,569 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:17:28,570 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:17:28,846 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:17:28,890 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:17:28,890 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-09 15:17:28,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:17:28 BoogieIcfgContainer [2023-12-09 15:17:28,892 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:17:28,893 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:17:28,893 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:17:28,895 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:17:28,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:17:28" (1/3) ... [2023-12-09 15:17:28,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33f16af9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:17:28, skipping insertion in model container [2023-12-09 15:17:28,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:17:28" (2/3) ... [2023-12-09 15:17:28,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33f16af9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:17:28, skipping insertion in model container [2023-12-09 15:17:28,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:17:28" (3/3) ... [2023-12-09 15:17:28,897 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-min-max-1.wvr.c [2023-12-09 15:17:28,912 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:17:28,912 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:17:28,912 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:17:28,954 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-09 15:17:28,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 185 transitions, 391 flow [2023-12-09 15:17:29,037 INFO L124 PetriNetUnfolderBase]: 12/182 cut-off events. [2023-12-09 15:17:29,037 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:17:29,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 182 events. 12/182 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 124 event pairs, 0 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2023-12-09 15:17:29,042 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 185 transitions, 391 flow [2023-12-09 15:17:29,046 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 171 transitions, 360 flow [2023-12-09 15:17:29,053 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:17:29,058 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;@55b4c9fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:17:29,058 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-09 15:17:29,085 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:17:29,085 INFO L124 PetriNetUnfolderBase]: 12/170 cut-off events. [2023-12-09 15:17:29,085 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:17:29,085 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:17:29,086 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:17:29,086 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:17:29,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:17:29,090 INFO L85 PathProgramCache]: Analyzing trace with hash -2031779403, now seen corresponding path program 1 times [2023-12-09 15:17:29,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:17:29,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464585759] [2023-12-09 15:17:29,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:17:29,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:17:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:17:29,613 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:17:29,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:17:29,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464585759] [2023-12-09 15:17:29,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464585759] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:17:29,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:17:29,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:17:29,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435096886] [2023-12-09 15:17:29,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:17:29,621 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:17:29,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:17:29,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:17:29,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:17:29,649 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 185 [2023-12-09 15:17:29,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 171 transitions, 360 flow. Second operand has 5 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 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:17:29,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:17:29,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 185 [2023-12-09 15:17:29,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:17:29,828 INFO L124 PetriNetUnfolderBase]: 31/283 cut-off events. [2023-12-09 15:17:29,828 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-12-09 15:17:29,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 283 events. 31/283 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 754 event pairs, 20 based on Foata normal form. 20/279 useless extension candidates. Maximal degree in co-relation 249. Up to 82 conditions per place. [2023-12-09 15:17:29,834 INFO L140 encePairwiseOnDemand]: 168/185 looper letters, 45 selfloop transitions, 0 changer transitions 10/167 dead transitions. [2023-12-09 15:17:29,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 167 transitions, 462 flow [2023-12-09 15:17:29,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-09 15:17:29,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-12-09 15:17:29,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 809 transitions. [2023-12-09 15:17:29,850 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7288288288288288 [2023-12-09 15:17:29,851 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 809 transitions. [2023-12-09 15:17:29,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 809 transitions. [2023-12-09 15:17:29,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:17:29,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 809 transitions. [2023-12-09 15:17:29,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.83333333333334) internal successors, (809), 6 states have internal predecessors, (809), 0 states have call successors, (0), 0 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:17:29,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 185.0) internal successors, (1295), 7 states have internal predecessors, (1295), 0 states have call successors, (0), 0 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:17:29,865 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 185.0) internal successors, (1295), 7 states have internal predecessors, (1295), 0 states have call successors, (0), 0 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:17:29,870 INFO L308 CegarLoopForPetriNet]: 169 programPoint places, 5 predicate places. [2023-12-09 15:17:29,870 INFO L500 AbstractCegarLoop]: Abstraction has has 174 places, 167 transitions, 462 flow [2023-12-09 15:17:29,871 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 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:17:29,871 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:17:29,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:17:29,872 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:17:29,872 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:17:29,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:17:29,873 INFO L85 PathProgramCache]: Analyzing trace with hash 244998717, now seen corresponding path program 1 times [2023-12-09 15:17:29,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:17:29,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329082377] [2023-12-09 15:17:29,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:17:29,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:17:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:17:30,289 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:17:30,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:17:30,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329082377] [2023-12-09 15:17:30,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329082377] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:17:30,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:17:30,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:17:30,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955274871] [2023-12-09 15:17:30,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:17:30,293 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:17:30,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:17:30,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:17:30,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:17:30,296 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 185 [2023-12-09 15:17:30,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 167 transitions, 462 flow. Second operand has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 0 states have call successors, (0), 0 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:17:30,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:17:30,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 185 [2023-12-09 15:17:30,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:17:31,164 INFO L124 PetriNetUnfolderBase]: 630/2294 cut-off events. [2023-12-09 15:17:31,164 INFO L125 PetriNetUnfolderBase]: For 871/1012 co-relation queries the response was YES. [2023-12-09 15:17:31,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4213 conditions, 2294 events. 630/2294 cut-off events. For 871/1012 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 18143 event pairs, 144 based on Foata normal form. 1/2117 useless extension candidates. Maximal degree in co-relation 2857. Up to 596 conditions per place. [2023-12-09 15:17:31,183 INFO L140 encePairwiseOnDemand]: 166/185 looper letters, 131 selfloop transitions, 17 changer transitions 101/339 dead transitions. [2023-12-09 15:17:31,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 339 transitions, 1642 flow [2023-12-09 15:17:31,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-09 15:17:31,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-12-09 15:17:31,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3370 transitions. [2023-12-09 15:17:31,189 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6072072072072072 [2023-12-09 15:17:31,189 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 3370 transitions. [2023-12-09 15:17:31,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 3370 transitions. [2023-12-09 15:17:31,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:17:31,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 3370 transitions. [2023-12-09 15:17:31,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 112.33333333333333) internal successors, (3370), 30 states have internal predecessors, (3370), 0 states have call successors, (0), 0 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:17:31,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 185.0) internal successors, (5735), 31 states have internal predecessors, (5735), 0 states have call successors, (0), 0 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:17:31,207 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 185.0) internal successors, (5735), 31 states have internal predecessors, (5735), 0 states have call successors, (0), 0 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:17:31,208 INFO L308 CegarLoopForPetriNet]: 169 programPoint places, 34 predicate places. [2023-12-09 15:17:31,208 INFO L500 AbstractCegarLoop]: Abstraction has has 203 places, 339 transitions, 1642 flow [2023-12-09 15:17:31,208 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 0 states have call successors, (0), 0 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:17:31,209 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:17:31,209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:17:31,209 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:17:31,210 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:17:31,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:17:31,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1614175823, now seen corresponding path program 2 times [2023-12-09 15:17:31,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:17:31,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549680054] [2023-12-09 15:17:31,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:17:31,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:17:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:17:31,910 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:17:31,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:17:31,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549680054] [2023-12-09 15:17:31,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549680054] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:17:31,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:17:31,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-09 15:17:31,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169958423] [2023-12-09 15:17:31,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:17:31,911 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-09 15:17:31,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:17:31,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-09 15:17:31,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2023-12-09 15:17:31,913 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 185 [2023-12-09 15:17:31,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 339 transitions, 1642 flow. Second operand has 16 states, 16 states have (on average 89.875) internal successors, (1438), 16 states have internal predecessors, (1438), 0 states have call successors, (0), 0 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:17:31,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:17:31,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 185 [2023-12-09 15:17:31,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:17:33,565 INFO L124 PetriNetUnfolderBase]: 827/3172 cut-off events. [2023-12-09 15:17:33,565 INFO L125 PetriNetUnfolderBase]: For 2120/2581 co-relation queries the response was YES. [2023-12-09 15:17:33,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7404 conditions, 3172 events. 827/3172 cut-off events. For 2120/2581 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 28178 event pairs, 97 based on Foata normal form. 113/3062 useless extension candidates. Maximal degree in co-relation 4578. Up to 828 conditions per place. [2023-12-09 15:17:33,579 INFO L140 encePairwiseOnDemand]: 158/185 looper letters, 207 selfloop transitions, 30 changer transitions 202/515 dead transitions. [2023-12-09 15:17:33,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 515 transitions, 3589 flow [2023-12-09 15:17:33,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-12-09 15:17:33,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-12-09 15:17:33,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 3550 transitions. [2023-12-09 15:17:33,585 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.49203049203049204 [2023-12-09 15:17:33,585 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 3550 transitions. [2023-12-09 15:17:33,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 3550 transitions. [2023-12-09 15:17:33,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:17:33,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 3550 transitions. [2023-12-09 15:17:33,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 91.02564102564102) internal successors, (3550), 39 states have internal predecessors, (3550), 0 states have call successors, (0), 0 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:17:33,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 185.0) internal successors, (7400), 40 states have internal predecessors, (7400), 0 states have call successors, (0), 0 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:17:33,607 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 185.0) internal successors, (7400), 40 states have internal predecessors, (7400), 0 states have call successors, (0), 0 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:17:33,608 INFO L308 CegarLoopForPetriNet]: 169 programPoint places, 72 predicate places. [2023-12-09 15:17:33,608 INFO L500 AbstractCegarLoop]: Abstraction has has 241 places, 515 transitions, 3589 flow [2023-12-09 15:17:33,608 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 89.875) internal successors, (1438), 16 states have internal predecessors, (1438), 0 states have call successors, (0), 0 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:17:33,608 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:17:33,609 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:17:33,609 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:17:33,609 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:17:33,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:17:33,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1540689005, now seen corresponding path program 3 times [2023-12-09 15:17:33,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:17:33,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398619878] [2023-12-09 15:17:33,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:17:33,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:17:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:17:33,764 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:17:33,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:17:33,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398619878] [2023-12-09 15:17:33,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398619878] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:17:33,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:17:33,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:17:33,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652470974] [2023-12-09 15:17:33,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:17:33,768 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:17:33,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:17:33,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:17:33,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:17:33,770 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 185 [2023-12-09 15:17:33,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 515 transitions, 3589 flow. Second operand has 8 states, 8 states have (on average 118.375) internal successors, (947), 8 states have internal predecessors, (947), 0 states have call successors, (0), 0 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:17:33,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:17:33,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 185 [2023-12-09 15:17:33,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:17:34,549 INFO L124 PetriNetUnfolderBase]: 1994/6051 cut-off events. [2023-12-09 15:17:34,549 INFO L125 PetriNetUnfolderBase]: For 7081/7583 co-relation queries the response was YES. [2023-12-09 15:17:34,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15985 conditions, 6051 events. 1994/6051 cut-off events. For 7081/7583 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 60273 event pairs, 662 based on Foata normal form. 10/5343 useless extension candidates. Maximal degree in co-relation 12557. Up to 2544 conditions per place. [2023-12-09 15:17:34,586 INFO L140 encePairwiseOnDemand]: 175/185 looper letters, 159 selfloop transitions, 9 changer transitions 190/519 dead transitions. [2023-12-09 15:17:34,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 519 transitions, 4215 flow [2023-12-09 15:17:34,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-09 15:17:34,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-09 15:17:34,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 965 transitions. [2023-12-09 15:17:34,588 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.652027027027027 [2023-12-09 15:17:34,589 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 965 transitions. [2023-12-09 15:17:34,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 965 transitions. [2023-12-09 15:17:34,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:17:34,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 965 transitions. [2023-12-09 15:17:34,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.625) internal successors, (965), 8 states have internal predecessors, (965), 0 states have call successors, (0), 0 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:17:34,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 185.0) internal successors, (1665), 9 states have internal predecessors, (1665), 0 states have call successors, (0), 0 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:17:34,594 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 185.0) internal successors, (1665), 9 states have internal predecessors, (1665), 0 states have call successors, (0), 0 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:17:34,595 INFO L308 CegarLoopForPetriNet]: 169 programPoint places, 79 predicate places. [2023-12-09 15:17:34,596 INFO L500 AbstractCegarLoop]: Abstraction has has 248 places, 519 transitions, 4215 flow [2023-12-09 15:17:34,596 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 118.375) internal successors, (947), 8 states have internal predecessors, (947), 0 states have call successors, (0), 0 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:17:34,596 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:17:34,596 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:17:34,596 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 15:17:34,597 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:17:34,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:17:34,597 INFO L85 PathProgramCache]: Analyzing trace with hash -188494668, now seen corresponding path program 1 times [2023-12-09 15:17:34,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:17:34,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684952719] [2023-12-09 15:17:34,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:17:34,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:17:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:17:34,710 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:17:34,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:17:34,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684952719] [2023-12-09 15:17:34,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684952719] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:17:34,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313779633] [2023-12-09 15:17:34,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:17:34,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:17:34,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:17:34,713 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:17:34,742 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:17:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:17:34,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-09 15:17:34,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:17:34,998 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:17:34,999 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:17:35,153 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:17:35,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313779633] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:17:35,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:17:35,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-12-09 15:17:35,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424966451] [2023-12-09 15:17:35,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:17:35,154 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:17:35,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:17:35,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:17:35,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-12-09 15:17:35,156 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 185 [2023-12-09 15:17:35,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 519 transitions, 4215 flow. Second operand has 7 states, 7 states have (on average 144.28571428571428) internal successors, (1010), 7 states have internal predecessors, (1010), 0 states have call successors, (0), 0 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:17:35,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:17:35,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 185 [2023-12-09 15:17:35,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:17:36,160 INFO L124 PetriNetUnfolderBase]: 2842/7131 cut-off events. [2023-12-09 15:17:36,160 INFO L125 PetriNetUnfolderBase]: For 16118/17598 co-relation queries the response was YES. [2023-12-09 15:17:36,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23585 conditions, 7131 events. 2842/7131 cut-off events. For 16118/17598 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 67675 event pairs, 647 based on Foata normal form. 94/6310 useless extension candidates. Maximal degree in co-relation 19468. Up to 3379 conditions per place. [2023-12-09 15:17:36,207 INFO L140 encePairwiseOnDemand]: 177/185 looper letters, 117 selfloop transitions, 7 changer transitions 197/539 dead transitions. [2023-12-09 15:17:36,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 539 transitions, 4931 flow [2023-12-09 15:17:36,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-09 15:17:36,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-09 15:17:36,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1025 transitions. [2023-12-09 15:17:36,210 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7915057915057915 [2023-12-09 15:17:36,210 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1025 transitions. [2023-12-09 15:17:36,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1025 transitions. [2023-12-09 15:17:36,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:17:36,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1025 transitions. [2023-12-09 15:17:36,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 146.42857142857142) internal successors, (1025), 7 states have internal predecessors, (1025), 0 states have call successors, (0), 0 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:17:36,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 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:17:36,216 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 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:17:36,220 INFO L308 CegarLoopForPetriNet]: 169 programPoint places, 77 predicate places. [2023-12-09 15:17:36,220 INFO L500 AbstractCegarLoop]: Abstraction has has 246 places, 539 transitions, 4931 flow [2023-12-09 15:17:36,221 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 144.28571428571428) internal successors, (1010), 7 states have internal predecessors, (1010), 0 states have call successors, (0), 0 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:17:36,221 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:17:36,221 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, 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:17:36,229 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:17:36,426 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:17:36,429 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:17:36,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:17:36,429 INFO L85 PathProgramCache]: Analyzing trace with hash -865742142, now seen corresponding path program 1 times [2023-12-09 15:17:36,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:17:36,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692726035] [2023-12-09 15:17:36,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:17:36,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:17:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:17:36,606 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:17:36,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:17:36,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692726035] [2023-12-09 15:17:36,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692726035] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:17:36,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648780628] [2023-12-09 15:17:36,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:17:36,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:17:36,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:17:36,616 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:17:36,621 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:17:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:17:36,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-09 15:17:36,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:17:36,830 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:17:36,830 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:17:36,968 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:17:36,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648780628] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:17:36,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:17:36,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-12-09 15:17:36,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36738174] [2023-12-09 15:17:36,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:17:36,972 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:17:36,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:17:36,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:17:36,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-12-09 15:17:36,973 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 185 [2023-12-09 15:17:36,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 539 transitions, 4931 flow. Second operand has 7 states, 7 states have (on average 144.57142857142858) internal successors, (1012), 7 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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:17:36,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:17:36,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 185 [2023-12-09 15:17:36,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:17:38,011 INFO L124 PetriNetUnfolderBase]: 3102/7152 cut-off events. [2023-12-09 15:17:38,012 INFO L125 PetriNetUnfolderBase]: For 22603/25052 co-relation queries the response was YES. [2023-12-09 15:17:38,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27321 conditions, 7152 events. 3102/7152 cut-off events. For 22603/25052 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 63197 event pairs, 557 based on Foata normal form. 201/6624 useless extension candidates. Maximal degree in co-relation 24779. Up to 3345 conditions per place. [2023-12-09 15:17:38,045 INFO L140 encePairwiseOnDemand]: 177/185 looper letters, 127 selfloop transitions, 8 changer transitions 154/461 dead transitions. [2023-12-09 15:17:38,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 461 transitions, 4589 flow [2023-12-09 15:17:38,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-09 15:17:38,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-09 15:17:38,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1025 transitions. [2023-12-09 15:17:38,047 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7915057915057915 [2023-12-09 15:17:38,047 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1025 transitions. [2023-12-09 15:17:38,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1025 transitions. [2023-12-09 15:17:38,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:17:38,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1025 transitions. [2023-12-09 15:17:38,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 146.42857142857142) internal successors, (1025), 7 states have internal predecessors, (1025), 0 states have call successors, (0), 0 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:17:38,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 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:17:38,051 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 185.0) internal successors, (1480), 8 states have internal predecessors, (1480), 0 states have call successors, (0), 0 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:17:38,051 INFO L308 CegarLoopForPetriNet]: 169 programPoint places, 71 predicate places. [2023-12-09 15:17:38,051 INFO L500 AbstractCegarLoop]: Abstraction has has 240 places, 461 transitions, 4589 flow [2023-12-09 15:17:38,052 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 144.57142857142858) internal successors, (1012), 7 states have internal predecessors, (1012), 0 states have call successors, (0), 0 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:17:38,052 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:17:38,052 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, 1, 1, 1, 1, 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:17:38,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-09 15:17:38,257 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,SelfDestructingSolverStorable5 [2023-12-09 15:17:38,258 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:17:38,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:17:38,258 INFO L85 PathProgramCache]: Analyzing trace with hash 491669360, now seen corresponding path program 1 times [2023-12-09 15:17:38,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:17:38,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642382729] [2023-12-09 15:17:38,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:17:38,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:17:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:17:39,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:17:39,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:17:39,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642382729] [2023-12-09 15:17:39,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642382729] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:17:39,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429231147] [2023-12-09 15:17:39,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:17:39,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:17:39,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:17:39,072 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:17:39,104 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:17:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:17:39,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-09 15:17:39,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:17:39,531 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:17:39,682 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:17:39,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:17:39,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:17:39,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-09 15:17:39,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-09 15:17:40,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:17:40,041 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:17:42,528 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~A~0.base))) (let ((.cse2 (select .cse0 c_~A~0.offset))) (and (forall ((thread1Thread1of1ForFork2_~i~0 Int) (v_ArrVal_156 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_156) c_~A~0.base) c_~A~0.offset))) (or (< (select .cse0 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))) (+ .cse1 2)) (< .cse2 (+ .cse1 1))))) (forall ((thread1Thread1of1ForFork2_~i~0 Int) (v_ArrVal_156 (Array Int Int))) (let ((.cse3 (select .cse0 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (< .cse3 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_156) c_~A~0.base) c_~A~0.offset) 1)) (< .cse2 .cse3))))))) is different from false [2023-12-09 15:17:42,558 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((thread1Thread1of1ForFork2_~i~0 Int) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_156 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_155))) (let ((.cse0 (select .cse2 c_~A~0.base)) (.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_156) c_~A~0.base) c_~A~0.offset))) (or (< (select .cse0 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))) (+ .cse1 2)) (< (select .cse0 c_~A~0.offset) (+ .cse1 1)))))) (forall ((thread1Thread1of1ForFork2_~i~0 Int) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_156 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_155))) (let ((.cse3 (select .cse5 c_~A~0.base))) (let ((.cse4 (select .cse3 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (< (select .cse3 c_~A~0.offset) .cse4) (< .cse4 (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_156) c_~A~0.base) c_~A~0.offset) 1)))))))) is different from false [2023-12-09 15:17:42,693 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((thread1Thread1of1ForFork2_~i~0 Int) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_154 (Array Int Int)) (v_ArrVal_156 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_154) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_155))) (let ((.cse0 (select .cse2 c_~A~0.base)) (.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_156) c_~A~0.base) c_~A~0.offset))) (or (< (select .cse0 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))) (+ 2 .cse1)) (< (select .cse0 c_~A~0.offset) (+ .cse1 1)))))) (forall ((thread1Thread1of1ForFork2_~i~0 Int) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_154 (Array Int Int)) (v_ArrVal_156 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_154) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_155))) (let ((.cse5 (select .cse4 c_~A~0.base))) (let ((.cse3 (select .cse5 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (< .cse3 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_156) c_~A~0.base) c_~A~0.offset) 1)) (< (select .cse5 c_~A~0.offset) .cse3))))))) is different from false [2023-12-09 15:17:43,200 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((thread1Thread1of1ForFork2_~i~0 Int) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_154 (Array Int Int)) (v_ArrVal_156 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_154) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_155))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_156) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse1 1)) (< (select .cse0 (+ (* thread1Thread1of1ForFork2_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ .cse1 2)))))) (forall ((thread1Thread1of1ForFork2_~i~0 Int) (v_ArrVal_155 (Array Int Int)) (v_ArrVal_154 (Array Int Int)) (v_ArrVal_156 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_154) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_155))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse3 (select .cse5 (+ (* thread1Thread1of1ForFork2_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse3 (+ (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_156) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1)) (< (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse3))))))) is different from false [2023-12-09 15:17:43,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:17:43,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 73 [2023-12-09 15:17:43,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:17:43,334 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 5291 treesize of output 4819 [2023-12-09 15:17:43,365 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:17:43,366 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 131 treesize of output 123 [2023-12-09 15:17:43,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:17:43,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 61 [2023-12-09 15:17:43,388 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 107 treesize of output 91 [2023-12-09 15:17:43,542 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-09 15:17:43,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 1 [2023-12-09 15:17:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-09 15:17:43,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429231147] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:17:43,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:17:43,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 20] total 48 [2023-12-09 15:17:43,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336790049] [2023-12-09 15:17:43,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:17:43,699 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-09 15:17:43,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:17:43,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-09 15:17:43,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1704, Unknown=37, NotChecked=348, Total=2256 [2023-12-09 15:17:43,704 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 185 [2023-12-09 15:17:43,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 461 transitions, 4589 flow. Second operand has 48 states, 48 states have (on average 76.02083333333333) internal successors, (3649), 48 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:17:43,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:17:43,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 185 [2023-12-09 15:17:43,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:17:51,604 INFO L124 PetriNetUnfolderBase]: 17314/34407 cut-off events. [2023-12-09 15:17:51,604 INFO L125 PetriNetUnfolderBase]: For 85246/86147 co-relation queries the response was YES. [2023-12-09 15:17:51,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138866 conditions, 34407 events. 17314/34407 cut-off events. For 85246/86147 co-relation queries the response was YES. Maximal size of possible extension queue 1629. Compared 355364 event pairs, 370 based on Foata normal form. 116/32125 useless extension candidates. Maximal degree in co-relation 131774. Up to 11401 conditions per place. [2023-12-09 15:17:51,769 INFO L140 encePairwiseOnDemand]: 155/185 looper letters, 624 selfloop transitions, 93 changer transitions 951/1743 dead transitions. [2023-12-09 15:17:51,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 1743 transitions, 21203 flow [2023-12-09 15:17:51,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-12-09 15:17:51,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2023-12-09 15:17:51,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 4356 transitions. [2023-12-09 15:17:51,776 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.436036036036036 [2023-12-09 15:17:51,776 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 4356 transitions. [2023-12-09 15:17:51,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 4356 transitions. [2023-12-09 15:17:51,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:17:51,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 4356 transitions. [2023-12-09 15:17:51,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 55 states, 54 states have (on average 80.66666666666667) internal successors, (4356), 54 states have internal predecessors, (4356), 0 states have call successors, (0), 0 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:17:51,793 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 55 states, 55 states have (on average 185.0) internal successors, (10175), 55 states have internal predecessors, (10175), 0 states have call successors, (0), 0 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:17:51,795 INFO L81 ComplementDD]: Finished complementDD. Result has 55 states, 55 states have (on average 185.0) internal successors, (10175), 55 states have internal predecessors, (10175), 0 states have call successors, (0), 0 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:17:51,796 INFO L308 CegarLoopForPetriNet]: 169 programPoint places, 124 predicate places. [2023-12-09 15:17:51,796 INFO L500 AbstractCegarLoop]: Abstraction has has 293 places, 1743 transitions, 21203 flow [2023-12-09 15:17:51,797 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 76.02083333333333) internal successors, (3649), 48 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:17:51,797 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:17:51,797 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, 1, 1, 1, 1, 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:17:51,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-09 15:17:52,004 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:17:52,004 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:17:52,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:17:52,005 INFO L85 PathProgramCache]: Analyzing trace with hash -232015370, now seen corresponding path program 2 times [2023-12-09 15:17:52,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:17:52,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555913848] [2023-12-09 15:17:52,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:17:52,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:17:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:17:52,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-09 15:17:52,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:17:52,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555913848] [2023-12-09 15:17:52,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555913848] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:17:52,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:17:52,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:17:52,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999719836] [2023-12-09 15:17:52,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:17:52,272 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:17:52,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:17:52,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:17:52,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:17:52,274 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 185 [2023-12-09 15:17:52,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 1743 transitions, 21203 flow. Second operand has 8 states, 8 states have (on average 130.75) internal successors, (1046), 8 states have internal predecessors, (1046), 0 states have call successors, (0), 0 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:17:52,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:17:52,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 185 [2023-12-09 15:17:52,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:18:00,887 INFO L124 PetriNetUnfolderBase]: 23418/47215 cut-off events. [2023-12-09 15:18:00,888 INFO L125 PetriNetUnfolderBase]: For 150786/152032 co-relation queries the response was YES. [2023-12-09 15:18:01,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201400 conditions, 47215 events. 23418/47215 cut-off events. For 150786/152032 co-relation queries the response was YES. Maximal size of possible extension queue 2175. Compared 515435 event pairs, 633 based on Foata normal form. 119/43893 useless extension candidates. Maximal degree in co-relation 179167. Up to 16114 conditions per place. [2023-12-09 15:18:01,214 INFO L140 encePairwiseOnDemand]: 170/185 looper letters, 387 selfloop transitions, 7 changer transitions 1656/2435 dead transitions. [2023-12-09 15:18:01,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 2435 transitions, 35504 flow [2023-12-09 15:18:01,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-09 15:18:01,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-12-09 15:18:01,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1571 transitions. [2023-12-09 15:18:01,217 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7076576576576576 [2023-12-09 15:18:01,217 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1571 transitions. [2023-12-09 15:18:01,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1571 transitions. [2023-12-09 15:18:01,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:18:01,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1571 transitions. [2023-12-09 15:18:01,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 130.91666666666666) internal successors, (1571), 12 states have internal predecessors, (1571), 0 states have call successors, (0), 0 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:18:01,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 185.0) internal successors, (2405), 13 states have internal predecessors, (2405), 0 states have call successors, (0), 0 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:18:01,222 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 185.0) internal successors, (2405), 13 states have internal predecessors, (2405), 0 states have call successors, (0), 0 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:18:01,223 INFO L308 CegarLoopForPetriNet]: 169 programPoint places, 135 predicate places. [2023-12-09 15:18:01,223 INFO L500 AbstractCegarLoop]: Abstraction has has 304 places, 2435 transitions, 35504 flow [2023-12-09 15:18:01,224 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 130.75) internal successors, (1046), 8 states have internal predecessors, (1046), 0 states have call successors, (0), 0 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:18:01,224 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:18:01,224 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, 1, 1, 1, 1, 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:18:01,224 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-09 15:18:01,224 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:18:01,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:18:01,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1542482746, now seen corresponding path program 3 times [2023-12-09 15:18:01,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:18:01,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561938914] [2023-12-09 15:18:01,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:18:01,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:18:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:18:01,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:18:01,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:18:01,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561938914] [2023-12-09 15:18:01,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561938914] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:18:01,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343438942] [2023-12-09 15:18:01,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-09 15:18:01,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:18:01,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:18:01,597 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:18:01,600 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:18:01,724 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-09 15:18:01,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:18:01,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-09 15:18:01,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:18:02,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:18:02,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-09 15:18:02,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-09 15:18:02,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:18:02,477 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:18:02,660 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_205 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_205) c_~A~0.base) c_~A~0.offset) (+ c_~max~0 1))) (= (mod c_~b2~0 256) 0)) is different from false [2023-12-09 15:18:02,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:18:02,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343438942] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:18:02,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:18:02,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 22, 10] total 33 [2023-12-09 15:18:02,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324078924] [2023-12-09 15:18:02,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:18:02,754 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-09 15:18:02,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:18:02,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-09 15:18:02,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=869, Unknown=3, NotChecked=60, Total=1056 [2023-12-09 15:18:02,757 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 185 [2023-12-09 15:18:02,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 2435 transitions, 35504 flow. Second operand has 33 states, 33 states have (on average 88.48484848484848) internal successors, (2920), 33 states have internal predecessors, (2920), 0 states have call successors, (0), 0 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:18:02,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:18:02,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 185 [2023-12-09 15:18:02,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:18:32,353 INFO L124 PetriNetUnfolderBase]: 55361/111879 cut-off events. [2023-12-09 15:18:32,353 INFO L125 PetriNetUnfolderBase]: For 487319/491496 co-relation queries the response was YES. [2023-12-09 15:18:32,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518238 conditions, 111879 events. 55361/111879 cut-off events. For 487319/491496 co-relation queries the response was YES. Maximal size of possible extension queue 5466. Compared 1372423 event pairs, 1462 based on Foata normal form. 489/103823 useless extension candidates. Maximal degree in co-relation 452120. Up to 38774 conditions per place. [2023-12-09 15:18:33,054 INFO L140 encePairwiseOnDemand]: 134/185 looper letters, 183 selfloop transitions, 57 changer transitions 6051/6459 dead transitions. [2023-12-09 15:18:33,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 6459 transitions, 111032 flow [2023-12-09 15:18:33,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-12-09 15:18:33,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2023-12-09 15:18:33,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 6000 transitions. [2023-12-09 15:18:33,061 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4700352526439483 [2023-12-09 15:18:33,061 INFO L72 ComplementDD]: Start complementDD. Operand 69 states and 6000 transitions. [2023-12-09 15:18:33,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 6000 transitions. [2023-12-09 15:18:33,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:18:33,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 69 states and 6000 transitions. [2023-12-09 15:18:33,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 70 states, 69 states have (on average 86.95652173913044) internal successors, (6000), 69 states have internal predecessors, (6000), 0 states have call successors, (0), 0 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:18:33,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 70 states, 70 states have (on average 185.0) internal successors, (12950), 70 states have internal predecessors, (12950), 0 states have call successors, (0), 0 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:18:33,083 INFO L81 ComplementDD]: Finished complementDD. Result has 70 states, 70 states have (on average 185.0) internal successors, (12950), 70 states have internal predecessors, (12950), 0 states have call successors, (0), 0 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:18:33,083 INFO L308 CegarLoopForPetriNet]: 169 programPoint places, 203 predicate places. [2023-12-09 15:18:33,083 INFO L500 AbstractCegarLoop]: Abstraction has has 372 places, 6459 transitions, 111032 flow [2023-12-09 15:18:33,084 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 88.48484848484848) internal successors, (2920), 33 states have internal predecessors, (2920), 0 states have call successors, (0), 0 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:18:33,084 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:18:33,084 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, 1, 1, 1, 1, 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:18:33,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-09 15:18:33,289 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:18:33,290 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:18:33,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:18:33,290 INFO L85 PathProgramCache]: Analyzing trace with hash -792203778, now seen corresponding path program 4 times [2023-12-09 15:18:33,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:18:33,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477160821] [2023-12-09 15:18:33,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:18:33,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:18:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:18:34,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:18:34,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:18:34,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477160821] [2023-12-09 15:18:34,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477160821] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:18:34,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120053441] [2023-12-09 15:18:34,009 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-09 15:18:34,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:18:34,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:18:34,013 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:18:34,029 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:18:34,164 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-09 15:18:34,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:18:34,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-09 15:18:34,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:18:34,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:18:34,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-09 15:18:34,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-09 15:18:34,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:18:34,701 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:18:37,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-12-09 15:18:37,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:18:37,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120053441] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:18:37,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:18:37,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 41 [2023-12-09 15:18:37,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037169356] [2023-12-09 15:18:37,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:18:37,270 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-09 15:18:37,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:18:37,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-09 15:18:37,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1478, Unknown=6, NotChecked=0, Total=1640 [2023-12-09 15:18:37,273 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 185 [2023-12-09 15:18:37,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 6459 transitions, 111032 flow. Second operand has 41 states, 41 states have (on average 81.26829268292683) internal successors, (3332), 41 states have internal predecessors, (3332), 0 states have call successors, (0), 0 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:18:37,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:18:37,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 185 [2023-12-09 15:18:37,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand