/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-29 22:20:45,829 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 22:20:45,893 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-29 22:20:45,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 22:20:45,914 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 22:20:45,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 22:20:45,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 22:20:45,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 22:20:45,916 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 22:20:45,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 22:20:45,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 22:20:45,917 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 22:20:45,917 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 22:20:45,917 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 22:20:45,918 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 22:20:45,918 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 22:20:45,918 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 22:20:45,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 22:20:45,919 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 22:20:45,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 22:20:45,919 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 22:20:45,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 22:20:45,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 22:20:45,924 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-29 22:20:45,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 22:20:45,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 22:20:45,924 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 22:20:45,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 22:20:45,925 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 22:20:45,925 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 22:20:45,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 22:20:45,926 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 22:20:45,926 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 22:20:45,926 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-11-29 22:20:46,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 22:20:46,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 22:20:46,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 22:20:46,167 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 22:20:46,168 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 22:20:46,169 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c [2023-11-29 22:20:47,350 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 22:20:47,508 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 22:20:47,509 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c [2023-11-29 22:20:47,515 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd4e0b0a5/28bc063c55094ff988d46b09588f17c3/FLAGdd23ab7c1 [2023-11-29 22:20:47,529 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd4e0b0a5/28bc063c55094ff988d46b09588f17c3 [2023-11-29 22:20:47,532 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 22:20:47,533 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-29 22:20:47,534 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 22:20:47,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 22:20:47,538 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 22:20:47,539 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 10:20:47" (1/1) ... [2023-11-29 22:20:47,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@386b5d72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:20:47, skipping insertion in model container [2023-11-29 22:20:47,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 10:20:47" (1/1) ... [2023-11-29 22:20:47,564 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 22:20:47,700 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c[2638,2651] [2023-11-29 22:20:47,710 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 22:20:47,719 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 22:20:47,743 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c[2638,2651] [2023-11-29 22:20:47,747 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 22:20:47,754 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 22:20:47,754 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 22:20:47,761 INFO L206 MainTranslator]: Completed translation [2023-11-29 22:20:47,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:20:47 WrapperNode [2023-11-29 22:20:47,762 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 22:20:47,763 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 22:20:47,763 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 22:20:47,763 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 22:20:47,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:20:47" (1/1) ... [2023-11-29 22:20:47,776 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:20:47" (1/1) ... [2023-11-29 22:20:47,805 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 16, calls inlined = 28, statements flattened = 282 [2023-11-29 22:20:47,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 22:20:47,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 22:20:47,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 22:20:47,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 22:20:47,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:20:47" (1/1) ... [2023-11-29 22:20:47,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:20:47" (1/1) ... [2023-11-29 22:20:47,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:20:47" (1/1) ... [2023-11-29 22:20:47,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:20:47" (1/1) ... [2023-11-29 22:20:47,834 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:20:47" (1/1) ... [2023-11-29 22:20:47,839 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:20:47" (1/1) ... [2023-11-29 22:20:47,841 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:20:47" (1/1) ... [2023-11-29 22:20:47,843 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:20:47" (1/1) ... [2023-11-29 22:20:47,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 22:20:47,848 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 22:20:47,848 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 22:20:47,848 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 22:20:47,849 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:20:47" (1/1) ... [2023-11-29 22:20:47,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 22:20:47,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:20:47,886 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-29 22:20:47,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-29 22:20:47,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 22:20:47,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 22:20:47,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 22:20:47,927 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 22:20:47,927 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 22:20:47,927 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 22:20:47,928 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 22:20:47,928 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 22:20:47,928 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 22:20:47,928 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 22:20:47,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 22:20:47,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 22:20:47,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 22:20:47,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 22:20:47,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 22:20:47,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 22:20:47,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 22:20:47,930 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 22:20:48,030 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 22:20:48,033 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 22:20:48,534 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 22:20:48,773 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 22:20:48,774 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-29 22:20:48,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:20:48 BoogieIcfgContainer [2023-11-29 22:20:48,775 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 22:20:48,778 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 22:20:48,778 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 22:20:48,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 22:20:48,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 10:20:47" (1/3) ... [2023-11-29 22:20:48,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@593e6739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 10:20:48, skipping insertion in model container [2023-11-29 22:20:48,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 10:20:47" (2/3) ... [2023-11-29 22:20:48,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@593e6739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 10:20:48, skipping insertion in model container [2023-11-29 22:20:48,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 10:20:48" (3/3) ... [2023-11-29 22:20:48,783 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum2.wvr.c [2023-11-29 22:20:48,797 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 22:20:48,798 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 22:20:48,798 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 22:20:48,859 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-29 22:20:48,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 201 transitions, 423 flow [2023-11-29 22:20:48,999 INFO L124 PetriNetUnfolderBase]: 16/198 cut-off events. [2023-11-29 22:20:48,999 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 22:20:49,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 198 events. 16/198 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 123 event pairs, 0 based on Foata normal form. 0/181 useless extension candidates. Maximal degree in co-relation 158. Up to 2 conditions per place. [2023-11-29 22:20:49,008 INFO L82 GeneralOperation]: Start removeDead. Operand has 195 places, 201 transitions, 423 flow [2023-11-29 22:20:49,015 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 187 transitions, 392 flow [2023-11-29 22:20:49,025 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 22:20:49,031 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@236891c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 22:20:49,031 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-29 22:20:49,083 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 22:20:49,083 INFO L124 PetriNetUnfolderBase]: 16/186 cut-off events. [2023-11-29 22:20:49,084 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-29 22:20:49,084 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:20:49,085 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:20:49,085 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 22:20:49,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:20:49,091 INFO L85 PathProgramCache]: Analyzing trace with hash 996282290, now seen corresponding path program 1 times [2023-11-29 22:20:49,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:20:49,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039453726] [2023-11-29 22:20:49,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:20:49,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:20:49,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:20:49,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:20:49,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:20:49,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039453726] [2023-11-29 22:20:49,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039453726] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 22:20:49,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 22:20:49,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 22:20:49,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304551027] [2023-11-29 22:20:49,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:20:49,859 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 22:20:49,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:20:49,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 22:20:49,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 22:20:49,891 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 201 [2023-11-29 22:20:49,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 187 transitions, 392 flow. Second operand has 6 states, 6 states have (on average 143.33333333333334) internal successors, (860), 6 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:49,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:20:49,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 201 [2023-11-29 22:20:49,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:20:50,133 INFO L124 PetriNetUnfolderBase]: 55/413 cut-off events. [2023-11-29 22:20:50,133 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2023-11-29 22:20:50,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 591 conditions, 413 events. 55/413 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1331 event pairs, 6 based on Foata normal form. 65/442 useless extension candidates. Maximal degree in co-relation 297. Up to 54 conditions per place. [2023-11-29 22:20:50,143 INFO L140 encePairwiseOnDemand]: 176/201 looper letters, 61 selfloop transitions, 6 changer transitions 12/202 dead transitions. [2023-11-29 22:20:50,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 202 transitions, 607 flow [2023-11-29 22:20:50,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 22:20:50,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 22:20:50,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1323 transitions. [2023-11-29 22:20:50,167 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7313432835820896 [2023-11-29 22:20:50,168 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1323 transitions. [2023-11-29 22:20:50,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1323 transitions. [2023-11-29 22:20:50,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:20:50,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1323 transitions. [2023-11-29 22:20:50,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 147.0) internal successors, (1323), 9 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:50,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:50,192 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:50,198 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, 8 predicate places. [2023-11-29 22:20:50,199 INFO L500 AbstractCegarLoop]: Abstraction has has 189 places, 202 transitions, 607 flow [2023-11-29 22:20:50,199 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 143.33333333333334) internal successors, (860), 6 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:50,200 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:20:50,200 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:20:50,201 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 22:20:50,201 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 22:20:50,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:20:50,202 INFO L85 PathProgramCache]: Analyzing trace with hash -103208311, now seen corresponding path program 1 times [2023-11-29 22:20:50,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:20:50,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041653125] [2023-11-29 22:20:50,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:20:50,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:20:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:20:50,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:20:50,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:20:50,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041653125] [2023-11-29 22:20:50,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041653125] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 22:20:50,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 22:20:50,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 22:20:50,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293084076] [2023-11-29 22:20:50,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:20:50,460 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 22:20:50,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:20:50,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 22:20:50,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 22:20:50,462 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 201 [2023-11-29 22:20:50,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 202 transitions, 607 flow. Second operand has 7 states, 7 states have (on average 144.57142857142858) internal successors, (1012), 7 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:50,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:20:50,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 201 [2023-11-29 22:20:50,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:20:50,964 INFO L124 PetriNetUnfolderBase]: 450/1455 cut-off events. [2023-11-29 22:20:50,964 INFO L125 PetriNetUnfolderBase]: For 658/721 co-relation queries the response was YES. [2023-11-29 22:20:50,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2827 conditions, 1455 events. 450/1455 cut-off events. For 658/721 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 8444 event pairs, 160 based on Foata normal form. 1/1268 useless extension candidates. Maximal degree in co-relation 1557. Up to 492 conditions per place. [2023-11-29 22:20:50,973 INFO L140 encePairwiseOnDemand]: 180/201 looper letters, 98 selfloop transitions, 28 changer transitions 13/265 dead transitions. [2023-11-29 22:20:50,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 265 transitions, 1076 flow [2023-11-29 22:20:50,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 22:20:50,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 22:20:50,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1495 transitions. [2023-11-29 22:20:50,977 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7437810945273632 [2023-11-29 22:20:50,977 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1495 transitions. [2023-11-29 22:20:50,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1495 transitions. [2023-11-29 22:20:50,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:20:50,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1495 transitions. [2023-11-29 22:20:50,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 149.5) internal successors, (1495), 10 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:50,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 201.0) internal successors, (2211), 11 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:50,985 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 201.0) internal successors, (2211), 11 states have internal predecessors, (2211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:50,985 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, 17 predicate places. [2023-11-29 22:20:50,985 INFO L500 AbstractCegarLoop]: Abstraction has has 198 places, 265 transitions, 1076 flow [2023-11-29 22:20:50,986 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 144.57142857142858) internal successors, (1012), 7 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:50,986 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:20:50,986 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:20:50,986 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 22:20:50,987 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 22:20:50,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:20:50,987 INFO L85 PathProgramCache]: Analyzing trace with hash 657219121, now seen corresponding path program 1 times [2023-11-29 22:20:50,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:20:50,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396739059] [2023-11-29 22:20:50,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:20:50,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:20:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:20:51,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:20:51,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:20:51,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396739059] [2023-11-29 22:20:51,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396739059] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 22:20:51,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 22:20:51,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 22:20:51,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908202043] [2023-11-29 22:20:51,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:20:51,389 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 22:20:51,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:20:51,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 22:20:51,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-11-29 22:20:51,402 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 201 [2023-11-29 22:20:51,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 265 transitions, 1076 flow. Second operand has 8 states, 8 states have (on average 109.75) internal successors, (878), 8 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:51,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:20:51,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 201 [2023-11-29 22:20:51,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:20:51,862 INFO L124 PetriNetUnfolderBase]: 791/1922 cut-off events. [2023-11-29 22:20:51,863 INFO L125 PetriNetUnfolderBase]: For 1376/1666 co-relation queries the response was YES. [2023-11-29 22:20:51,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4625 conditions, 1922 events. 791/1922 cut-off events. For 1376/1666 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12193 event pairs, 446 based on Foata normal form. 0/1541 useless extension candidates. Maximal degree in co-relation 3880. Up to 1045 conditions per place. [2023-11-29 22:20:51,882 INFO L140 encePairwiseOnDemand]: 180/201 looper letters, 96 selfloop transitions, 14 changer transitions 54/252 dead transitions. [2023-11-29 22:20:51,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 252 transitions, 1271 flow [2023-11-29 22:20:51,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 22:20:51,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 22:20:51,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1042 transitions. [2023-11-29 22:20:51,885 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5760088446655611 [2023-11-29 22:20:51,885 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1042 transitions. [2023-11-29 22:20:51,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1042 transitions. [2023-11-29 22:20:51,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:20:51,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1042 transitions. [2023-11-29 22:20:51,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 115.77777777777777) internal successors, (1042), 9 states have internal predecessors, (1042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:51,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:51,893 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:51,894 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, 24 predicate places. [2023-11-29 22:20:51,894 INFO L500 AbstractCegarLoop]: Abstraction has has 205 places, 252 transitions, 1271 flow [2023-11-29 22:20:51,894 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.75) internal successors, (878), 8 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:51,894 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:20:51,895 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:20:51,895 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 22:20:51,895 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 22:20:51,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:20:51,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1530771031, now seen corresponding path program 1 times [2023-11-29 22:20:51,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:20:51,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255879947] [2023-11-29 22:20:51,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:20:51,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:20:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:20:52,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 22:20:52,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:20:52,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255879947] [2023-11-29 22:20:52,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255879947] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:20:52,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562318682] [2023-11-29 22:20:52,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:20:52,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:20:52,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:20:52,268 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 22:20:52,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 22:20:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:20:52,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 22:20:52,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:20:52,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 22:20:52,772 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:20:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 22:20:53,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562318682] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 22:20:53,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 22:20:53,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2023-11-29 22:20:53,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107168733] [2023-11-29 22:20:53,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:20:53,048 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 22:20:53,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:20:53,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 22:20:53,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2023-11-29 22:20:53,052 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 201 [2023-11-29 22:20:53,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 252 transitions, 1271 flow. Second operand has 9 states, 9 states have (on average 136.55555555555554) internal successors, (1229), 9 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:53,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:20:53,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 201 [2023-11-29 22:20:53,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:20:53,817 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([903] L68-5-->L69: Formula: (< |v_thread3Thread1of1ForFork0_~i~2#1_3| v_~N~0_4) InVars {thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_3|, ~N~0=v_~N~0_4} OutVars{thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_3|, ~N~0=v_~N~0_4} AuxVars[] AssignedVars[][241], [thread1Thread1of1ForFork1InUse, thread3Thread1of1ForFork0InUse, 1233#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork2_~i~1#1| 1) ~N~0) (<= (+ |thread3Thread1of1ForFork0_~i~2#1| 1) ~N~0)), thread2Thread1of1ForFork2InUse, 85#L69true, 164#L48-4true, 233#true, 13#L59true, 198#true, 19#L91-4true, 215#true]) [2023-11-29 22:20:53,817 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2023-11-29 22:20:53,817 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-29 22:20:53,817 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-29 22:20:53,817 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-29 22:20:53,817 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([904] L68-5-->L68-6: Formula: (<= v_~N~0_3 |v_thread3Thread1of1ForFork0_~i~2#1_5|) InVars {thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_5|, ~N~0=v_~N~0_3} OutVars{thread3Thread1of1ForFork0_~i~2#1=|v_thread3Thread1of1ForFork0_~i~2#1_5|, ~N~0=v_~N~0_3} AuxVars[] AssignedVars[][242], [thread1Thread1of1ForFork1InUse, 183#L68-6true, thread3Thread1of1ForFork0InUse, thread2Thread1of1ForFork2InUse, 164#L48-4true, 233#true, 13#L59true, 198#true, 19#L91-4true, 1225#(and (<= 1 ~N~0) (<= (+ |thread2Thread1of1ForFork2_~i~1#1| 1) ~N~0)), 215#true]) [2023-11-29 22:20:53,818 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2023-11-29 22:20:53,818 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-29 22:20:53,818 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-29 22:20:53,818 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-29 22:20:54,335 INFO L124 PetriNetUnfolderBase]: 3046/5724 cut-off events. [2023-11-29 22:20:54,335 INFO L125 PetriNetUnfolderBase]: For 9683/10964 co-relation queries the response was YES. [2023-11-29 22:20:54,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18102 conditions, 5724 events. 3046/5724 cut-off events. For 9683/10964 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 42218 event pairs, 837 based on Foata normal form. 10/4607 useless extension candidates. Maximal degree in co-relation 16936. Up to 3099 conditions per place. [2023-11-29 22:20:54,397 INFO L140 encePairwiseOnDemand]: 179/201 looper letters, 182 selfloop transitions, 22 changer transitions 58/380 dead transitions. [2023-11-29 22:20:54,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 380 transitions, 2678 flow [2023-11-29 22:20:54,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 22:20:54,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-29 22:20:54,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1858 transitions. [2023-11-29 22:20:54,402 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7110600841944126 [2023-11-29 22:20:54,402 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1858 transitions. [2023-11-29 22:20:54,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1858 transitions. [2023-11-29 22:20:54,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:20:54,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1858 transitions. [2023-11-29 22:20:54,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 142.92307692307693) internal successors, (1858), 13 states have internal predecessors, (1858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:54,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 201.0) internal successors, (2814), 14 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:54,412 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 201.0) internal successors, (2814), 14 states have internal predecessors, (2814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:54,413 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, 36 predicate places. [2023-11-29 22:20:54,413 INFO L500 AbstractCegarLoop]: Abstraction has has 217 places, 380 transitions, 2678 flow [2023-11-29 22:20:54,414 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 136.55555555555554) internal successors, (1229), 9 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:54,414 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:20:54,414 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:20:54,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 22:20:54,620 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:20:54,621 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 22:20:54,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:20:54,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1117846033, now seen corresponding path program 2 times [2023-11-29 22:20:54,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:20:54,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448474856] [2023-11-29 22:20:54,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:20:54,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:20:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:20:54,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 22:20:54,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:20:54,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448474856] [2023-11-29 22:20:54,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448474856] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:20:54,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266661987] [2023-11-29 22:20:54,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 22:20:54,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:20:54,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:20:54,885 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 22:20:54,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 22:20:55,007 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 22:20:55,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 22:20:55,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 22:20:55,013 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:20:55,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 22:20:55,166 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 22:20:55,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266661987] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 22:20:55,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 22:20:55,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2023-11-29 22:20:55,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632818820] [2023-11-29 22:20:55,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:20:55,167 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 22:20:55,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:20:55,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 22:20:55,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2023-11-29 22:20:55,169 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 201 [2023-11-29 22:20:55,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 380 transitions, 2678 flow. Second operand has 6 states, 6 states have (on average 131.16666666666666) internal successors, (787), 6 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:55,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:20:55,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 201 [2023-11-29 22:20:55,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:20:56,231 INFO L124 PetriNetUnfolderBase]: 2950/5509 cut-off events. [2023-11-29 22:20:56,231 INFO L125 PetriNetUnfolderBase]: For 12914/14413 co-relation queries the response was YES. [2023-11-29 22:20:56,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21250 conditions, 5509 events. 2950/5509 cut-off events. For 12914/14413 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 38781 event pairs, 662 based on Foata normal form. 17/4566 useless extension candidates. Maximal degree in co-relation 19923. Up to 3047 conditions per place. [2023-11-29 22:20:56,356 INFO L140 encePairwiseOnDemand]: 192/201 looper letters, 222 selfloop transitions, 17 changer transitions 53/419 dead transitions. [2023-11-29 22:20:56,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 419 transitions, 3615 flow [2023-11-29 22:20:56,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 22:20:56,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 22:20:56,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1053 transitions. [2023-11-29 22:20:56,359 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6548507462686567 [2023-11-29 22:20:56,359 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1053 transitions. [2023-11-29 22:20:56,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1053 transitions. [2023-11-29 22:20:56,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:20:56,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1053 transitions. [2023-11-29 22:20:56,363 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 131.625) internal successors, (1053), 8 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:56,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 201.0) internal successors, (1809), 9 states have internal predecessors, (1809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:56,366 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 201.0) internal successors, (1809), 9 states have internal predecessors, (1809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:56,368 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, 41 predicate places. [2023-11-29 22:20:56,368 INFO L500 AbstractCegarLoop]: Abstraction has has 222 places, 419 transitions, 3615 flow [2023-11-29 22:20:56,369 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.16666666666666) internal successors, (787), 6 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:56,369 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:20:56,369 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:20:56,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 22:20:56,574 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:20:56,575 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 22:20:56,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:20:56,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1757443019, now seen corresponding path program 1 times [2023-11-29 22:20:56,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:20:56,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177343060] [2023-11-29 22:20:56,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:20:56,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:20:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:20:56,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 22:20:56,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:20:56,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177343060] [2023-11-29 22:20:56,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177343060] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:20:56,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422970457] [2023-11-29 22:20:56,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:20:56,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:20:56,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:20:56,735 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 22:20:56,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 22:20:56,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:20:56,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 22:20:56,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:20:56,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 22:20:56,975 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:20:57,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 22:20:57,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422970457] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 22:20:57,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 22:20:57,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-11-29 22:20:57,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965054704] [2023-11-29 22:20:57,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 22:20:57,133 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 22:20:57,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:20:57,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 22:20:57,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-11-29 22:20:57,134 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 201 [2023-11-29 22:20:57,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 419 transitions, 3615 flow. Second operand has 7 states, 7 states have (on average 145.42857142857142) internal successors, (1018), 7 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:57,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:20:57,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 201 [2023-11-29 22:20:57,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:20:57,840 INFO L124 PetriNetUnfolderBase]: 2209/4254 cut-off events. [2023-11-29 22:20:57,841 INFO L125 PetriNetUnfolderBase]: For 13348/16952 co-relation queries the response was YES. [2023-11-29 22:20:57,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17998 conditions, 4254 events. 2209/4254 cut-off events. For 13348/16952 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 28125 event pairs, 440 based on Foata normal form. 66/3713 useless extension candidates. Maximal degree in co-relation 15569. Up to 2249 conditions per place. [2023-11-29 22:20:57,890 INFO L140 encePairwiseOnDemand]: 183/201 looper letters, 222 selfloop transitions, 18 changer transitions 52/444 dead transitions. [2023-11-29 22:20:57,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 444 transitions, 4373 flow [2023-11-29 22:20:57,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 22:20:57,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 22:20:57,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1049 transitions. [2023-11-29 22:20:57,893 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7455579246624022 [2023-11-29 22:20:57,893 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1049 transitions. [2023-11-29 22:20:57,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1049 transitions. [2023-11-29 22:20:57,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:20:57,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1049 transitions. [2023-11-29 22:20:57,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 149.85714285714286) internal successors, (1049), 7 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:57,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:57,899 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 201.0) internal successors, (1608), 8 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:57,899 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, 46 predicate places. [2023-11-29 22:20:57,899 INFO L500 AbstractCegarLoop]: Abstraction has has 227 places, 444 transitions, 4373 flow [2023-11-29 22:20:57,900 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 145.42857142857142) internal successors, (1018), 7 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:20:57,900 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:20:57,900 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:20:57,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 22:20:58,106 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:20:58,106 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 22:20:58,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:20:58,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1801504142, now seen corresponding path program 1 times [2023-11-29 22:20:58,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:20:58,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804267138] [2023-11-29 22:20:58,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:20:58,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:20:58,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:21:01,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:21:01,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:21:01,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804267138] [2023-11-29 22:21:01,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804267138] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:21:01,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467625052] [2023-11-29 22:21:01,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:21:01,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:21:01,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:21:01,863 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 22:21:01,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 22:21:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:21:02,004 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 84 conjunts are in the unsatisfiable core [2023-11-29 22:21:02,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:21:02,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 22:21:02,499 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 22:21:02,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 22:21:03,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 22:21:04,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 22:21:04,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 22:21:05,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 22:21:05,042 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 22:21:05,043 INFO L378 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 22 treesize of output 20 [2023-11-29 22:21:05,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:21:05,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 81 [2023-11-29 22:21:05,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:21:05,526 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:21:09,441 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:21:09,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 76 [2023-11-29 22:21:09,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:21:09,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 149494 treesize of output 133178 [2023-11-29 22:21:09,919 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:21:09,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2070 treesize of output 1694 [2023-11-29 22:21:10,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:21:10,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1686 treesize of output 1422 [2023-11-29 22:21:10,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:21:10,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1366 treesize of output 1262 [2023-11-29 22:21:42,965 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:21:43,008 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:21:43,044 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:21:47,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-29 22:21:47,243 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:21:47,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467625052] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 22:21:47,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 22:21:47,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 36] total 95 [2023-11-29 22:21:47,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916445332] [2023-11-29 22:21:47,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 22:21:47,245 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2023-11-29 22:21:47,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:21:47,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2023-11-29 22:21:47,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=497, Invalid=8323, Unknown=110, NotChecked=0, Total=8930 [2023-11-29 22:21:47,253 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 201 [2023-11-29 22:21:47,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 444 transitions, 4373 flow. Second operand has 95 states, 95 states have (on average 49.37894736842105) internal successors, (4691), 95 states have internal predecessors, (4691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:21:47,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:21:47,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 201 [2023-11-29 22:21:47,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:21:55,179 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (+ |c_#StackHeapBarrier| 1))) (let ((.cse10 (<= .cse17 |c_ULTIMATE.start_main_~#t1~0#1.base|)) (.cse0 (< c_~M~0 0)) (.cse6 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (.cse1 (= c_~res2~0 0)) (.cse2 (= c_~res1~0 0)) (.cse4 (= c_~A~0.offset 0)) (.cse5 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| c_~A~0.base))) (.cse3 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (.cse11 (<= .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base|)) (.cse13 (< 1 c_~N~0)) (.cse12 (<= .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base|))) (and (or .cse0 (and .cse1 (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse2 .cse3 .cse4 .cse5 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) .cse6 (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int)) (v_ArrVal_211 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (or (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_211) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_212))) (= (let ((.cse7 (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213)) (.cse8 (* ~M~0 4))) (+ c_~res2~0 (select (select .cse7 |c_ULTIMATE.start_main_#t~ret19#1.base|) (+ .cse8 |c_ULTIMATE.start_main_#t~ret19#1.offset|)) (select (select .cse7 c_~A~0.base) (+ c_~A~0.offset .cse8)))) (+ (select (select .cse9 c_~A~0.base) c_~A~0.offset) c_~res1~0 (select (select .cse9 |c_ULTIMATE.start_main_#t~ret19#1.base|) |c_ULTIMATE.start_main_#t~ret19#1.offset|)))) (< 0 ~M~0) (< (+ ~M~0 1) c_~N~0))) .cse1 (or .cse0 (and .cse1 .cse10 .cse2 .cse4 .cse5 .cse11 .cse12)) (or (and .cse1 .cse2 (not (= |c_ULTIMATE.start_main_#t~ret19#1.base| |c_ULTIMATE.start_main_~#t1~0#1.base|)) .cse4 .cse5 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_#t~ret19#1.base|)) (not (= |c_ULTIMATE.start_main_#t~ret19#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|))) .cse0) .cse10 (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (or (< 0 (+ c_~M~0 1)) (< 0 c_~N~0)) .cse2 (= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 c_~N~0) (= |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| c_~N~0) (or .cse13 .cse5) (or .cse13 .cse3) (or .cse0 (and .cse6 .cse1 .cse2 (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) .cse4 .cse5 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)))) (or (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_main_~#t3~0#1.base| 1)) .cse13) .cse3 (= (select |c_#valid| |c_ULTIMATE.start_main_~#t3~0#1.base|) 1) (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int)) (v_ArrVal_211 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (or (< 0 ~M~0) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_211) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_212))) (= (+ (select (select .cse14 c_~A~0.base) c_~A~0.offset) (select (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~res1~0) (let ((.cse15 (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213)) (.cse16 (* ~M~0 4))) (+ (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ .cse16 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~res2~0 (select (select .cse15 c_~A~0.base) (+ c_~A~0.offset .cse16)))))) (< (+ ~M~0 1) c_~N~0))) (= c_~N~0 1) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse11 (or (= c_~res2~0 c_~res1~0) .cse13) (= |c_ULTIMATE.start_main_#t~ret19#1.offset| 0) .cse12))) is different from false [2023-11-29 22:22:04,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:22:06,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:22:10,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:22:15,417 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (= c_~res2~0 c_~res1~0))) (and (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (or (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_212))) (= (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213)) (.cse1 (* ~M~0 4))) (+ (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset .cse1)) c_~res2~0 (select (select .cse0 c_~B~0.base) (+ .cse1 c_~B~0.offset)))) (+ c_~res1~0 (select (select .cse2 c_~A~0.base) c_~A~0.offset) (select (select .cse2 c_~B~0.base) c_~B~0.offset)))) (< 0 ~M~0) (< (+ ~M~0 1) c_~N~0))) .cse3 (<= |c_thread3Thread1of1ForFork0_~i~2#1| 0) (= c_~N~0 1) (forall ((~M~0 Int) (v_ArrVal_212 (Array Int Int)) (v_ArrVal_211 (Array Int Int)) (v_ArrVal_213 (Array Int Int))) (or (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_211) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_212))) (= (let ((.cse4 (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_213)) (.cse5 (* ~M~0 4))) (+ (select (select .cse4 c_~B~0.base) (+ .cse5 c_~B~0.offset)) c_~res2~0 (select (select .cse4 c_~A~0.base) (+ c_~A~0.offset .cse5)))) (+ (select (select .cse6 c_~B~0.base) c_~B~0.offset) (select (select .cse6 c_~A~0.base) c_~A~0.offset) c_~res1~0))) (< 0 ~M~0) (< (+ ~M~0 1) c_~N~0))) (or .cse3 (not (= 0 |c_thread3Thread1of1ForFork0_~i~2#1|))))) is different from false [2023-11-29 22:22:17,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:22:20,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:22:27,771 INFO L124 PetriNetUnfolderBase]: 16950/27161 cut-off events. [2023-11-29 22:22:27,771 INFO L125 PetriNetUnfolderBase]: For 65472/65545 co-relation queries the response was YES. [2023-11-29 22:22:27,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125606 conditions, 27161 events. 16950/27161 cut-off events. For 65472/65545 co-relation queries the response was YES. Maximal size of possible extension queue 1267. Compared 210056 event pairs, 2062 based on Foata normal form. 10/24619 useless extension candidates. Maximal degree in co-relation 78637. Up to 12210 conditions per place. [2023-11-29 22:22:28,099 INFO L140 encePairwiseOnDemand]: 121/201 looper letters, 1472 selfloop transitions, 796 changer transitions 106/2414 dead transitions. [2023-11-29 22:22:28,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 2414 transitions, 29455 flow [2023-11-29 22:22:28,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2023-11-29 22:22:28,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2023-11-29 22:22:28,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 8962 transitions. [2023-11-29 22:22:28,125 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.26382878506873914 [2023-11-29 22:22:28,126 INFO L72 ComplementDD]: Start complementDD. Operand 169 states and 8962 transitions. [2023-11-29 22:22:28,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 8962 transitions. [2023-11-29 22:22:28,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:22:28,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 169 states and 8962 transitions. [2023-11-29 22:22:28,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 170 states, 169 states have (on average 53.02958579881657) internal successors, (8962), 169 states have internal predecessors, (8962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:22:28,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 170 states, 170 states have (on average 201.0) internal successors, (34170), 170 states have internal predecessors, (34170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:22:28,208 INFO L81 ComplementDD]: Finished complementDD. Result has 170 states, 170 states have (on average 201.0) internal successors, (34170), 170 states have internal predecessors, (34170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:22:28,209 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, 214 predicate places. [2023-11-29 22:22:28,209 INFO L500 AbstractCegarLoop]: Abstraction has has 395 places, 2414 transitions, 29455 flow [2023-11-29 22:22:28,211 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 95 states have (on average 49.37894736842105) internal successors, (4691), 95 states have internal predecessors, (4691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:22:28,211 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:22:28,211 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:22:28,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 22:22:28,420 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:22:28,420 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 22:22:28,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:22:28,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1975067556, now seen corresponding path program 2 times [2023-11-29 22:22:28,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:22:28,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964863817] [2023-11-29 22:22:28,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:22:28,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:22:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:22:32,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:22:32,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:22:32,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964863817] [2023-11-29 22:22:32,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964863817] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:22:32,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291145015] [2023-11-29 22:22:32,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 22:22:32,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:22:32,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:22:32,152 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 22:22:32,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 22:22:32,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 22:22:32,512 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 22:22:32,514 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 75 conjunts are in the unsatisfiable core [2023-11-29 22:22:32,519 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:22:33,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 22:22:34,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 22:22:34,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 22:22:34,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 22:22:34,786 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 22:22:34,786 INFO L378 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 22 treesize of output 20 [2023-11-29 22:22:34,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 22:22:34,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 22:22:34,902 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 22:22:34,903 INFO L378 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 22 treesize of output 20 [2023-11-29 22:22:35,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:22:35,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 81 [2023-11-29 22:22:35,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:22:35,355 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:22:36,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:22:36,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 70 [2023-11-29 22:22:37,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:22:37,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 19190 treesize of output 16186 [2023-11-29 22:22:37,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:22:37,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2006 treesize of output 1822 [2023-11-29 22:22:37,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:22:37,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1814 treesize of output 1438 [2023-11-29 22:22:37,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:22:37,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1430 treesize of output 1262 [2023-11-29 22:22:42,856 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:42,929 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:43,476 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:45,121 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:45,150 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:45,161 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:22:45,207 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:45,315 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:45,347 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:45,543 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:45,788 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:45,818 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:45,831 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:22:45,880 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:45,978 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:46,003 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:46,137 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:46,389 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:46,403 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:49,025 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:49,176 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:22:49,215 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:49,266 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:49,274 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:49,507 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:49,665 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:49,678 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:22:49,709 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:22:49,801 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-29 22:22:49,814 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:22:49,880 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:49,901 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:49,919 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:22:49,944 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:49,950 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:49,990 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:50,017 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:50,029 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:50,078 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:50,102 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:22:50,164 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-29 22:22:50,184 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:50,277 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:50,284 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:50,341 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:50,424 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:22:50,470 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:50,528 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:50,542 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:51,778 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:22:51,808 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:22:51,858 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:51,888 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:52,678 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:52,844 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-29 22:22:52,852 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:22:52,930 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:22:52,951 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:22:52,984 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:22:53,054 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-29 22:22:53,145 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:53,154 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:22:53,161 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:53,214 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:53,220 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:53,281 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:53,434 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:53,463 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:53,523 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:53,544 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:53,591 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:53,802 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:53,831 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:22:53,839 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:54,022 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:22:54,052 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:22:54,073 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:54,141 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:22:54,155 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:22:54,242 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:22:54,850 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:54,922 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:54,988 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:55,010 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:22:55,084 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:55,122 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:55,202 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:22:55,444 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-29 22:22:55,463 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-29 22:22:55,484 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-29 22:22:55,540 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:22:55,560 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:55,828 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:56,597 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:56,636 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:57,117 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:57,418 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:22:58,232 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:58,257 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:22:58,457 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:22:58,486 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:22:58,524 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:22:58,554 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:22:58,651 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-29 22:22:58,778 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-29 22:22:59,096 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-29 22:22:59,232 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:22:59,303 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:22:59,352 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:22:59,404 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:22:59,561 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-11-29 22:23:01,135 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-11-29 22:23:01,821 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-29 22:23:02,158 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-29 22:23:02,275 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:02,344 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:02,485 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:02,519 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:03,093 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:03,116 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:03,162 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:03,192 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:03,249 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:03,309 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:03,329 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:03,371 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:03,396 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:06,261 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:06,313 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:06,396 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:06,417 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:06,446 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:06,785 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:06,798 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:07,173 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:07,377 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:07,405 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:07,454 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:07,460 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:07,497 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:09,466 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:11,504 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:11,628 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:11,767 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:11,885 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:11,916 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-29 22:23:11,974 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:11,994 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:12,011 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:12,110 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:12,138 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:12,151 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:12,214 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:12,224 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:12,467 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:12,515 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:12,658 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:12,993 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:13,070 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:13,164 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:13,306 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:13,343 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:13,490 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:13,523 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:13,669 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:13,694 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:13,793 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:13,850 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:13,912 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:14,070 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:14,270 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:14,485 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:14,823 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:14,847 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:14,911 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:14,919 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:19,645 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:19,673 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:19,833 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:20,043 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:20,170 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:21,018 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:21,350 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:21,392 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:21,401 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:21,465 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:21,588 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:21,622 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:21,796 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:23,021 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:23,039 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:23,058 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:23,472 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:23,495 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:23,575 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:23,584 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:24,143 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:24,154 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:24,214 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:24,270 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-29 22:23:24,309 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-29 22:23:24,393 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:24,405 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:24,411 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:24,511 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:24,605 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:24,617 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:24,638 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:24,646 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:25,004 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:25,427 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:25,503 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:25,515 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:25,532 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-29 22:23:25,573 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:25,699 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:25,707 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:25,809 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:25,936 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:26,028 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:30,976 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:31,017 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:31,134 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:31,199 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:31,230 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:31,264 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:31,952 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:32,027 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:32,154 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:32,192 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:32,209 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:32,225 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:34,923 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:35,000 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:35,560 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:35,622 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:35,732 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:35,759 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:35,858 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:36,044 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:37,242 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:37,272 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:37,401 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:37,436 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:37,509 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:37,579 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:37,715 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:37,807 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-29 22:23:37,926 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:38,038 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:38,130 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:38,244 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:38,315 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:38,382 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:38,400 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:38,536 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:38,614 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:38,646 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:38,680 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:38,731 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:38,807 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:38,963 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:39,056 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:39,143 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:39,210 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-11-29 22:23:39,317 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-29 22:23:39,420 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:39,491 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:39,601 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:39,675 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:39,769 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:39,878 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:39,933 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-29 22:23:40,051 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:40,078 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:40,136 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:40,213 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:40,315 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:40,386 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:40,403 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:40,482 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:40,567 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:40,980 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:41,052 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:41,142 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:41,312 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:41,380 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:41,530 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:41,554 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:41,705 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:41,802 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-11-29 22:23:41,906 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:41,955 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:42,049 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:42,085 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:42,097 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:42,111 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:42,125 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:42,196 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:42,287 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:42,402 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:42,442 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:43,816 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:43,830 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:43,867 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:43,898 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:43,932 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:43,962 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:44,111 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:44,151 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:44,251 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:44,308 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:44,330 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:44,341 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:44,482 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:44,683 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:44,753 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:44,766 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:44,879 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:45,034 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:45,073 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:45,224 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:45,330 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:45,447 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:45,523 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:45,568 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:45,586 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:45,680 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:45,710 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:45,930 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:46,211 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:46,279 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:46,359 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:46,783 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:47,124 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:47,364 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:47,454 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:47,618 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:47,929 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:48,177 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-11-29 22:23:48,245 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:48,412 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:48,438 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:48,533 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:48,809 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:49,163 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:49,509 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:49,612 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:49,625 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:49,649 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:49,673 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-11-29 22:23:49,808 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:23:49,836 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-11-29 22:23:49,958 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-11-29 22:24:12,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:24:12,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291145015] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 22:24:12,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 22:24:12,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 36, 34] total 94 [2023-11-29 22:24:12,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298609321] [2023-11-29 22:24:12,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 22:24:12,175 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2023-11-29 22:24:12,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:24:12,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2023-11-29 22:24:12,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=984, Invalid=7714, Unknown=44, NotChecked=0, Total=8742 [2023-11-29 22:24:12,184 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 201 [2023-11-29 22:24:12,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 2414 transitions, 29455 flow. Second operand has 94 states, 94 states have (on average 49.52127659574468) internal successors, (4655), 94 states have internal predecessors, (4655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:24:12,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:24:12,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 201 [2023-11-29 22:24:12,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:24:41,472 INFO L124 PetriNetUnfolderBase]: 30146/47702 cut-off events. [2023-11-29 22:24:41,472 INFO L125 PetriNetUnfolderBase]: For 120393/122814 co-relation queries the response was YES. [2023-11-29 22:24:41,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268872 conditions, 47702 events. 30146/47702 cut-off events. For 120393/122814 co-relation queries the response was YES. Maximal size of possible extension queue 2197. Compared 391023 event pairs, 1104 based on Foata normal form. 176/43422 useless extension candidates. Maximal degree in co-relation 155235. Up to 22107 conditions per place. [2023-11-29 22:24:42,011 INFO L140 encePairwiseOnDemand]: 131/201 looper letters, 3549 selfloop transitions, 2090 changer transitions 166/5845 dead transitions. [2023-11-29 22:24:42,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 558 places, 5845 transitions, 82523 flow [2023-11-29 22:24:42,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2023-11-29 22:24:42,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2023-11-29 22:24:42,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 8698 transitions. [2023-11-29 22:24:42,024 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.2638636087853416 [2023-11-29 22:24:42,024 INFO L72 ComplementDD]: Start complementDD. Operand 164 states and 8698 transitions. [2023-11-29 22:24:42,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 164 states and 8698 transitions. [2023-11-29 22:24:42,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:24:42,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 164 states and 8698 transitions. [2023-11-29 22:24:42,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 165 states, 164 states have (on average 53.03658536585366) internal successors, (8698), 164 states have internal predecessors, (8698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:24:42,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 165 states, 165 states have (on average 201.0) internal successors, (33165), 165 states have internal predecessors, (33165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:24:42,244 INFO L81 ComplementDD]: Finished complementDD. Result has 165 states, 165 states have (on average 201.0) internal successors, (33165), 165 states have internal predecessors, (33165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:24:42,244 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, 377 predicate places. [2023-11-29 22:24:42,244 INFO L500 AbstractCegarLoop]: Abstraction has has 558 places, 5845 transitions, 82523 flow [2023-11-29 22:24:42,245 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 94 states have (on average 49.52127659574468) internal successors, (4655), 94 states have internal predecessors, (4655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:24:42,246 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:24:42,246 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:24:42,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-29 22:24:42,450 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:24:42,451 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 22:24:42,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:24:42,452 INFO L85 PathProgramCache]: Analyzing trace with hash -981762382, now seen corresponding path program 3 times [2023-11-29 22:24:42,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:24:42,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876389812] [2023-11-29 22:24:42,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:24:42,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:24:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:24:43,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:24:43,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:24:43,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876389812] [2023-11-29 22:24:43,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876389812] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:24:43,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465875550] [2023-11-29 22:24:43,832 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 22:24:43,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:24:43,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:24:43,833 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 22:24:43,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 22:24:44,102 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-11-29 22:24:44,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 22:24:44,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-29 22:24:44,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:24:45,529 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 22:24:45,545 INFO L349 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2023-11-29 22:24:45,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 25 [2023-11-29 22:24:45,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:24:45,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:24:45,913 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:24:45,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 86 [2023-11-29 22:24:46,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:24:46,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465875550] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 22:24:46,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 22:24:46,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32, 22] total 66 [2023-11-29 22:24:46,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360216259] [2023-11-29 22:24:46,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 22:24:46,790 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-11-29 22:24:46,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:24:46,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-11-29 22:24:46,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=576, Invalid=3714, Unknown=0, NotChecked=0, Total=4290 [2023-11-29 22:24:46,797 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 201 [2023-11-29 22:24:46,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 5845 transitions, 82523 flow. Second operand has 66 states, 66 states have (on average 64.34848484848484) internal successors, (4247), 66 states have internal predecessors, (4247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:24:46,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:24:46,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 201 [2023-11-29 22:24:46,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:25:34,143 INFO L124 PetriNetUnfolderBase]: 49043/76378 cut-off events. [2023-11-29 22:25:34,143 INFO L125 PetriNetUnfolderBase]: For 216229/221099 co-relation queries the response was YES. [2023-11-29 22:25:34,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500462 conditions, 76378 events. 49043/76378 cut-off events. For 216229/221099 co-relation queries the response was YES. Maximal size of possible extension queue 3538. Compared 648053 event pairs, 1832 based on Foata normal form. 238/70196 useless extension candidates. Maximal degree in co-relation 300758. Up to 37732 conditions per place. [2023-11-29 22:25:35,002 INFO L140 encePairwiseOnDemand]: 136/201 looper letters, 6485 selfloop transitions, 3850 changer transitions 236/10623 dead transitions. [2023-11-29 22:25:35,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 674 places, 10623 transitions, 166472 flow [2023-11-29 22:25:35,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2023-11-29 22:25:35,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2023-11-29 22:25:35,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 7841 transitions. [2023-11-29 22:25:35,012 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.3334183781944976 [2023-11-29 22:25:35,013 INFO L72 ComplementDD]: Start complementDD. Operand 117 states and 7841 transitions. [2023-11-29 22:25:35,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 7841 transitions. [2023-11-29 22:25:35,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:25:35,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 117 states and 7841 transitions. [2023-11-29 22:25:35,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 118 states, 117 states have (on average 67.01709401709402) internal successors, (7841), 117 states have internal predecessors, (7841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:25:35,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 118 states, 118 states have (on average 201.0) internal successors, (23718), 118 states have internal predecessors, (23718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:25:35,060 INFO L81 ComplementDD]: Finished complementDD. Result has 118 states, 118 states have (on average 201.0) internal successors, (23718), 118 states have internal predecessors, (23718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:25:35,061 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, 493 predicate places. [2023-11-29 22:25:35,061 INFO L500 AbstractCegarLoop]: Abstraction has has 674 places, 10623 transitions, 166472 flow [2023-11-29 22:25:35,062 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 64.34848484848484) internal successors, (4247), 66 states have internal predecessors, (4247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:25:35,062 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:25:35,062 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:25:35,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 22:25:35,272 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:25:35,273 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 22:25:35,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:25:35,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1634655178, now seen corresponding path program 4 times [2023-11-29 22:25:35,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:25:35,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700678620] [2023-11-29 22:25:35,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:25:35,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:25:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:25:36,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:25:36,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:25:36,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700678620] [2023-11-29 22:25:36,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700678620] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:25:36,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456665315] [2023-11-29 22:25:36,723 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 22:25:36,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:25:36,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:25:36,724 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 22:25:36,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 22:25:36,862 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 22:25:36,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 22:25:36,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-29 22:25:36,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:25:37,977 INFO L349 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-11-29 22:25:37,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 43 [2023-11-29 22:25:38,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:25:38,064 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:25:38,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:25:38,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 86 [2023-11-29 22:25:38,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 22:25:38,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456665315] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 22:25:38,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 22:25:38,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 20] total 53 [2023-11-29 22:25:38,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850851150] [2023-11-29 22:25:38,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 22:25:38,946 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-11-29 22:25:38,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:25:38,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-11-29 22:25:38,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=2381, Unknown=0, NotChecked=0, Total=2756 [2023-11-29 22:25:38,951 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 201 [2023-11-29 22:25:38,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 674 places, 10623 transitions, 166472 flow. Second operand has 53 states, 53 states have (on average 71.18867924528301) internal successors, (3773), 53 states have internal predecessors, (3773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:25:38,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:25:38,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 201 [2023-11-29 22:25:38,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:27:09,258 INFO L124 PetriNetUnfolderBase]: 57969/90219 cut-off events. [2023-11-29 22:27:09,258 INFO L125 PetriNetUnfolderBase]: For 338032/346808 co-relation queries the response was YES. [2023-11-29 22:27:09,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 653337 conditions, 90219 events. 57969/90219 cut-off events. For 338032/346808 co-relation queries the response was YES. Maximal size of possible extension queue 4203. Compared 778184 event pairs, 2344 based on Foata normal form. 366/82898 useless extension candidates. Maximal degree in co-relation 390978. Up to 46182 conditions per place. [2023-11-29 22:27:10,450 INFO L140 encePairwiseOnDemand]: 141/201 looper letters, 6975 selfloop transitions, 3166 changer transitions 312/12337 dead transitions. [2023-11-29 22:27:10,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 774 places, 12337 transitions, 214845 flow [2023-11-29 22:27:10,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2023-11-29 22:27:10,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2023-11-29 22:27:10,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 7390 transitions. [2023-11-29 22:27:10,459 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.3640214767745431 [2023-11-29 22:27:10,459 INFO L72 ComplementDD]: Start complementDD. Operand 101 states and 7390 transitions. [2023-11-29 22:27:10,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 101 states and 7390 transitions. [2023-11-29 22:27:10,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 22:27:10,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 101 states and 7390 transitions. [2023-11-29 22:27:10,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 102 states, 101 states have (on average 73.16831683168317) internal successors, (7390), 101 states have internal predecessors, (7390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:27:10,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 102 states, 102 states have (on average 201.0) internal successors, (20502), 102 states have internal predecessors, (20502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:27:10,484 INFO L81 ComplementDD]: Finished complementDD. Result has 102 states, 102 states have (on average 201.0) internal successors, (20502), 102 states have internal predecessors, (20502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:27:10,484 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, 593 predicate places. [2023-11-29 22:27:10,485 INFO L500 AbstractCegarLoop]: Abstraction has has 774 places, 12337 transitions, 214845 flow [2023-11-29 22:27:10,485 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 71.18867924528301) internal successors, (3773), 53 states have internal predecessors, (3773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:27:10,485 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 22:27:10,485 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 22:27:10,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-29 22:27:10,691 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:27:10,692 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-29 22:27:10,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 22:27:10,692 INFO L85 PathProgramCache]: Analyzing trace with hash -22925272, now seen corresponding path program 5 times [2023-11-29 22:27:10,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 22:27:10,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086655979] [2023-11-29 22:27:10,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 22:27:10,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 22:27:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 22:27:12,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:27:12,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 22:27:12,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086655979] [2023-11-29 22:27:12,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086655979] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 22:27:12,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007438702] [2023-11-29 22:27:12,768 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 22:27:12,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 22:27:12,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 22:27:12,776 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 22:27:12,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 22:27:12,902 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-29 22:27:12,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 22:27:12,904 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 78 conjunts are in the unsatisfiable core [2023-11-29 22:27:12,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 22:27:13,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 22:27:13,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 22:27:14,253 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 22:27:14,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-29 22:27:14,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 22:27:14,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 22:27:15,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 22:27:15,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 22:27:15,552 INFO L349 Elim1Store]: treesize reduction 24, result has 57.9 percent of original size [2023-11-29 22:27:15,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 43 [2023-11-29 22:27:15,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:27:15,667 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 22:27:15,942 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_384 (Array Int Int)) (~B~0.base Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_384))) (let ((.cse0 (select .cse4 ~B~0.base)) (.cse2 (select .cse4 c_~A~0.base))) (= (let ((.cse1 (* c_~N~0 4))) (+ (select .cse0 (+ .cse1 (- 4) c_~B~0.offset)) c_~res2~0 (select .cse2 (+ c_~A~0.offset .cse1 (- 4))))) (let ((.cse3 (* |c_thread1Thread1of1ForFork1_~i~0#1| 4))) (+ (select .cse0 (+ .cse3 c_~B~0.offset)) c_~res1~0 (select .cse2 (+ .cse3 c_~A~0.offset)))))))) is different from false [2023-11-29 22:27:32,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:27:32,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 95 [2023-11-29 22:27:32,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:27:32,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 15572982 treesize of output 14833722 [2023-11-29 22:27:33,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:27:33,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 8934 treesize of output 8718 [2023-11-29 22:27:33,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:27:33,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 8662 treesize of output 7630 [2023-11-29 22:27:33,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:27:33,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7574 treesize of output 7086 [2023-11-29 22:27:33,588 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 22:27:33,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 7030 treesize of output 4910 [2023-11-29 22:28:10,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-29 22:28:11,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 22:28:11,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007438702] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 22:28:11,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 22:28:11,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 37, 33] total 91 [2023-11-29 22:28:11,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835395673] [2023-11-29 22:28:11,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 22:28:11,230 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2023-11-29 22:28:11,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 22:28:11,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2023-11-29 22:28:11,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1120, Invalid=6733, Unknown=161, NotChecked=176, Total=8190 [2023-11-29 22:28:11,238 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 201 [2023-11-29 22:28:11,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 774 places, 12337 transitions, 214845 flow. Second operand has 91 states, 91 states have (on average 57.34065934065934) internal successors, (5218), 91 states have internal predecessors, (5218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 22:28:11,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 22:28:11,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 201 [2023-11-29 22:28:11,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 22:28:13,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:28:16,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:28:18,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:28:20,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:28:23,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:28:27,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:28:29,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:28:31,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:28:34,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:28:37,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:28:59,340 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse16 (* |c_thread1Thread1of1ForFork1_~i~0#1| 4)) (.cse17 (* c_~N~0 4))) (let ((.cse5 (+ .cse17 (- 4) c_~B~0.offset)) (.cse4 (+ c_~A~0.offset .cse17 (- 4))) (.cse3 (+ .cse16 c_~B~0.offset)) (.cse1 (+ .cse16 c_~A~0.offset)) (.cse9 (< c_~N~0 (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1))) (.cse15 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse13 (and (= c_~res2~0 c_~res1~0) (= |c_thread1Thread1of1ForFork1_~i~0#1| 0))) (.cse14 (+ |c_#StackHeapBarrier| 1))) (and (forall ((~B~0.base Int)) (let ((.cse0 (select |c_#memory_int| c_~A~0.base)) (.cse2 (select |c_#memory_int| ~B~0.base))) (= (+ (select .cse0 .cse1) c_~res1~0 (select .cse2 .cse3)) (+ c_~res2~0 (select .cse0 .cse4) (select .cse2 .cse5))))) (or (forall ((v_ArrVal_384 (Array Int Int)) (v_ArrVal_383 (Array Int Int)) (~B~0.base Int)) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_383) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_384))) (let ((.cse6 (select .cse8 c_~A~0.base)) (.cse7 (select .cse8 ~B~0.base))) (= (+ (select .cse6 .cse1) c_~res1~0 (select .cse7 .cse3)) (+ c_~res2~0 (select .cse6 .cse4) (select .cse7 .cse5)))))) .cse9) (or (forall ((v_ArrVal_384 (Array Int Int)) (~B~0.base Int)) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_384))) (let ((.cse10 (select .cse12 ~B~0.base)) (.cse11 (select .cse12 c_~A~0.base))) (= (+ (select .cse10 .cse5) c_~res2~0 (select .cse11 .cse4)) (+ (select .cse10 .cse3) c_~res1~0 (select .cse11 .cse1)))))) .cse9) (or (< |c_thread3Thread1of1ForFork0_~i~2#1| c_~N~0) .cse13) (= c_~res2~0 0) (<= .cse14 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (= c_~res1~0 0) (<= .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= c_~N~0 1) (= c_~N~0 1) (<= .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base|) (<= .cse15 |c_ULTIMATE.start_main_~#t1~0#1.base|) (or (< (+ |c_thread3Thread1of1ForFork0_#t~post11#1| 1) c_~N~0) .cse13) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (<= .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base|)))) is different from false [2023-11-29 22:29:01,827 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_384 (Array Int Int)) (~B~0.base Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_384))) (let ((.cse1 (select .cse5 ~B~0.base)) (.cse3 (select .cse5 c_~A~0.base))) (= (let ((.cse2 (* c_~N~0 4))) (+ (select .cse1 (+ .cse2 (- 4) c_~B~0.offset)) c_~res2~0 (select .cse3 (+ c_~A~0.offset .cse2 (- 4))))) (let ((.cse4 (* |c_thread1Thread1of1ForFork1_~i~0#1| 4))) (+ (select .cse1 (+ .cse4 c_~B~0.offset)) c_~res1~0 (select .cse3 (+ .cse4 c_~A~0.offset)))))))))) (and (or .cse0 (< c_~N~0 (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1))) (= c_~res2~0 c_~res1~0) .cse0)) is different from false [2023-11-29 22:29:14,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:29:16,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:29:18,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:29:20,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:29:22,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:29:24,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 22:29:26,439 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2023-11-29 22:29:26,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2023-11-29 22:29:26,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-29 22:29:26,641 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 22:29:26,641 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:665) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:269) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1655) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:658) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:515) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:492) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:443) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:296) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:219) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:148) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Broken pipe at java.base/java.io.FileOutputStream.writeBytes(Native Method) at java.base/java.io.FileOutputStream.write(FileOutputStream.java:354) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 36 more [2023-11-29 22:29:26,645 INFO L158 Benchmark]: Toolchain (without parser) took 519112.12ms. Allocated memory was 568.3MB in the beginning and 6.3GB in the end (delta: 5.8GB). Free memory was 517.7MB in the beginning and 2.8GB in the end (delta: -2.2GB). Peak memory consumption was 3.5GB. Max. memory is 16.0GB. [2023-11-29 22:29:26,645 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 354.4MB. Free memory is still 305.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-29 22:29:26,645 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.47ms. Allocated memory is still 568.3MB. Free memory was 517.4MB in the beginning and 505.5MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-29 22:29:26,645 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.58ms. Allocated memory is still 568.3MB. Free memory was 505.5MB in the beginning and 502.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 22:29:26,645 INFO L158 Benchmark]: Boogie Preprocessor took 41.00ms. Allocated memory is still 568.3MB. Free memory was 502.5MB in the beginning and 500.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 22:29:26,646 INFO L158 Benchmark]: RCFGBuilder took 927.66ms. Allocated memory is still 568.3MB. Free memory was 500.4MB in the beginning and 491.9MB in the end (delta: 8.6MB). Peak memory consumption was 31.1MB. Max. memory is 16.0GB. [2023-11-29 22:29:26,646 INFO L158 Benchmark]: TraceAbstraction took 517866.59ms. Allocated memory was 568.3MB in the beginning and 6.3GB in the end (delta: 5.8GB). Free memory was 491.9MB in the beginning and 2.8GB in the end (delta: -2.3GB). Peak memory consumption was 3.5GB. Max. memory is 16.0GB. [2023-11-29 22:29:26,647 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 354.4MB. Free memory is still 305.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 228.47ms. Allocated memory is still 568.3MB. Free memory was 517.4MB in the beginning and 505.5MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 42.58ms. Allocated memory is still 568.3MB. Free memory was 505.5MB in the beginning and 502.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 41.00ms. Allocated memory is still 568.3MB. Free memory was 502.5MB in the beginning and 500.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 927.66ms. Allocated memory is still 568.3MB. Free memory was 500.4MB in the beginning and 491.9MB in the end (delta: 8.6MB). Peak memory consumption was 31.1MB. Max. memory is 16.0GB. * TraceAbstraction took 517866.59ms. Allocated memory was 568.3MB in the beginning and 6.3GB in the end (delta: 5.8GB). Free memory was 491.9MB in the beginning and 2.8GB in the end (delta: -2.3GB). Peak memory consumption was 3.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...