/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.fix-rcfgbuilder-lbe-0ccecc1-m [2023-11-10 12:25:50,749 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-10 12:25:50,806 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-10 12:25:50,835 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-10 12:25:50,835 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-10 12:25:50,835 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-10 12:25:50,836 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-10 12:25:50,836 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-10 12:25:50,836 INFO L153 SettingsManager]: * Use SBE=true [2023-11-10 12:25:50,837 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-10 12:25:50,837 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-10 12:25:50,837 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-10 12:25:50,837 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-10 12:25:50,837 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-10 12:25:50,838 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-10 12:25:50,838 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-10 12:25:50,838 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-10 12:25:50,838 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-10 12:25:50,839 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-10 12:25:50,839 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-10 12:25:50,839 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-10 12:25:50,843 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-10 12:25:50,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-10 12:25:50,843 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-10 12:25:50,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-10 12:25:50,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 12:25:50,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-10 12:25:50,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-10 12:25:50,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-10 12:25:50,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-10 12:25:50,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-10 12:25:50,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-10 12:25:50,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-10 12:25:50,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-10 12:25:51,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-10 12:25:51,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-10 12:25:51,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-10 12:25:51,051 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-10 12:25:51,052 INFO L274 PluginConnector]: CDTParser initialized [2023-11-10 12:25:51,053 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2023-11-10 12:25:52,136 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-10 12:25:52,331 INFO L384 CDTParser]: Found 1 translation units. [2023-11-10 12:25:52,331 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2023-11-10 12:25:52,336 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/684bf79a4/aa5265e0612347739ce37e286b5d6930/FLAG6325b45fb [2023-11-10 12:25:52,345 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/684bf79a4/aa5265e0612347739ce37e286b5d6930 [2023-11-10 12:25:52,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-10 12:25:52,348 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-10 12:25:52,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-10 12:25:52,349 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-10 12:25:52,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-10 12:25:52,353 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:25:52" (1/1) ... [2023-11-10 12:25:52,353 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b099e23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:52, skipping insertion in model container [2023-11-10 12:25:52,355 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:25:52" (1/1) ... [2023-11-10 12:25:52,372 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-10 12:25:52,474 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c[2412,2425] [2023-11-10 12:25:52,487 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 12:25:52,494 INFO L202 MainTranslator]: Completed pre-run [2023-11-10 12:25:52,517 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c[2412,2425] [2023-11-10 12:25:52,520 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 12:25:52,533 INFO L206 MainTranslator]: Completed translation [2023-11-10 12:25:52,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:52 WrapperNode [2023-11-10 12:25:52,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-10 12:25:52,537 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-10 12:25:52,537 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-10 12:25:52,537 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-10 12:25:52,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:52" (1/1) ... [2023-11-10 12:25:52,557 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:52" (1/1) ... [2023-11-10 12:25:52,580 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 280 [2023-11-10 12:25:52,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-10 12:25:52,581 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-10 12:25:52,581 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-10 12:25:52,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-10 12:25:52,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:52" (1/1) ... [2023-11-10 12:25:52,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:52" (1/1) ... [2023-11-10 12:25:52,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:52" (1/1) ... [2023-11-10 12:25:52,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:52" (1/1) ... [2023-11-10 12:25:52,601 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:52" (1/1) ... [2023-11-10 12:25:52,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:52" (1/1) ... [2023-11-10 12:25:52,610 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:52" (1/1) ... [2023-11-10 12:25:52,611 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:52" (1/1) ... [2023-11-10 12:25:52,614 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-10 12:25:52,615 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-10 12:25:52,615 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-10 12:25:52,615 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-10 12:25:52,616 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:52" (1/1) ... [2023-11-10 12:25:52,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 12:25:52,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:25:52,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-10 12:25:52,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-10 12:25:52,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-10 12:25:52,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-10 12:25:52,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-10 12:25:52,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-10 12:25:52,682 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-10 12:25:52,682 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-10 12:25:52,682 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-10 12:25:52,682 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-10 12:25:52,682 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-10 12:25:52,682 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-10 12:25:52,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-10 12:25:52,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-10 12:25:52,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-10 12:25:52,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-10 12:25:52,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-10 12:25:52,684 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-10 12:25:52,759 INFO L236 CfgBuilder]: Building ICFG [2023-11-10 12:25:52,761 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-10 12:25:53,145 INFO L277 CfgBuilder]: Performing block encoding [2023-11-10 12:25:53,170 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-10 12:25:53,170 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-10 12:25:53,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:25:53 BoogieIcfgContainer [2023-11-10 12:25:53,175 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-10 12:25:53,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-10 12:25:53,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-10 12:25:53,181 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-10 12:25:53,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:25:52" (1/3) ... [2023-11-10 12:25:53,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0bc653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:25:53, skipping insertion in model container [2023-11-10 12:25:53,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:25:52" (2/3) ... [2023-11-10 12:25:53,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d0bc653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:25:53, skipping insertion in model container [2023-11-10 12:25:53,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:25:53" (3/3) ... [2023-11-10 12:25:53,183 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2023-11-10 12:25:53,197 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-10 12:25:53,198 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-10 12:25:53,198 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-10 12:25:53,273 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-10 12:25:53,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 355 places, 374 transitions, 769 flow [2023-11-10 12:25:53,412 INFO L124 PetriNetUnfolderBase]: 29/371 cut-off events. [2023-11-10 12:25:53,413 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-10 12:25:53,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 371 events. 29/371 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 518 event pairs, 0 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 244. Up to 2 conditions per place. [2023-11-10 12:25:53,430 INFO L82 GeneralOperation]: Start removeDead. Operand has 355 places, 374 transitions, 769 flow [2023-11-10 12:25:53,438 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 341 places, 360 transitions, 738 flow [2023-11-10 12:25:53,453 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 12:25:53,459 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@ddf8361, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 12:25:53,459 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-10 12:25:53,539 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 12:25:53,539 INFO L124 PetriNetUnfolderBase]: 28/355 cut-off events. [2023-11-10 12:25:53,539 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-10 12:25:53,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:25:53,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:25:53,540 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-10 12:25:53,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:25:53,545 INFO L85 PathProgramCache]: Analyzing trace with hash -400447198, now seen corresponding path program 1 times [2023-11-10 12:25:53,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:25:53,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400565565] [2023-11-10 12:25:53,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:53,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:25:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:54,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:25:54,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:25:54,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400565565] [2023-11-10 12:25:54,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400565565] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:25:54,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:25:54,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-10 12:25:54,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850609604] [2023-11-10 12:25:54,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:25:54,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-10 12:25:54,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:25:54,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-10 12:25:54,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-11-10 12:25:54,527 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 374 [2023-11-10 12:25:54,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 360 transitions, 738 flow. Second operand has 12 states, 12 states have (on average 265.25) internal successors, (3183), 12 states have internal predecessors, (3183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:54,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:25:54,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 374 [2023-11-10 12:25:54,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:25:55,447 INFO L124 PetriNetUnfolderBase]: 189/2666 cut-off events. [2023-11-10 12:25:55,447 INFO L125 PetriNetUnfolderBase]: For 145/145 co-relation queries the response was YES. [2023-11-10 12:25:55,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3208 conditions, 2666 events. 189/2666 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 19967 event pairs, 34 based on Foata normal form. 416/2873 useless extension candidates. Maximal degree in co-relation 2438. Up to 163 conditions per place. [2023-11-10 12:25:55,471 INFO L140 encePairwiseOnDemand]: 326/374 looper letters, 159 selfloop transitions, 9 changer transitions 44/459 dead transitions. [2023-11-10 12:25:55,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 459 transitions, 1396 flow [2023-11-10 12:25:55,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-10 12:25:55,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-10 12:25:55,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 5199 transitions. [2023-11-10 12:25:55,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7316352378271883 [2023-11-10 12:25:55,491 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 5199 transitions. [2023-11-10 12:25:55,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 5199 transitions. [2023-11-10 12:25:55,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:25:55,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 5199 transitions. [2023-11-10 12:25:55,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 273.63157894736844) internal successors, (5199), 19 states have internal predecessors, (5199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:55,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 374.0) internal successors, (7480), 20 states have internal predecessors, (7480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:55,524 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 374.0) internal successors, (7480), 20 states have internal predecessors, (7480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:55,525 INFO L175 Difference]: Start difference. First operand has 341 places, 360 transitions, 738 flow. Second operand 19 states and 5199 transitions. [2023-11-10 12:25:55,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 459 transitions, 1396 flow [2023-11-10 12:25:55,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 459 transitions, 1360 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-10 12:25:55,540 INFO L231 Difference]: Finished difference. Result has 364 places, 334 transitions, 729 flow [2023-11-10 12:25:55,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=729, PETRI_PLACES=364, PETRI_TRANSITIONS=334} [2023-11-10 12:25:55,544 INFO L281 CegarLoopForPetriNet]: 341 programPoint places, 23 predicate places. [2023-11-10 12:25:55,544 INFO L495 AbstractCegarLoop]: Abstraction has has 364 places, 334 transitions, 729 flow [2023-11-10 12:25:55,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 265.25) internal successors, (3183), 12 states have internal predecessors, (3183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:55,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:25:55,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:25:55,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-10 12:25:55,548 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-10 12:25:55,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:25:55,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1352171204, now seen corresponding path program 1 times [2023-11-10 12:25:55,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:25:55,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539305642] [2023-11-10 12:25:55,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:55,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:25:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:55,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:25:55,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:25:55,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539305642] [2023-11-10 12:25:55,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539305642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:25:55,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:25:55,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 12:25:55,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907744949] [2023-11-10 12:25:55,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:25:55,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 12:25:55,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:25:55,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 12:25:55,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-10 12:25:55,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 374 [2023-11-10 12:25:55,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 334 transitions, 729 flow. Second operand has 7 states, 7 states have (on average 293.14285714285717) internal successors, (2052), 7 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:55,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:25:55,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 374 [2023-11-10 12:25:55,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:25:56,846 INFO L124 PetriNetUnfolderBase]: 971/7241 cut-off events. [2023-11-10 12:25:56,847 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-10 12:25:56,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9173 conditions, 7241 events. 971/7241 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 68081 event pairs, 548 based on Foata normal form. 0/6276 useless extension candidates. Maximal degree in co-relation 9129. Up to 962 conditions per place. [2023-11-10 12:25:56,895 INFO L140 encePairwiseOnDemand]: 345/374 looper letters, 101 selfloop transitions, 42 changer transitions 0/413 dead transitions. [2023-11-10 12:25:56,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 413 transitions, 1181 flow [2023-11-10 12:25:56,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 12:25:56,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 12:25:56,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3004 transitions. [2023-11-10 12:25:56,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8032085561497326 [2023-11-10 12:25:56,901 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 3004 transitions. [2023-11-10 12:25:56,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 3004 transitions. [2023-11-10 12:25:56,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:25:56,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 3004 transitions. [2023-11-10 12:25:56,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 300.4) internal successors, (3004), 10 states have internal predecessors, (3004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:56,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 374.0) internal successors, (4114), 11 states have internal predecessors, (4114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:56,915 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 374.0) internal successors, (4114), 11 states have internal predecessors, (4114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:56,915 INFO L175 Difference]: Start difference. First operand has 364 places, 334 transitions, 729 flow. Second operand 10 states and 3004 transitions. [2023-11-10 12:25:56,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 413 transitions, 1181 flow [2023-11-10 12:25:56,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 413 transitions, 1163 flow, removed 9 selfloop flow, removed 9 redundant places. [2023-11-10 12:25:56,925 INFO L231 Difference]: Finished difference. Result has 345 places, 359 transitions, 903 flow [2023-11-10 12:25:56,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=903, PETRI_PLACES=345, PETRI_TRANSITIONS=359} [2023-11-10 12:25:56,926 INFO L281 CegarLoopForPetriNet]: 341 programPoint places, 4 predicate places. [2023-11-10 12:25:56,926 INFO L495 AbstractCegarLoop]: Abstraction has has 345 places, 359 transitions, 903 flow [2023-11-10 12:25:56,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 293.14285714285717) internal successors, (2052), 7 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:56,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:25:56,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:25:56,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-10 12:25:56,928 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-10 12:25:56,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:25:56,929 INFO L85 PathProgramCache]: Analyzing trace with hash -674092718, now seen corresponding path program 1 times [2023-11-10 12:25:56,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:25:56,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621525342] [2023-11-10 12:25:56,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:56,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:25:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:57,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:25:57,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:25:57,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621525342] [2023-11-10 12:25:57,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621525342] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:25:57,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:25:57,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 12:25:57,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630901159] [2023-11-10 12:25:57,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:25:57,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 12:25:57,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:25:57,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 12:25:57,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-10 12:25:57,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 374 [2023-11-10 12:25:57,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 359 transitions, 903 flow. Second operand has 7 states, 7 states have (on average 293.14285714285717) internal successors, (2052), 7 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:57,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:25:57,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 374 [2023-11-10 12:25:57,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:25:57,804 INFO L124 PetriNetUnfolderBase]: 887/4154 cut-off events. [2023-11-10 12:25:57,804 INFO L125 PetriNetUnfolderBase]: For 332/356 co-relation queries the response was YES. [2023-11-10 12:25:57,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6033 conditions, 4154 events. 887/4154 cut-off events. For 332/356 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 31102 event pairs, 555 based on Foata normal form. 24/3553 useless extension candidates. Maximal degree in co-relation 4988. Up to 1110 conditions per place. [2023-11-10 12:25:57,843 INFO L140 encePairwiseOnDemand]: 345/374 looper letters, 99 selfloop transitions, 42 changer transitions 0/413 dead transitions. [2023-11-10 12:25:57,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 413 transitions, 1321 flow [2023-11-10 12:25:57,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 12:25:57,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 12:25:57,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3002 transitions. [2023-11-10 12:25:57,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8026737967914439 [2023-11-10 12:25:57,848 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 3002 transitions. [2023-11-10 12:25:57,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 3002 transitions. [2023-11-10 12:25:57,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:25:57,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 3002 transitions. [2023-11-10 12:25:57,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 300.2) internal successors, (3002), 10 states have internal predecessors, (3002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:57,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 374.0) internal successors, (4114), 11 states have internal predecessors, (4114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:57,858 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 374.0) internal successors, (4114), 11 states have internal predecessors, (4114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:57,858 INFO L175 Difference]: Start difference. First operand has 345 places, 359 transitions, 903 flow. Second operand 10 states and 3002 transitions. [2023-11-10 12:25:57,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 413 transitions, 1321 flow [2023-11-10 12:25:57,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 413 transitions, 1321 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 12:25:57,865 INFO L231 Difference]: Finished difference. Result has 356 places, 361 transitions, 1008 flow [2023-11-10 12:25:57,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=903, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1008, PETRI_PLACES=356, PETRI_TRANSITIONS=361} [2023-11-10 12:25:57,866 INFO L281 CegarLoopForPetriNet]: 341 programPoint places, 15 predicate places. [2023-11-10 12:25:57,866 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 361 transitions, 1008 flow [2023-11-10 12:25:57,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 293.14285714285717) internal successors, (2052), 7 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:57,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:25:57,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:25:57,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-10 12:25:57,868 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-10 12:25:57,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:25:57,868 INFO L85 PathProgramCache]: Analyzing trace with hash 680780691, now seen corresponding path program 1 times [2023-11-10 12:25:57,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:25:57,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48446463] [2023-11-10 12:25:57,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:57,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:25:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:58,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-10 12:25:58,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:25:58,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48446463] [2023-11-10 12:25:58,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48446463] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:25:58,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613949876] [2023-11-10 12:25:58,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:58,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:58,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:25:58,018 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:25:58,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-10 12:25:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:25:58,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-10 12:25:58,165 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:25:58,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-10 12:25:58,346 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:25:58,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-10 12:25:58,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613949876] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-10 12:25:58,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-10 12:25:58,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-11-10 12:25:58,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430925093] [2023-11-10 12:25:58,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:25:58,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 12:25:58,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:25:58,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 12:25:58,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-11-10 12:25:58,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 374 [2023-11-10 12:25:58,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 361 transitions, 1008 flow. Second operand has 7 states, 7 states have (on average 291.42857142857144) internal successors, (2040), 7 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:58,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:25:58,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 374 [2023-11-10 12:25:58,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:25:59,651 INFO L124 PetriNetUnfolderBase]: 1232/8392 cut-off events. [2023-11-10 12:25:59,651 INFO L125 PetriNetUnfolderBase]: For 820/997 co-relation queries the response was YES. [2023-11-10 12:25:59,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11305 conditions, 8392 events. 1232/8392 cut-off events. For 820/997 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 81510 event pairs, 311 based on Foata normal form. 176/7934 useless extension candidates. Maximal degree in co-relation 7914. Up to 1134 conditions per place. [2023-11-10 12:25:59,698 INFO L140 encePairwiseOnDemand]: 349/374 looper letters, 115 selfloop transitions, 26 changer transitions 0/412 dead transitions. [2023-11-10 12:25:59,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 412 transitions, 1455 flow [2023-11-10 12:25:59,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-10 12:25:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-10 12:25:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2390 transitions. [2023-11-10 12:25:59,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7987967914438503 [2023-11-10 12:25:59,703 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2390 transitions. [2023-11-10 12:25:59,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2390 transitions. [2023-11-10 12:25:59,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:25:59,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2390 transitions. [2023-11-10 12:25:59,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 298.75) internal successors, (2390), 8 states have internal predecessors, (2390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:59,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 374.0) internal successors, (3366), 9 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:59,711 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 374.0) internal successors, (3366), 9 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:59,711 INFO L175 Difference]: Start difference. First operand has 356 places, 361 transitions, 1008 flow. Second operand 8 states and 2390 transitions. [2023-11-10 12:25:59,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 412 transitions, 1455 flow [2023-11-10 12:25:59,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 412 transitions, 1367 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-11-10 12:25:59,718 INFO L231 Difference]: Finished difference. Result has 362 places, 377 transitions, 1129 flow [2023-11-10 12:25:59,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=935, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1129, PETRI_PLACES=362, PETRI_TRANSITIONS=377} [2023-11-10 12:25:59,719 INFO L281 CegarLoopForPetriNet]: 341 programPoint places, 21 predicate places. [2023-11-10 12:25:59,719 INFO L495 AbstractCegarLoop]: Abstraction has has 362 places, 377 transitions, 1129 flow [2023-11-10 12:25:59,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 291.42857142857144) internal successors, (2040), 7 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:25:59,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:25:59,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:25:59,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-10 12:25:59,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:25:59,926 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-10 12:25:59,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:25:59,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1460827236, now seen corresponding path program 1 times [2023-11-10 12:25:59,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:25:59,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896846531] [2023-11-10 12:25:59,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:25:59,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:25:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:26:00,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:26:00,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:26:00,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896846531] [2023-11-10 12:26:00,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896846531] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:26:00,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:26:00,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 12:26:00,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652966833] [2023-11-10 12:26:00,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:26:00,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 12:26:00,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:26:00,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 12:26:00,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-10 12:26:00,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 374 [2023-11-10 12:26:00,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 377 transitions, 1129 flow. Second operand has 7 states, 7 states have (on average 290.57142857142856) internal successors, (2034), 7 states have internal predecessors, (2034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:00,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:26:00,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 374 [2023-11-10 12:26:00,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:26:00,997 INFO L124 PetriNetUnfolderBase]: 983/5785 cut-off events. [2023-11-10 12:26:00,998 INFO L125 PetriNetUnfolderBase]: For 1073/1110 co-relation queries the response was YES. [2023-11-10 12:26:01,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8542 conditions, 5785 events. 983/5785 cut-off events. For 1073/1110 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 50030 event pairs, 707 based on Foata normal form. 50/5382 useless extension candidates. Maximal degree in co-relation 7832. Up to 1396 conditions per place. [2023-11-10 12:26:01,052 INFO L140 encePairwiseOnDemand]: 345/374 looper letters, 60 selfloop transitions, 20 changer transitions 78/425 dead transitions. [2023-11-10 12:26:01,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 425 transitions, 1571 flow [2023-11-10 12:26:01,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 12:26:01,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 12:26:01,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2973 transitions. [2023-11-10 12:26:01,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7949197860962567 [2023-11-10 12:26:01,058 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2973 transitions. [2023-11-10 12:26:01,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2973 transitions. [2023-11-10 12:26:01,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:26:01,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2973 transitions. [2023-11-10 12:26:01,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 297.3) internal successors, (2973), 10 states have internal predecessors, (2973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:01,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 374.0) internal successors, (4114), 11 states have internal predecessors, (4114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:01,069 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 374.0) internal successors, (4114), 11 states have internal predecessors, (4114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:01,069 INFO L175 Difference]: Start difference. First operand has 362 places, 377 transitions, 1129 flow. Second operand 10 states and 2973 transitions. [2023-11-10 12:26:01,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 425 transitions, 1571 flow [2023-11-10 12:26:01,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 425 transitions, 1571 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-10 12:26:01,077 INFO L231 Difference]: Finished difference. Result has 372 places, 339 transitions, 893 flow [2023-11-10 12:26:01,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=1119, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=893, PETRI_PLACES=372, PETRI_TRANSITIONS=339} [2023-11-10 12:26:01,078 INFO L281 CegarLoopForPetriNet]: 341 programPoint places, 31 predicate places. [2023-11-10 12:26:01,079 INFO L495 AbstractCegarLoop]: Abstraction has has 372 places, 339 transitions, 893 flow [2023-11-10 12:26:01,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 290.57142857142856) internal successors, (2034), 7 states have internal predecessors, (2034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:01,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:26:01,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:26:01,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-10 12:26:01,080 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-10 12:26:01,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:26:01,080 INFO L85 PathProgramCache]: Analyzing trace with hash 919023915, now seen corresponding path program 1 times [2023-11-10 12:26:01,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:26:01,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647853983] [2023-11-10 12:26:01,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:26:01,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:26:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:26:01,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-10 12:26:01,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:26:01,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647853983] [2023-11-10 12:26:01,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647853983] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:26:01,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731904520] [2023-11-10 12:26:01,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:26:01,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:26:01,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:26:01,281 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:26:01,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-10 12:26:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:26:01,430 INFO L262 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-10 12:26:01,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:26:01,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-10 12:26:01,602 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:26:01,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-10 12:26:01,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731904520] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-10 12:26:01,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-10 12:26:01,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-11-10 12:26:01,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988478743] [2023-11-10 12:26:01,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:26:01,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 12:26:01,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:26:01,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 12:26:01,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-11-10 12:26:01,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 374 [2023-11-10 12:26:01,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 339 transitions, 893 flow. Second operand has 7 states, 7 states have (on average 294.42857142857144) internal successors, (2061), 7 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:01,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:26:01,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 374 [2023-11-10 12:26:01,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:26:02,173 INFO L124 PetriNetUnfolderBase]: 498/2913 cut-off events. [2023-11-10 12:26:02,174 INFO L125 PetriNetUnfolderBase]: For 748/843 co-relation queries the response was YES. [2023-11-10 12:26:02,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4473 conditions, 2913 events. 498/2913 cut-off events. For 748/843 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 18500 event pairs, 93 based on Foata normal form. 121/2722 useless extension candidates. Maximal degree in co-relation 4410. Up to 401 conditions per place. [2023-11-10 12:26:02,203 INFO L140 encePairwiseOnDemand]: 366/374 looper letters, 70 selfloop transitions, 7 changer transitions 0/347 dead transitions. [2023-11-10 12:26:02,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 347 transitions, 1079 flow [2023-11-10 12:26:02,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-10 12:26:02,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-10 12:26:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2075 transitions. [2023-11-10 12:26:02,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7925897631779985 [2023-11-10 12:26:02,206 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2075 transitions. [2023-11-10 12:26:02,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2075 transitions. [2023-11-10 12:26:02,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:26:02,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2075 transitions. [2023-11-10 12:26:02,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 296.42857142857144) internal successors, (2075), 7 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:02,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 374.0) internal successors, (2992), 8 states have internal predecessors, (2992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:02,212 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 374.0) internal successors, (2992), 8 states have internal predecessors, (2992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:02,213 INFO L175 Difference]: Start difference. First operand has 372 places, 339 transitions, 893 flow. Second operand 7 states and 2075 transitions. [2023-11-10 12:26:02,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 347 transitions, 1079 flow [2023-11-10 12:26:02,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 347 transitions, 943 flow, removed 20 selfloop flow, removed 23 redundant places. [2023-11-10 12:26:02,219 INFO L231 Difference]: Finished difference. Result has 348 places, 340 transitions, 791 flow [2023-11-10 12:26:02,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=791, PETRI_PLACES=348, PETRI_TRANSITIONS=340} [2023-11-10 12:26:02,220 INFO L281 CegarLoopForPetriNet]: 341 programPoint places, 7 predicate places. [2023-11-10 12:26:02,220 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 340 transitions, 791 flow [2023-11-10 12:26:02,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 294.42857142857144) internal successors, (2061), 7 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:02,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:26:02,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:26:02,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-10 12:26:02,426 WARN L477 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-11-10 12:26:02,426 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-10 12:26:02,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:26:02,427 INFO L85 PathProgramCache]: Analyzing trace with hash 63200327, now seen corresponding path program 1 times [2023-11-10 12:26:02,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:26:02,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393771547] [2023-11-10 12:26:02,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:26:02,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:26:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:26:02,657 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-10 12:26:02,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:26:02,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393771547] [2023-11-10 12:26:02,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393771547] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:26:02,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542254415] [2023-11-10 12:26:02,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:26:02,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:26:02,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:26:02,658 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:26:02,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-10 12:26:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:26:02,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-10 12:26:02,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:26:03,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-10 12:26:03,012 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:26:03,267 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-10 12:26:03,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542254415] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-10 12:26:03,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-10 12:26:03,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-11-10 12:26:03,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020312822] [2023-11-10 12:26:03,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:26:03,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 12:26:03,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:26:03,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 12:26:03,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-11-10 12:26:03,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 374 [2023-11-10 12:26:03,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 340 transitions, 791 flow. Second operand has 7 states, 7 states have (on average 294.57142857142856) internal successors, (2062), 7 states have internal predecessors, (2062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:03,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:26:03,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 374 [2023-11-10 12:26:03,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:26:03,734 INFO L124 PetriNetUnfolderBase]: 395/3782 cut-off events. [2023-11-10 12:26:03,734 INFO L125 PetriNetUnfolderBase]: For 559/755 co-relation queries the response was YES. [2023-11-10 12:26:03,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5042 conditions, 3782 events. 395/3782 cut-off events. For 559/755 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 30279 event pairs, 160 based on Foata normal form. 195/3675 useless extension candidates. Maximal degree in co-relation 4999. Up to 330 conditions per place. [2023-11-10 12:26:03,767 INFO L140 encePairwiseOnDemand]: 366/374 looper letters, 72 selfloop transitions, 7 changer transitions 0/349 dead transitions. [2023-11-10 12:26:03,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 349 transitions, 984 flow [2023-11-10 12:26:03,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-10 12:26:03,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-10 12:26:03,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2075 transitions. [2023-11-10 12:26:03,771 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7925897631779985 [2023-11-10 12:26:03,771 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2075 transitions. [2023-11-10 12:26:03,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2075 transitions. [2023-11-10 12:26:03,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:26:03,772 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2075 transitions. [2023-11-10 12:26:03,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 296.42857142857144) internal successors, (2075), 7 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:03,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 374.0) internal successors, (2992), 8 states have internal predecessors, (2992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:03,777 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 374.0) internal successors, (2992), 8 states have internal predecessors, (2992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:03,777 INFO L175 Difference]: Start difference. First operand has 348 places, 340 transitions, 791 flow. Second operand 7 states and 2075 transitions. [2023-11-10 12:26:03,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 349 transitions, 984 flow [2023-11-10 12:26:03,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 349 transitions, 973 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-10 12:26:03,782 INFO L231 Difference]: Finished difference. Result has 351 places, 341 transitions, 808 flow [2023-11-10 12:26:03,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=808, PETRI_PLACES=351, PETRI_TRANSITIONS=341} [2023-11-10 12:26:03,783 INFO L281 CegarLoopForPetriNet]: 341 programPoint places, 10 predicate places. [2023-11-10 12:26:03,783 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 341 transitions, 808 flow [2023-11-10 12:26:03,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 294.57142857142856) internal successors, (2062), 7 states have internal predecessors, (2062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:26:03,784 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:26:03,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:26:03,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-10 12:26:03,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:26:03,988 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-10 12:26:03,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:26:03,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1463987593, now seen corresponding path program 1 times [2023-11-10 12:26:03,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:26:03,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911405779] [2023-11-10 12:26:03,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:26:03,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:26:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:26:08,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-10 12:26:08,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:26:08,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911405779] [2023-11-10 12:26:08,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911405779] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:26:08,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618581167] [2023-11-10 12:26:08,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:26:08,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:26:08,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:26:08,504 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-10 12:26:08,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-10 12:26:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:26:08,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 151 conjunts are in the unsatisfiable core [2023-11-10 12:26:08,684 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:26:08,869 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-10 12:26:09,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:26:09,231 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-11-10 12:26:09,571 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-10 12:26:10,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:26:10,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:26:10,202 INFO L322 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-10 12:26:10,204 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 24 [2023-11-10 12:26:10,543 INFO L351 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:26:11,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:26:11,753 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-10 12:26:11,754 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-10 12:26:12,171 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:26:12,631 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:26:12,808 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:26:15,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:26:15,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:26:15,033 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-10 12:26:15,033 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2023-11-10 12:26:16,117 INFO L322 Elim1Store]: treesize reduction 36, result has 54.4 percent of original size [2023-11-10 12:26:16,118 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 58 [2023-11-10 12:26:16,849 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:26:16,849 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 137 treesize of output 509 [2023-11-10 12:26:18,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:26:18,394 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:26:19,618 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_287))) (+ c_~csum~0 (select (select .cse0 c_~B~0.base) c_~B~0.offset) (select (select .cse0 c_~A~0.base) c_~A~0.offset))) (+ c_~asum~0 c_~bsum~0))) is different from false [2023-11-10 12:26:19,637 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_287))) (+ c_~csum~0 (select (select .cse0 c_~B~0.base) c_~B~0.offset) (select (select .cse0 c_~A~0.base) c_~A~0.offset))) (+ c_~asum~0 |c_thread2Thread1of1ForFork1_#t~ret6#1|))) is different from false [2023-11-10 12:26:19,654 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array Int Int))) (= (+ |c_thread2Thread1of1ForFork1_plus_#res#1| c_~asum~0) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_287))) (+ c_~csum~0 (select (select .cse0 c_~B~0.base) c_~B~0.offset) (select (select .cse0 c_~A~0.base) c_~A~0.offset))))) is different from false [2023-11-10 12:26:19,900 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_287))) (+ c_~csum~0 (select (select .cse0 c_~B~0.base) c_~B~0.offset) (select (select .cse0 c_~A~0.base) c_~A~0.offset))) (+ |c_thread2Thread1of1ForFork1_plus_~a#1| c_~asum~0 |c_thread2Thread1of1ForFork1_plus_#in~b#1|))) is different from false [2023-11-10 12:26:20,065 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array Int Int))) (= (+ c_~asum~0 c_~bsum~0 |c_thread2Thread1of1ForFork1_#t~mem5#1|) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_287))) (+ c_~csum~0 (select (select .cse0 c_~B~0.base) c_~B~0.offset) (select (select .cse0 c_~A~0.base) c_~A~0.offset))))) is different from false [2023-11-10 12:26:20,069 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array Int Int))) (= (+ c_~asum~0 c_~bsum~0 (select (select |c_#memory_int| c_~B~0.base) (+ (* |c_thread2Thread1of1ForFork1_~i~1#1| 4) c_~B~0.offset))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_287))) (+ c_~csum~0 (select (select .cse0 c_~B~0.base) c_~B~0.offset) (select (select .cse0 c_~A~0.base) c_~A~0.offset))))) is different from false [2023-11-10 12:26:20,402 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_287))) (+ c_~csum~0 (select (select .cse0 c_~B~0.base) c_~B~0.offset) (select (select .cse0 c_~A~0.base) c_~A~0.offset))) (+ c_~bsum~0 |c_thread1Thread1of1ForFork0_plus_#res#1| (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)))) is different from false [2023-11-10 12:26:20,407 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_287))) (+ c_~csum~0 (select (select .cse0 c_~B~0.base) c_~B~0.offset) (select (select .cse0 c_~A~0.base) c_~A~0.offset))) (+ c_~bsum~0 |c_thread1Thread1of1ForFork0_plus_~a#1| (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset) |c_thread1Thread1of1ForFork0_plus_~b#1|))) is different from false [2023-11-10 12:26:20,440 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array Int Int))) (= (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| c_~bsum~0 |c_thread1Thread1of1ForFork0_plus_~a#1| (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_287))) (+ c_~csum~0 (select (select .cse0 c_~B~0.base) c_~B~0.offset) (select (select .cse0 c_~A~0.base) c_~A~0.offset))))) is different from false [2023-11-10 12:26:20,445 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array Int Int))) (= (+ |c_thread1Thread1of1ForFork0_plus_#in~b#1| c_~bsum~0 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset) |c_thread1Thread1of1ForFork0_plus_#in~a#1|) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_287))) (+ c_~csum~0 (select (select .cse0 c_~B~0.base) c_~B~0.offset) (select (select .cse0 c_~A~0.base) c_~A~0.offset))))) is different from false [2023-11-10 12:26:20,625 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array Int Int))) (= (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_287))) (+ c_~csum~0 (select (select .cse0 c_~B~0.base) c_~B~0.offset) (select (select .cse0 c_~A~0.base) c_~A~0.offset))) (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork0_~i~0#1| 4))) c_~asum~0 c_~bsum~0 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)))) is different from false [2023-11-10 12:26:20,632 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array Int Int))) (= (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~asum~0 c_~bsum~0 (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_287))) (+ c_~csum~0 (select (select .cse0 c_~B~0.base) c_~B~0.offset) (select (select .cse0 c_~A~0.base) c_~A~0.offset))))) is different from false [2023-11-10 12:26:20,641 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_287 (Array Int Int)) (v_ArrVal_286 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_286))) (= (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_287))) (+ (select (select .cse0 c_~B~0.base) c_~B~0.offset) (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~csum~0)) (+ c_~asum~0 c_~bsum~0 (select (select .cse1 c_~B~0.base) c_~B~0.offset) (select (select .cse1 c_~A~0.base) c_~A~0.offset))))) is different from false [2023-11-10 12:26:20,662 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_285 (Array Int Int)) (v_ArrVal_287 (Array Int Int)) (v_ArrVal_286 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_286))) (= (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_287))) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) (select (select .cse0 c_~B~0.base) c_~B~0.offset) c_~csum~0)) (+ (select (select .cse1 c_~B~0.base) c_~B~0.offset) c_~asum~0 c_~bsum~0 (select (select .cse1 c_~A~0.base) c_~A~0.offset))))) is different from false [2023-11-10 12:26:20,710 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_285 (Array Int Int)) (v_ArrVal_284 (Array Int Int)) (v_ArrVal_287 (Array Int Int)) (v_ArrVal_286 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_284) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_286))) (= (+ (select (select .cse0 c_~B~0.base) c_~B~0.offset) c_~asum~0 c_~bsum~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset)) (let ((.cse1 (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_287))) (+ c_~csum~0 (select (select .cse1 c_~A~0.base) c_~A~0.offset) (select (select .cse1 c_~B~0.base) c_~B~0.offset)))))) is different from false [2023-11-10 12:26:20,730 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_285 (Array Int Int)) (v_ArrVal_284 (Array Int Int)) (v_ArrVal_287 (Array Int Int)) (v_ArrVal_286 (Array Int Int))) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc27#1.base| v_ArrVal_284) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_286))) (= (let ((.cse0 (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_287))) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~csum~0 (select (select .cse0 c_~B~0.base) c_~B~0.offset))) (+ c_~asum~0 (select (select .cse1 c_~B~0.base) c_~B~0.offset) c_~bsum~0 (select (select .cse1 c_~A~0.base) c_~A~0.offset))))) is different from false [2023-11-10 12:26:23,586 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:26:23,586 INFO L351 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 128 treesize of output 93 [2023-11-10 12:26:24,143 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:26:24,165 INFO L351 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 113024368630 treesize of output 109937360897 [2023-11-10 12:26:39,106 WARN L293 SmtUtils]: Spent 14.88s on a formula simplification. DAG size of input: 13058 DAG size of output: 422 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-10 12:26:39,143 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:26:39,143 INFO L351 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 22134 treesize of output 21886 [2023-11-10 12:26:39,430 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:26:39,431 INFO L351 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 21878 treesize of output 21758 [2023-11-10 12:26:39,689 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:26:39,690 INFO L351 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 21750 treesize of output 21246 [2023-11-10 12:26:39,955 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:26:39,956 INFO L351 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 21238 treesize of output 19198 [2023-11-10 12:26:40,229 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:26:40,229 INFO L351 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 19190 treesize of output 18174 [2023-11-10 12:27:11,657 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-11-10 12:27:19,199 INFO L322 Elim1Store]: treesize reduction 20, result has 97.6 percent of original size [2023-11-10 12:27:19,200 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 1022 treesize of output 1801 [2023-11-10 12:27:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-10 12:27:24,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618581167] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:27:24,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:27:24,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 64, 62] total 161 [2023-11-10 12:27:24,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122562180] [2023-11-10 12:27:24,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:27:24,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 161 states [2023-11-10 12:27:24,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:27:24,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2023-11-10 12:27:24,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=20008, Unknown=267, NotChecked=4816, Total=25760 [2023-11-10 12:27:24,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 374 [2023-11-10 12:27:24,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 341 transitions, 808 flow. Second operand has 161 states, 161 states have (on average 98.75155279503106) internal successors, (15899), 161 states have internal predecessors, (15899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 12:27:24,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:27:24,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 374 [2023-11-10 12:27:24,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand