/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:35:33,051 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:35:33,097 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-09 15:35:33,120 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:35:33,120 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:35:33,121 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:35:33,121 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:35:33,121 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:35:33,122 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:35:33,124 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:35:33,124 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:35:33,124 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:35:33,124 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:35:33,125 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:35:33,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:35:33,125 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:35:33,125 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:35:33,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:35:33,126 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:35:33,126 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:35:33,126 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:35:33,129 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:35:33,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:35:33,130 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:35:33,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:35:33,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:35:33,132 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:35:33,133 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:35:33,133 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:35:33,133 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:35:33,133 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:35:33,133 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:35:33,133 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:35:33,133 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-12-09 15:35:33,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:35:33,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:35:33,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:35:33,359 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:35:33,361 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:35:33,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-12-09 15:35:34,478 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:35:34,660 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:35:34,661 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-12-09 15:35:34,666 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b983dda7b/733413c6c66547e1ac322d38906d4dab/FLAGb36a3ffb6 [2023-12-09 15:35:34,676 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b983dda7b/733413c6c66547e1ac322d38906d4dab [2023-12-09 15:35:34,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:35:34,680 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:35:34,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:35:34,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:35:34,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:35:34,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:35:34" (1/1) ... [2023-12-09 15:35:34,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70589c99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:35:34, skipping insertion in model container [2023-12-09 15:35:34,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:35:34" (1/1) ... [2023-12-09 15:35:34,725 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:35:34,835 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-two-queue.wvr.c[3013,3026] [2023-12-09 15:35:34,841 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:35:34,847 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:35:34,865 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-two-queue.wvr.c[3013,3026] [2023-12-09 15:35:34,867 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:35:34,873 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:35:34,873 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:35:34,878 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:35:34,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:35:34 WrapperNode [2023-12-09 15:35:34,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:35:34,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:35:34,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:35:34,879 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:35:34,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:35:34" (1/1) ... [2023-12-09 15:35:34,891 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:35:34" (1/1) ... [2023-12-09 15:35:34,909 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 210 [2023-12-09 15:35:34,910 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:35:34,910 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:35:34,910 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:35:34,910 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:35:34,916 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:35:34" (1/1) ... [2023-12-09 15:35:34,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:35:34" (1/1) ... [2023-12-09 15:35:34,921 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:35:34" (1/1) ... [2023-12-09 15:35:34,921 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:35:34" (1/1) ... [2023-12-09 15:35:34,928 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:35:34" (1/1) ... [2023-12-09 15:35:34,931 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:35:34" (1/1) ... [2023-12-09 15:35:34,932 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:35:34" (1/1) ... [2023-12-09 15:35:34,933 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:35:34" (1/1) ... [2023-12-09 15:35:34,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:35:34,936 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:35:34,936 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:35:34,937 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:35:34,937 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:35:34" (1/1) ... [2023-12-09 15:35:34,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:35:34,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:35:34,962 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-09 15:35:34,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-09 15:35:34,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:35:34,992 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:35:34,992 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:35:34,992 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:35:34,992 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:35:34,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:35:34,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:35:34,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:35:34,993 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-09 15:35:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-09 15:35:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-09 15:35:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:35:34,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:35:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:35:34,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:35:34,995 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-09 15:35:35,080 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:35:35,081 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:35:35,306 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:35:35,409 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:35:35,409 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-09 15:35:35,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:35:35 BoogieIcfgContainer [2023-12-09 15:35:35,411 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:35:35,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:35:35,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:35:35,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:35:35,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:35:34" (1/3) ... [2023-12-09 15:35:35,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23098822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:35:35, skipping insertion in model container [2023-12-09 15:35:35,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:35:34" (2/3) ... [2023-12-09 15:35:35,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23098822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:35:35, skipping insertion in model container [2023-12-09 15:35:35,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:35:35" (3/3) ... [2023-12-09 15:35:35,416 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2023-12-09 15:35:35,427 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:35:35,427 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:35:35,427 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:35:35,493 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-09 15:35:35,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 185 transitions, 384 flow [2023-12-09 15:35:35,641 INFO L124 PetriNetUnfolderBase]: 13/183 cut-off events. [2023-12-09 15:35:35,641 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 15:35:35,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 183 events. 13/183 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 88 event pairs, 0 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 147. Up to 2 conditions per place. [2023-12-09 15:35:35,647 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 185 transitions, 384 flow [2023-12-09 15:35:35,654 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 174 transitions, 360 flow [2023-12-09 15:35:35,669 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:35:35,673 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;@582aa0d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:35:35,673 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-09 15:35:35,718 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:35:35,718 INFO L124 PetriNetUnfolderBase]: 13/173 cut-off events. [2023-12-09 15:35:35,719 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 15:35:35,719 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:35:35,719 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:35:35,720 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:35:35,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:35:35,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1930003467, now seen corresponding path program 1 times [2023-12-09 15:35:35,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:35:35,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184388901] [2023-12-09 15:35:35,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:35:35,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:35:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:35:36,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:35:36,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:35:36,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184388901] [2023-12-09 15:35:36,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184388901] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:35:36,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:35:36,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:35:36,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441827876] [2023-12-09 15:35:36,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:35:36,438 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:35:36,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:35:36,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:35:36,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:35:36,469 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 185 [2023-12-09 15:35:36,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 174 transitions, 360 flow. Second operand has 6 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:35:36,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:35:36,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 185 [2023-12-09 15:35:36,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:35:36,769 INFO L124 PetriNetUnfolderBase]: 118/444 cut-off events. [2023-12-09 15:35:36,770 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2023-12-09 15:35:36,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 444 events. 118/444 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1642 event pairs, 56 based on Foata normal form. 9/397 useless extension candidates. Maximal degree in co-relation 452. Up to 134 conditions per place. [2023-12-09 15:35:36,775 INFO L140 encePairwiseOnDemand]: 164/185 looper letters, 71 selfloop transitions, 5 changer transitions 11/199 dead transitions. [2023-12-09 15:35:36,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 199 transitions, 599 flow [2023-12-09 15:35:36,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:35:36,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:35:36,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1201 transitions. [2023-12-09 15:35:36,791 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7213213213213213 [2023-12-09 15:35:36,791 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1201 transitions. [2023-12-09 15:35:36,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1201 transitions. [2023-12-09 15:35:36,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:35:36,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1201 transitions. [2023-12-09 15:35:36,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 133.44444444444446) internal successors, (1201), 9 states have internal predecessors, (1201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:35:36,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 185.0) internal successors, (1850), 10 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:35:36,809 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 185.0) internal successors, (1850), 10 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:35:36,812 INFO L308 CegarLoopForPetriNet]: 168 programPoint places, 8 predicate places. [2023-12-09 15:35:36,813 INFO L500 AbstractCegarLoop]: Abstraction has has 176 places, 199 transitions, 599 flow [2023-12-09 15:35:36,813 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:35:36,813 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:35:36,813 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:35:36,814 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:35:36,814 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:35:36,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:35:36,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1480508557, now seen corresponding path program 1 times [2023-12-09 15:35:36,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:35:36,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664405928] [2023-12-09 15:35:36,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:35:36,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:35:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:35:36,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:35:36,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:35:36,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664405928] [2023-12-09 15:35:36,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664405928] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:35:36,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:35:36,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:35:36,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395374515] [2023-12-09 15:35:36,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:35:36,946 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:35:36,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:35:36,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:35:36,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:35:36,947 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 185 [2023-12-09 15:35:36,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 199 transitions, 599 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:35:36,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:35:36,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 185 [2023-12-09 15:35:36,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:35:37,004 INFO L124 PetriNetUnfolderBase]: 95/408 cut-off events. [2023-12-09 15:35:37,005 INFO L125 PetriNetUnfolderBase]: For 141/147 co-relation queries the response was YES. [2023-12-09 15:35:37,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774 conditions, 408 events. 95/408 cut-off events. For 141/147 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1296 event pairs, 13 based on Foata normal form. 4/367 useless extension candidates. Maximal degree in co-relation 521. Up to 99 conditions per place. [2023-12-09 15:35:37,009 INFO L140 encePairwiseOnDemand]: 182/185 looper letters, 23 selfloop transitions, 2 changer transitions 12/200 dead transitions. [2023-12-09 15:35:37,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 200 transitions, 655 flow [2023-12-09 15:35:37,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:35:37,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:35:37,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2023-12-09 15:35:37,010 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9117117117117117 [2023-12-09 15:35:37,011 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 506 transitions. [2023-12-09 15:35:37,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 506 transitions. [2023-12-09 15:35:37,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:35:37,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 506 transitions. [2023-12-09 15:35:37,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:35:37,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:35:37,013 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:35:37,014 INFO L308 CegarLoopForPetriNet]: 168 programPoint places, 10 predicate places. [2023-12-09 15:35:37,014 INFO L500 AbstractCegarLoop]: Abstraction has has 178 places, 200 transitions, 655 flow [2023-12-09 15:35:37,014 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:35:37,015 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:35:37,015 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:35:37,015 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:35:37,015 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:35:37,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:35:37,016 INFO L85 PathProgramCache]: Analyzing trace with hash 562052307, now seen corresponding path program 1 times [2023-12-09 15:35:37,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:35:37,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731864940] [2023-12-09 15:35:37,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:35:37,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:35:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:35:37,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:35:37,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:35:37,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731864940] [2023-12-09 15:35:37,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731864940] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:35:37,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:35:37,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:35:37,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084640978] [2023-12-09 15:35:37,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:35:37,114 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:35:37,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:35:37,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:35:37,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:35:37,119 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 185 [2023-12-09 15:35:37,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 200 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:35:37,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:35:37,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 185 [2023-12-09 15:35:37,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:35:37,186 INFO L124 PetriNetUnfolderBase]: 67/336 cut-off events. [2023-12-09 15:35:37,186 INFO L125 PetriNetUnfolderBase]: For 200/210 co-relation queries the response was YES. [2023-12-09 15:35:37,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 678 conditions, 336 events. 67/336 cut-off events. For 200/210 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 863 event pairs, 24 based on Foata normal form. 4/307 useless extension candidates. Maximal degree in co-relation 432. Up to 99 conditions per place. [2023-12-09 15:35:37,188 INFO L140 encePairwiseOnDemand]: 182/185 looper letters, 19 selfloop transitions, 3 changer transitions 14/190 dead transitions. [2023-12-09 15:35:37,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 190 transitions, 660 flow [2023-12-09 15:35:37,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:35:37,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:35:37,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2023-12-09 15:35:37,189 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9135135135135135 [2023-12-09 15:35:37,190 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 507 transitions. [2023-12-09 15:35:37,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 507 transitions. [2023-12-09 15:35:37,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:35:37,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 507 transitions. [2023-12-09 15:35:37,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:35:37,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:35:37,192 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:35:37,193 INFO L308 CegarLoopForPetriNet]: 168 programPoint places, 11 predicate places. [2023-12-09 15:35:37,193 INFO L500 AbstractCegarLoop]: Abstraction has has 179 places, 190 transitions, 660 flow [2023-12-09 15:35:37,193 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:35:37,193 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:35:37,194 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:35:37,194 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:35:37,194 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:35:37,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:35:37,194 INFO L85 PathProgramCache]: Analyzing trace with hash -262357197, now seen corresponding path program 1 times [2023-12-09 15:35:37,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:35:37,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522340649] [2023-12-09 15:35:37,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:35:37,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:35:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:35:37,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:35:37,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:35:37,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522340649] [2023-12-09 15:35:37,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522340649] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:35:37,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:35:37,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:35:37,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26590927] [2023-12-09 15:35:37,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:35:37,332 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:35:37,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:35:37,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:35:37,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:35:37,334 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 185 [2023-12-09 15:35:37,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 190 transitions, 660 flow. Second operand has 6 states, 6 states have (on average 140.33333333333334) internal successors, (842), 6 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:35:37,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:35:37,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 185 [2023-12-09 15:35:37,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:35:37,484 INFO L124 PetriNetUnfolderBase]: 79/455 cut-off events. [2023-12-09 15:35:37,484 INFO L125 PetriNetUnfolderBase]: For 477/501 co-relation queries the response was YES. [2023-12-09 15:35:37,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1018 conditions, 455 events. 79/455 cut-off events. For 477/501 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1398 event pairs, 52 based on Foata normal form. 5/410 useless extension candidates. Maximal degree in co-relation 488. Up to 108 conditions per place. [2023-12-09 15:35:37,487 INFO L140 encePairwiseOnDemand]: 174/185 looper letters, 46 selfloop transitions, 8 changer transitions 39/219 dead transitions. [2023-12-09 15:35:37,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 219 transitions, 937 flow [2023-12-09 15:35:37,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:35:37,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:35:37,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1284 transitions. [2023-12-09 15:35:37,489 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7711711711711712 [2023-12-09 15:35:37,490 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1284 transitions. [2023-12-09 15:35:37,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1284 transitions. [2023-12-09 15:35:37,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:35:37,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1284 transitions. [2023-12-09 15:35:37,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 142.66666666666666) internal successors, (1284), 9 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:35:37,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 185.0) internal successors, (1850), 10 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:35:37,540 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 185.0) internal successors, (1850), 10 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:35:37,543 INFO L308 CegarLoopForPetriNet]: 168 programPoint places, 19 predicate places. [2023-12-09 15:35:37,543 INFO L500 AbstractCegarLoop]: Abstraction has has 187 places, 219 transitions, 937 flow [2023-12-09 15:35:37,543 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 140.33333333333334) internal successors, (842), 6 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:35:37,543 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:35:37,543 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:35:37,543 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 15:35:37,544 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:35:37,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:35:37,544 INFO L85 PathProgramCache]: Analyzing trace with hash 529814607, now seen corresponding path program 1 times [2023-12-09 15:35:37,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:35:37,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054154173] [2023-12-09 15:35:37,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:35:37,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:35:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:35:37,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:35:37,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:35:37,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054154173] [2023-12-09 15:35:37,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054154173] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:35:37,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:35:37,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:35:37,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566392644] [2023-12-09 15:35:37,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:35:37,664 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:35:37,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:35:37,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:35:37,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:35:37,665 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 185 [2023-12-09 15:35:37,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 219 transitions, 937 flow. Second operand has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:35:37,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:35:37,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 185 [2023-12-09 15:35:37,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:35:37,799 INFO L124 PetriNetUnfolderBase]: 98/608 cut-off events. [2023-12-09 15:35:37,799 INFO L125 PetriNetUnfolderBase]: For 1111/1159 co-relation queries the response was YES. [2023-12-09 15:35:37,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1507 conditions, 608 events. 98/608 cut-off events. For 1111/1159 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2386 event pairs, 70 based on Foata normal form. 9/544 useless extension candidates. Maximal degree in co-relation 543. Up to 163 conditions per place. [2023-12-09 15:35:37,802 INFO L140 encePairwiseOnDemand]: 174/185 looper letters, 50 selfloop transitions, 8 changer transitions 61/245 dead transitions. [2023-12-09 15:35:37,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 245 transitions, 1344 flow [2023-12-09 15:35:37,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:35:37,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:35:37,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1269 transitions. [2023-12-09 15:35:37,804 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7621621621621621 [2023-12-09 15:35:37,804 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1269 transitions. [2023-12-09 15:35:37,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1269 transitions. [2023-12-09 15:35:37,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:35:37,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1269 transitions. [2023-12-09 15:35:37,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 141.0) internal successors, (1269), 9 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:35:37,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 185.0) internal successors, (1850), 10 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:35:37,808 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 185.0) internal successors, (1850), 10 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:35:37,810 INFO L308 CegarLoopForPetriNet]: 168 programPoint places, 27 predicate places. [2023-12-09 15:35:37,810 INFO L500 AbstractCegarLoop]: Abstraction has has 195 places, 245 transitions, 1344 flow [2023-12-09 15:35:37,811 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:35:37,811 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:35:37,811 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:35:37,811 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 15:35:37,811 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:35:37,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:35:37,812 INFO L85 PathProgramCache]: Analyzing trace with hash -32691573, now seen corresponding path program 1 times [2023-12-09 15:35:37,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:35:37,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401374837] [2023-12-09 15:35:37,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:35:37,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:35:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:35:40,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:35:40,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:35:40,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401374837] [2023-12-09 15:35:40,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401374837] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:35:40,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988169625] [2023-12-09 15:35:40,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:35:40,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:35:40,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:35:40,790 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:35:40,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-09 15:35:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:35:40,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 59 conjunts are in the unsatisfiable core [2023-12-09 15:35:40,969 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:35:43,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:35:43,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 26 [2023-12-09 15:35:43,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:35:43,934 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:35:44,887 INFO L349 Elim1Store]: treesize reduction 22, result has 89.8 percent of original size [2023-12-09 15:35:44,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 224 [2023-12-09 15:35:51,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:35:51,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988169625] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:35:51,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:35:51,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 31] total 103 [2023-12-09 15:35:51,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9384118] [2023-12-09 15:35:51,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:35:51,397 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2023-12-09 15:35:51,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:35:51,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2023-12-09 15:35:51,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1069, Invalid=9437, Unknown=0, NotChecked=0, Total=10506 [2023-12-09 15:35:51,411 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 185 [2023-12-09 15:35:51,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 245 transitions, 1344 flow. Second operand has 103 states, 103 states have (on average 57.05825242718446) internal successors, (5877), 103 states have internal predecessors, (5877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:35:51,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:35:51,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 185 [2023-12-09 15:35:51,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:36:36,022 INFO L124 PetriNetUnfolderBase]: 2621/5831 cut-off events. [2023-12-09 15:36:36,022 INFO L125 PetriNetUnfolderBase]: For 10389/10477 co-relation queries the response was YES. [2023-12-09 15:36:36,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20418 conditions, 5831 events. 2621/5831 cut-off events. For 10389/10477 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 46220 event pairs, 75 based on Foata normal form. 0/5424 useless extension candidates. Maximal degree in co-relation 14036. Up to 2779 conditions per place. [2023-12-09 15:36:36,054 INFO L140 encePairwiseOnDemand]: 116/185 looper letters, 768 selfloop transitions, 790 changer transitions 261/1864 dead transitions. [2023-12-09 15:36:36,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 1864 transitions, 14587 flow [2023-12-09 15:36:36,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 415 states. [2023-12-09 15:36:36,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2023-12-09 15:36:36,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 24176 transitions. [2023-12-09 15:36:36,094 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3148941712797135 [2023-12-09 15:36:36,094 INFO L72 ComplementDD]: Start complementDD. Operand 415 states and 24176 transitions. [2023-12-09 15:36:36,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 415 states and 24176 transitions. [2023-12-09 15:36:36,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:36:36,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 415 states and 24176 transitions. [2023-12-09 15:36:36,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 416 states, 415 states have (on average 58.255421686746985) internal successors, (24176), 415 states have internal predecessors, (24176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:36,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 416 states, 416 states have (on average 185.0) internal successors, (76960), 416 states have internal predecessors, (76960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:36,258 INFO L81 ComplementDD]: Finished complementDD. Result has 416 states, 416 states have (on average 185.0) internal successors, (76960), 416 states have internal predecessors, (76960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:36,261 INFO L308 CegarLoopForPetriNet]: 168 programPoint places, 441 predicate places. [2023-12-09 15:36:36,261 INFO L500 AbstractCegarLoop]: Abstraction has has 609 places, 1864 transitions, 14587 flow [2023-12-09 15:36:36,262 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 57.05825242718446) internal successors, (5877), 103 states have internal predecessors, (5877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:36,262 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:36:36,263 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:36:36,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-09 15:36:36,468 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-12-09 15:36:36,468 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:36:36,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:36:36,468 INFO L85 PathProgramCache]: Analyzing trace with hash 284133347, now seen corresponding path program 2 times [2023-12-09 15:36:36,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:36:36,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153747888] [2023-12-09 15:36:36,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:36,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:36:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:39,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:36:39,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:36:39,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153747888] [2023-12-09 15:36:39,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153747888] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:36:39,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997980248] [2023-12-09 15:36:39,008 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:36:39,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:36:39,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:36:39,009 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:36:39,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-09 15:36:39,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:36:39,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:36:39,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 73 conjunts are in the unsatisfiable core [2023-12-09 15:36:39,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:36:41,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-12-09 15:36:41,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:36:41,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:36:42,738 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:36:42,739 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:36:46,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:36:46,662 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 121 treesize of output 85 [2023-12-09 15:36:46,747 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-12-09 15:36:46,747 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 615 treesize of output 639 [2023-12-09 15:36:46,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:36:46,801 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 187 treesize of output 243 [2023-12-09 15:36:46,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:36:46,853 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 185 treesize of output 217 [2023-12-09 15:37:05,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:37:05,587 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 147 treesize of output 99 [2023-12-09 15:37:05,647 INFO L349 Elim1Store]: treesize reduction 46, result has 50.5 percent of original size [2023-12-09 15:37:05,648 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 649 treesize of output 607 [2023-12-09 15:37:05,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:37:05,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:37:05,702 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 537 treesize of output 445 [2023-12-09 15:37:05,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:37:05,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:37:05,755 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 3 new quantified variables, introduced 5 case distinctions, treesize of input 380 treesize of output 354 [2023-12-09 15:37:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:37:12,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997980248] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:37:12,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:37:12,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 44, 35] total 108 [2023-12-09 15:37:12,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564464006] [2023-12-09 15:37:12,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:37:12,459 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2023-12-09 15:37:12,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:37:12,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2023-12-09 15:37:12,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1290, Invalid=10225, Unknown=41, NotChecked=0, Total=11556 [2023-12-09 15:37:12,465 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 185 [2023-12-09 15:37:12,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 1864 transitions, 14587 flow. Second operand has 108 states, 108 states have (on average 49.93518518518518) internal successors, (5393), 108 states have internal predecessors, (5393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:37:12,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:37:12,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 185 [2023-12-09 15:37:12,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:37:32,325 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse18 (* c_~q2_front~0 4))) (let ((.cse51 (select |c_#memory_int| c_~q2~0.base)) (.cse32 (+ c_~q2~0.offset .cse18))) (let ((.cse0 (= c_~j~0 c_~i~0)) (.cse61 (= c_~q1_back~0 c_~q1_front~0)) (.cse17 (* c_~q2_back~0 4)) (.cse49 (select .cse51 .cse32))) (let ((.cse24 (< .cse49 c_~N~0)) (.cse27 (+ .cse49 1)) (.cse33 (+ .cse17 c_~q2~0.offset)) (.cse23 (and .cse0 (= c_~q2_front~0 c_~q2_back~0) .cse61)) (.cse1 (< c_~n1~0 (+ c_~q1_front~0 1))) (.cse2 (< c_~q2_back~0 0)) (.cse3 (< c_~n1~0 (+ c_~q1_back~0 1))) (.cse4 (< c_~q1_front~0 0)) (.cse7 (+ c_~j~0 1)) (.cse10 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse11 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse19 (< c_~q1_back~0 0)) (.cse20 (< c_~n2~0 (+ c_~q2_back~0 1))) (.cse21 (< c_~n2~0 (+ c_~q2_front~0 1))) (.cse22 (< c_~q2_front~0 0))) (and (or (not (= c_~q1_front~0 0)) .cse0 (not (= c_~q1_back~0 0))) (or .cse1 .cse2 .cse3 .cse4 (let ((.cse6 (+ |c_ULTIMATE.start_main_#t~ret17#1.offset| .cse18)) (.cse8 (+ .cse17 |c_ULTIMATE.start_main_#t~ret17#1.offset|))) (and (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse5 (select .cse12 |c_ULTIMATE.start_main_#t~ret17#1.base|))) (or (< (select .cse5 .cse6) .cse7) (not (= c_~i~0 (select .cse5 .cse8))) (forall ((~q1~0.base Int)) (let ((.cse9 (select .cse12 ~q1~0.base))) (or (< (select .cse9 .cse10) c_~j~0) (not (= (select .cse9 .cse11) c_~j~0))))))))) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse16 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse15 (select .cse16 |c_ULTIMATE.start_main_#t~ret17#1.base|))) (or (forall ((~q1~0.base Int)) (let ((.cse14 (select .cse16 ~q1~0.base))) (let ((.cse13 (select .cse14 .cse10))) (or (< .cse13 c_~j~0) (not (= (select .cse14 .cse11) c_~j~0)) (< .cse13 (+ (select .cse15 .cse6) 1)))))) (not (= c_~i~0 (select .cse15 .cse8))))))))) .cse19 .cse20 .cse21 .cse22) (or .cse1 .cse23 .cse2 .cse3 .cse4 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse19 .cse20 .cse21 .cse22) (or .cse1 .cse4 (let ((.cse26 (select (select |c_#memory_int| c_~q1~0.base) .cse10))) (let ((.cse25 (< (+ .cse26 1) c_~N~0))) (and (or .cse24 .cse25) (or .cse25 (< .cse26 .cse27))))) .cse21 .cse22) (or .cse1 .cse3 .cse4 .cse19 .cse21 .cse22 (and (or .cse24 (forall ((~q1~0.base Int)) (let ((.cse28 (select |c_#memory_int| ~q1~0.base))) (or (not (= c_~j~0 (select .cse28 .cse11))) (< (+ (select .cse28 .cse10) 1) c_~N~0))))) (forall ((~q1~0.base Int)) (let ((.cse29 (select |c_#memory_int| ~q1~0.base))) (let ((.cse30 (select .cse29 .cse10))) (or (not (= c_~j~0 (select .cse29 .cse11))) (< .cse30 .cse27) (< (+ .cse30 1) c_~N~0))))))) (or .cse1 .cse2 .cse3 .cse4 .cse19 .cse20 .cse21 .cse22 (and (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse35 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse31 (select .cse35 c_~q2~0.base))) (or (< (select .cse31 .cse32) .cse7) (not (= c_~i~0 (select .cse31 .cse33))) (forall ((~q1~0.base Int)) (let ((.cse34 (select .cse35 ~q1~0.base))) (or (< (select .cse34 .cse10) c_~j~0) (not (= (select .cse34 .cse11) c_~j~0))))))))) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse39 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse36 (select .cse39 c_~q2~0.base))) (or (not (= c_~i~0 (select .cse36 .cse33))) (forall ((~q1~0.base Int)) (let ((.cse38 (select .cse39 ~q1~0.base))) (let ((.cse37 (select .cse38 .cse10))) (or (< .cse37 c_~j~0) (not (= (select .cse38 .cse11) c_~j~0)) (< .cse37 (+ (select .cse36 .cse32) 1)))))))))))) (or .cse1 .cse2 .cse3 .cse4 .cse19 (and (forall ((v_ArrVal_129 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse42 (select .cse41 c_~q2~0.base))) (or (forall ((~q1~0.base Int)) (let ((.cse40 (select .cse41 ~q1~0.base))) (or (< (select .cse40 .cse10) c_~j~0) (not (= (select .cse40 .cse11) c_~j~0))))) (< (select .cse42 .cse32) .cse7) (not (= c_~i~0 (select .cse42 .cse33))))))) (forall ((v_ArrVal_129 (Array Int Int))) (let ((.cse46 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse45 (select .cse46 c_~q2~0.base))) (or (forall ((~q1~0.base Int)) (let ((.cse44 (select .cse46 ~q1~0.base))) (let ((.cse43 (select .cse44 .cse10))) (or (< .cse43 c_~j~0) (not (= (select .cse44 .cse11) c_~j~0)) (< .cse43 (+ (select .cse45 .cse32) 1)))))) (not (= c_~i~0 (select .cse45 .cse33)))))))) .cse20 .cse21 .cse22) (or .cse1 .cse2 .cse3 .cse4 .cse19 .cse20 .cse21 .cse22 (and (forall ((~q1~0.base Int)) (let ((.cse48 (select |c_#memory_int| ~q1~0.base))) (let ((.cse47 (select .cse48 .cse10))) (or (< .cse47 c_~j~0) (not (= c_~j~0 (select .cse48 .cse11))) (< .cse47 .cse27))))) (or (< .cse49 .cse7) (forall ((~q1~0.base Int)) (let ((.cse50 (select |c_#memory_int| ~q1~0.base))) (or (< (select .cse50 .cse10) c_~j~0) (not (= c_~j~0 (select .cse50 .cse11)))))))) (not (= c_~i~0 (select .cse51 .cse33)))) (or .cse1 .cse23 .cse2 .cse3 .cse4 .cse19 .cse20 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse21 .cse22) (or .cse1 (let ((.cse55 (+ .cse18 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse57 (+ .cse17 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse56 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse54 (select .cse56 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (forall ((~q1~0.base Int)) (let ((.cse53 (select .cse56 ~q1~0.base))) (let ((.cse52 (select .cse53 .cse10))) (or (< .cse52 c_~j~0) (not (= (select .cse53 .cse11) c_~j~0)) (< .cse52 (+ (select .cse54 .cse55) 1)))))) (not (= c_~i~0 (select .cse54 .cse57))))))) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse60 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse58 (select .cse60 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< (select .cse58 .cse55) .cse7) (not (= c_~i~0 (select .cse58 .cse57))) (forall ((~q1~0.base Int)) (let ((.cse59 (select .cse60 ~q1~0.base))) (or (< (select .cse59 .cse10) c_~j~0) (not (= (select .cse59 .cse11) c_~j~0))))))))))) .cse2 .cse3 .cse4 .cse19 .cse20 .cse21 .cse22) (or .cse1 (not (= c_~q2_front~0 0)) .cse3 .cse4 .cse19 (not (= c_~q2_back~0 0)) (and .cse0 .cse61)) (or .cse1 .cse23 .cse2 .cse3 .cse4 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse19 .cse20 .cse21 .cse22) (or .cse1 .cse2 .cse3 .cse4 (let ((.cse63 (+ .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse66 (+ .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse67 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse62 (select .cse67 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= c_~i~0 (select .cse62 .cse63))) (forall ((~q1~0.base Int)) (let ((.cse65 (select .cse67 ~q1~0.base))) (let ((.cse64 (select .cse65 .cse10))) (or (< .cse64 c_~j~0) (not (= (select .cse65 .cse11) c_~j~0)) (< .cse64 (+ (select .cse62 .cse66) 1)))))))))) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse70 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse68 (select .cse70 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= c_~i~0 (select .cse68 .cse63))) (< (select .cse68 .cse66) .cse7) (forall ((~q1~0.base Int)) (let ((.cse69 (select .cse70 ~q1~0.base))) (or (< (select .cse69 .cse10) c_~j~0) (not (= (select .cse69 .cse11) c_~j~0))))))))))) .cse19 .cse20 .cse21 .cse22)))))) is different from false [2023-12-09 15:37:32,802 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse22 (* c_~q2_front~0 4))) (let ((.cse49 (+ c_~q2_front~0 1)) (.cse31 (+ c_~q1_back~0 1)) (.cse3 (= c_~j~0 c_~i~0)) (.cse59 (= c_~q1_back~0 c_~q1_front~0)) (.cse1 (select |c_#memory_int| c_~q2~0.base)) (.cse33 (+ c_~q2~0.offset .cse22)) (.cse21 (* c_~q2_back~0 4))) (let ((.cse34 (+ .cse21 c_~q2~0.offset)) (.cse2 (not (= c_~q1_front~0 0))) (.cse4 (not (= c_~q1_back~0 0))) (.cse28 (select .cse1 .cse33)) (.cse0 (not (= c_~q2_front~0 0))) (.cse27 (and .cse3 (= c_~q2_front~0 c_~q2_back~0) .cse59)) (.cse5 (< c_~n1~0 (+ c_~q1_front~0 1))) (.cse6 (< c_~q2_back~0 0)) (.cse7 (< c_~n1~0 .cse31)) (.cse8 (< c_~q1_front~0 0)) (.cse11 (+ c_~j~0 1)) (.cse14 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse15 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse23 (< c_~q1_back~0 0)) (.cse24 (< c_~n2~0 (+ c_~q2_back~0 1))) (.cse25 (< c_~n2~0 .cse49)) (.cse26 (< c_~q2_front~0 0)) (.cse48 (= c_~j~0 0))) (and (= c_~q2~0.offset 0) (or .cse0 (= 0 (select .cse1 0))) (or .cse2 .cse3 .cse4) (or (< c_~n1~0 2) (< c_~q1_back~0 1)) (= c_~q1~0.offset 0) (or .cse5 .cse6 .cse7 .cse8 (let ((.cse10 (+ |c_ULTIMATE.start_main_#t~ret17#1.offset| .cse22)) (.cse12 (+ .cse21 |c_ULTIMATE.start_main_#t~ret17#1.offset|))) (and (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse16 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse9 (select .cse16 |c_ULTIMATE.start_main_#t~ret17#1.base|))) (or (< (select .cse9 .cse10) .cse11) (not (= c_~i~0 (select .cse9 .cse12))) (forall ((~q1~0.base Int)) (let ((.cse13 (select .cse16 ~q1~0.base))) (or (< (select .cse13 .cse14) c_~j~0) (not (= (select .cse13 .cse15) c_~j~0))))))))) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse19 (select .cse20 |c_ULTIMATE.start_main_#t~ret17#1.base|))) (or (forall ((~q1~0.base Int)) (let ((.cse18 (select .cse20 ~q1~0.base))) (let ((.cse17 (select .cse18 .cse14))) (or (< .cse17 c_~j~0) (not (= (select .cse18 .cse15) c_~j~0)) (< .cse17 (+ (select .cse19 .cse10) 1)))))) (not (= c_~i~0 (select .cse19 .cse12))))))))) .cse23 .cse24 .cse25 .cse26) (or .cse5 .cse27 .cse6 .cse7 .cse8 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse23 .cse24 .cse25 .cse26) (or .cse5 .cse8 (let ((.cse30 (select (select |c_#memory_int| c_~q1~0.base) .cse14))) (let ((.cse29 (< (+ .cse30 1) c_~N~0))) (and (or (< .cse28 c_~N~0) .cse29) (or .cse29 (< .cse30 (+ .cse28 1)))))) .cse25 .cse26) (<= c_~q2_front~0 0) (or (< 0 .cse31) (< c_~q1_front~0 .cse31)) (<= 1 c_~N~0) (or .cse5 .cse6 .cse7 .cse8 .cse23 .cse24 .cse25 .cse26 (and (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse32 (select .cse36 c_~q2~0.base))) (or (< (select .cse32 .cse33) .cse11) (not (= c_~i~0 (select .cse32 .cse34))) (forall ((~q1~0.base Int)) (let ((.cse35 (select .cse36 ~q1~0.base))) (or (< (select .cse35 .cse14) c_~j~0) (not (= (select .cse35 .cse15) c_~j~0))))))))) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse40 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse37 (select .cse40 c_~q2~0.base))) (or (not (= c_~i~0 (select .cse37 .cse34))) (forall ((~q1~0.base Int)) (let ((.cse39 (select .cse40 ~q1~0.base))) (let ((.cse38 (select .cse39 .cse14))) (or (< .cse38 c_~j~0) (not (= (select .cse39 .cse15) c_~j~0)) (< .cse38 (+ (select .cse37 .cse33) 1)))))))))))) (or .cse5 .cse6 .cse7 .cse8 .cse23 (and (forall ((v_ArrVal_129 (Array Int Int))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse43 (select .cse42 c_~q2~0.base))) (or (forall ((~q1~0.base Int)) (let ((.cse41 (select .cse42 ~q1~0.base))) (or (< (select .cse41 .cse14) c_~j~0) (not (= (select .cse41 .cse15) c_~j~0))))) (< (select .cse43 .cse33) .cse11) (not (= c_~i~0 (select .cse43 .cse34))))))) (forall ((v_ArrVal_129 (Array Int Int))) (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse46 (select .cse47 c_~q2~0.base))) (or (forall ((~q1~0.base Int)) (let ((.cse45 (select .cse47 ~q1~0.base))) (let ((.cse44 (select .cse45 .cse14))) (or (< .cse44 c_~j~0) (not (= (select .cse45 .cse15) c_~j~0)) (< .cse44 (+ (select .cse46 .cse33) 1)))))) (not (= c_~i~0 (select .cse46 .cse34)))))))) .cse24 .cse25 .cse26) (<= c_~n1~0 1) (or (and (or (< c_~q1_front~0 1) (< (+ c_~q1_front~0 c_~n1~0) 2)) (or .cse2 .cse48)) .cse4) (<= c_~q1_front~0 c_~q1_back~0) (<= 0 c_~q2_front~0) (or .cse5 .cse27 .cse6 .cse7 .cse8 .cse23 .cse24 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse25 .cse26) (<= c_~n2~0 1) (<= .cse49 c_~n2~0) (= .cse28 0) (or .cse5 (let ((.cse53 (+ .cse22 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse55 (+ .cse21 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse54 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse52 (select .cse54 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (forall ((~q1~0.base Int)) (let ((.cse51 (select .cse54 ~q1~0.base))) (let ((.cse50 (select .cse51 .cse14))) (or (< .cse50 c_~j~0) (not (= (select .cse51 .cse15) c_~j~0)) (< .cse50 (+ (select .cse52 .cse53) 1)))))) (not (= c_~i~0 (select .cse52 .cse55))))))) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse58 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse56 (select .cse58 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< (select .cse56 .cse53) .cse11) (not (= c_~i~0 (select .cse56 .cse55))) (forall ((~q1~0.base Int)) (let ((.cse57 (select .cse58 ~q1~0.base))) (or (< (select .cse57 .cse14) c_~j~0) (not (= (select .cse57 .cse15) c_~j~0))))))))))) .cse6 .cse7 .cse8 .cse23 .cse24 .cse25 .cse26) (or .cse5 .cse0 .cse7 .cse8 .cse23 (not (= c_~q2_back~0 0)) (and .cse3 .cse59)) (or .cse5 .cse27 .cse6 .cse7 .cse8 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse23 .cse24 .cse25 .cse26) (or .cse5 .cse6 .cse7 .cse8 (let ((.cse61 (+ .cse21 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse64 (+ .cse22 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse65 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse60 (select .cse65 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= c_~i~0 (select .cse60 .cse61))) (forall ((~q1~0.base Int)) (let ((.cse63 (select .cse65 ~q1~0.base))) (let ((.cse62 (select .cse63 .cse14))) (or (< .cse62 c_~j~0) (not (= (select .cse63 .cse15) c_~j~0)) (< .cse62 (+ (select .cse60 .cse64) 1)))))))))) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse68 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse66 (select .cse68 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= c_~i~0 (select .cse66 .cse61))) (< (select .cse66 .cse64) .cse11) (forall ((~q1~0.base Int)) (let ((.cse67 (select .cse68 ~q1~0.base))) (or (< (select .cse67 .cse14) c_~j~0) (not (= (select .cse67 .cse15) c_~j~0))))))))))) .cse23 .cse24 .cse25 .cse26) .cse48)))) is different from false [2023-12-09 15:37:51,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:38:07,685 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse18 (* c_~q2_front~0 4))) (let ((.cse52 (select |c_#memory_int| c_~q2~0.base)) (.cse33 (+ c_~q2~0.offset .cse18))) (let ((.cse0 (= c_~j~0 c_~i~0)) (.cse62 (= c_~q1_back~0 c_~q1_front~0)) (.cse17 (* c_~q2_back~0 4)) (.cse50 (select .cse52 .cse33))) (let ((.cse24 (< .cse50 c_~N~0)) (.cse27 (+ .cse50 1)) (.cse34 (+ .cse17 c_~q2~0.offset)) (.cse23 (and .cse0 (= c_~q2_front~0 c_~q2_back~0) .cse62)) (.cse1 (< c_~n1~0 (+ c_~q1_front~0 1))) (.cse2 (< c_~q2_back~0 0)) (.cse3 (< c_~n1~0 (+ c_~q1_back~0 1))) (.cse4 (< c_~q1_front~0 0)) (.cse7 (+ c_~j~0 1)) (.cse10 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse11 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse19 (< c_~q1_back~0 0)) (.cse20 (< c_~n2~0 (+ c_~q2_back~0 1))) (.cse21 (< c_~n2~0 (+ c_~q2_front~0 1))) (.cse22 (< c_~q2_front~0 0))) (and (or (not (= c_~q1_front~0 0)) .cse0 (not (= c_~q1_back~0 0))) (or .cse1 .cse2 .cse3 .cse4 (let ((.cse6 (+ |c_ULTIMATE.start_main_#t~ret17#1.offset| .cse18)) (.cse8 (+ .cse17 |c_ULTIMATE.start_main_#t~ret17#1.offset|))) (and (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse5 (select .cse12 |c_ULTIMATE.start_main_#t~ret17#1.base|))) (or (< (select .cse5 .cse6) .cse7) (not (= c_~i~0 (select .cse5 .cse8))) (forall ((~q1~0.base Int)) (let ((.cse9 (select .cse12 ~q1~0.base))) (or (< (select .cse9 .cse10) c_~j~0) (not (= (select .cse9 .cse11) c_~j~0))))))))) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse16 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse15 (select .cse16 |c_ULTIMATE.start_main_#t~ret17#1.base|))) (or (forall ((~q1~0.base Int)) (let ((.cse14 (select .cse16 ~q1~0.base))) (let ((.cse13 (select .cse14 .cse10))) (or (< .cse13 c_~j~0) (not (= (select .cse14 .cse11) c_~j~0)) (< .cse13 (+ (select .cse15 .cse6) 1)))))) (not (= c_~i~0 (select .cse15 .cse8))))))))) .cse19 .cse20 .cse21 .cse22) (or .cse1 .cse23 .cse2 .cse3 .cse4 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse19 .cse20 .cse21 .cse22) (or .cse1 .cse4 (let ((.cse26 (select (select |c_#memory_int| c_~q1~0.base) .cse10))) (let ((.cse25 (< (+ .cse26 1) c_~N~0))) (and (or .cse24 .cse25) (or .cse25 (< .cse26 .cse27))))) .cse21 .cse22) (or .cse1 .cse3 .cse4 .cse19 .cse21 .cse22 (and (or .cse24 (forall ((~q1~0.base Int)) (let ((.cse28 (select |c_#memory_int| ~q1~0.base))) (or (not (= c_~j~0 (select .cse28 .cse11))) (< (+ (select .cse28 .cse10) 1) c_~N~0))))) (forall ((~q1~0.base Int)) (let ((.cse29 (select |c_#memory_int| ~q1~0.base))) (let ((.cse30 (select .cse29 .cse10))) (or (not (= c_~j~0 (select .cse29 .cse11))) (< .cse30 .cse27) (< (+ .cse30 1) c_~N~0))))))) (or (let ((.cse31 (< (+ c_~i~0 1) c_~N~0))) (and (or .cse24 .cse31) (or (< c_~i~0 .cse27) .cse31))) .cse21 .cse22) (or .cse1 .cse2 .cse3 .cse4 .cse19 .cse20 .cse21 .cse22 (and (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse32 (select .cse36 c_~q2~0.base))) (or (< (select .cse32 .cse33) .cse7) (not (= c_~i~0 (select .cse32 .cse34))) (forall ((~q1~0.base Int)) (let ((.cse35 (select .cse36 ~q1~0.base))) (or (< (select .cse35 .cse10) c_~j~0) (not (= (select .cse35 .cse11) c_~j~0))))))))) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse40 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse37 (select .cse40 c_~q2~0.base))) (or (not (= c_~i~0 (select .cse37 .cse34))) (forall ((~q1~0.base Int)) (let ((.cse39 (select .cse40 ~q1~0.base))) (let ((.cse38 (select .cse39 .cse10))) (or (< .cse38 c_~j~0) (not (= (select .cse39 .cse11) c_~j~0)) (< .cse38 (+ (select .cse37 .cse33) 1)))))))))))) (or .cse1 .cse2 .cse3 .cse4 .cse19 (and (forall ((v_ArrVal_129 (Array Int Int))) (let ((.cse42 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse43 (select .cse42 c_~q2~0.base))) (or (forall ((~q1~0.base Int)) (let ((.cse41 (select .cse42 ~q1~0.base))) (or (< (select .cse41 .cse10) c_~j~0) (not (= (select .cse41 .cse11) c_~j~0))))) (< (select .cse43 .cse33) .cse7) (not (= c_~i~0 (select .cse43 .cse34))))))) (forall ((v_ArrVal_129 (Array Int Int))) (let ((.cse47 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse46 (select .cse47 c_~q2~0.base))) (or (forall ((~q1~0.base Int)) (let ((.cse45 (select .cse47 ~q1~0.base))) (let ((.cse44 (select .cse45 .cse10))) (or (< .cse44 c_~j~0) (not (= (select .cse45 .cse11) c_~j~0)) (< .cse44 (+ (select .cse46 .cse33) 1)))))) (not (= c_~i~0 (select .cse46 .cse34)))))))) .cse20 .cse21 .cse22) (or .cse1 .cse2 .cse3 .cse4 .cse19 .cse20 .cse21 .cse22 (and (forall ((~q1~0.base Int)) (let ((.cse49 (select |c_#memory_int| ~q1~0.base))) (let ((.cse48 (select .cse49 .cse10))) (or (< .cse48 c_~j~0) (not (= c_~j~0 (select .cse49 .cse11))) (< .cse48 .cse27))))) (or (< .cse50 .cse7) (forall ((~q1~0.base Int)) (let ((.cse51 (select |c_#memory_int| ~q1~0.base))) (or (< (select .cse51 .cse10) c_~j~0) (not (= c_~j~0 (select .cse51 .cse11)))))))) (not (= c_~i~0 (select .cse52 .cse34)))) (or .cse1 .cse23 .cse2 .cse3 .cse4 .cse19 .cse20 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse21 .cse22) (or .cse1 (let ((.cse56 (+ .cse18 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse58 (+ .cse17 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse57 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse55 (select .cse57 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (forall ((~q1~0.base Int)) (let ((.cse54 (select .cse57 ~q1~0.base))) (let ((.cse53 (select .cse54 .cse10))) (or (< .cse53 c_~j~0) (not (= (select .cse54 .cse11) c_~j~0)) (< .cse53 (+ (select .cse55 .cse56) 1)))))) (not (= c_~i~0 (select .cse55 .cse58))))))) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse61 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse59 (select .cse61 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< (select .cse59 .cse56) .cse7) (not (= c_~i~0 (select .cse59 .cse58))) (forall ((~q1~0.base Int)) (let ((.cse60 (select .cse61 ~q1~0.base))) (or (< (select .cse60 .cse10) c_~j~0) (not (= (select .cse60 .cse11) c_~j~0))))))))))) .cse2 .cse3 .cse4 .cse19 .cse20 .cse21 .cse22) (or .cse1 (not (= c_~q2_front~0 0)) .cse3 .cse4 .cse19 (not (= c_~q2_back~0 0)) (and .cse0 .cse62)) (or .cse1 .cse23 .cse2 .cse3 .cse4 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse19 .cse20 .cse21 .cse22) (or .cse1 .cse2 .cse3 .cse4 (let ((.cse64 (+ .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse67 (+ .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse68 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse63 (select .cse68 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= c_~i~0 (select .cse63 .cse64))) (forall ((~q1~0.base Int)) (let ((.cse66 (select .cse68 ~q1~0.base))) (let ((.cse65 (select .cse66 .cse10))) (or (< .cse65 c_~j~0) (not (= (select .cse66 .cse11) c_~j~0)) (< .cse65 (+ (select .cse63 .cse67) 1)))))))))) (forall ((v_ArrVal_128 (Array Int Int)) (v_ArrVal_129 (Array Int Int))) (let ((.cse71 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_128) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_129))) (let ((.cse69 (select .cse71 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= c_~i~0 (select .cse69 .cse64))) (< (select .cse69 .cse67) .cse7) (forall ((~q1~0.base Int)) (let ((.cse70 (select .cse71 ~q1~0.base))) (or (< (select .cse70 .cse10) c_~j~0) (not (= (select .cse70 .cse11) c_~j~0))))))))))) .cse19 .cse20 .cse21 .cse22)))))) is different from false [2023-12-09 15:38:10,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:38:32,863 INFO L124 PetriNetUnfolderBase]: 5092/10628 cut-off events. [2023-12-09 15:38:32,863 INFO L125 PetriNetUnfolderBase]: For 20193/20521 co-relation queries the response was YES. [2023-12-09 15:38:32,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47752 conditions, 10628 events. 5092/10628 cut-off events. For 20193/20521 co-relation queries the response was YES. Maximal size of possible extension queue 804. Compared 92322 event pairs, 88 based on Foata normal form. 111/9955 useless extension candidates. Maximal degree in co-relation 35672. Up to 5761 conditions per place. [2023-12-09 15:38:32,926 INFO L140 encePairwiseOnDemand]: 106/185 looper letters, 1859 selfloop transitions, 1326 changer transitions 376/3603 dead transitions. [2023-12-09 15:38:32,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 825 places, 3603 transitions, 35918 flow [2023-12-09 15:38:32,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2023-12-09 15:38:32,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2023-12-09 15:38:32,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 11775 transitions. [2023-12-09 15:38:32,939 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.28039052268127157 [2023-12-09 15:38:32,939 INFO L72 ComplementDD]: Start complementDD. Operand 227 states and 11775 transitions. [2023-12-09 15:38:32,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 227 states and 11775 transitions. [2023-12-09 15:38:32,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:38:32,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 227 states and 11775 transitions. [2023-12-09 15:38:32,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 228 states, 227 states have (on average 51.87224669603524) internal successors, (11775), 227 states have internal predecessors, (11775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:38:32,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 228 states, 228 states have (on average 185.0) internal successors, (42180), 228 states have internal predecessors, (42180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:38:32,981 INFO L81 ComplementDD]: Finished complementDD. Result has 228 states, 228 states have (on average 185.0) internal successors, (42180), 228 states have internal predecessors, (42180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:38:32,982 INFO L308 CegarLoopForPetriNet]: 168 programPoint places, 657 predicate places. [2023-12-09 15:38:32,982 INFO L500 AbstractCegarLoop]: Abstraction has has 825 places, 3603 transitions, 35918 flow [2023-12-09 15:38:32,983 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 108 states have (on average 49.93518518518518) internal successors, (5393), 108 states have internal predecessors, (5393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:38:32,983 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:38:32,983 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:38:32,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-09 15:38:33,188 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-09 15:38:33,188 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:38:33,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:38:33,189 INFO L85 PathProgramCache]: Analyzing trace with hash 401740339, now seen corresponding path program 3 times [2023-12-09 15:38:33,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:38:33,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129617493] [2023-12-09 15:38:33,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:38:33,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:38:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:38:36,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:38:36,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:38:36,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129617493] [2023-12-09 15:38:36,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129617493] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:38:36,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129124482] [2023-12-09 15:38:36,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-09 15:38:36,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:38:36,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:38:36,231 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:38:36,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-09 15:38:36,528 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-09 15:38:36,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:38:36,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 69 conjunts are in the unsatisfiable core [2023-12-09 15:38:36,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:38:38,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2023-12-09 15:38:38,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:38:39,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:38:39,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-09 15:38:39,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:38:39,439 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:38:41,125 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:38:41,125 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 113 treesize of output 77 [2023-12-09 15:38:41,174 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-12-09 15:38:41,175 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 510 treesize of output 518 [2023-12-09 15:38:41,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:38:41,228 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 430 treesize of output 450 [2023-12-09 15:38:41,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:38:41,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 352 treesize of output 284 [2023-12-09 15:38:56,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:38:56,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129124482] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:38:56,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:38:56,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 36, 35] total 102 [2023-12-09 15:38:56,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35740923] [2023-12-09 15:38:56,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:38:56,697 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2023-12-09 15:38:56,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:38:56,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2023-12-09 15:38:56,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=700, Invalid=9594, Unknown=8, NotChecked=0, Total=10302 [2023-12-09 15:38:56,703 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 185 [2023-12-09 15:38:56,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 825 places, 3603 transitions, 35918 flow. Second operand has 102 states, 102 states have (on average 50.088235294117645) internal successors, (5109), 102 states have internal predecessors, (5109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:38:56,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:38:56,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 185 [2023-12-09 15:38:56,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:39:02,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:39:42,355 INFO L124 PetriNetUnfolderBase]: 8487/17270 cut-off events. [2023-12-09 15:39:42,355 INFO L125 PetriNetUnfolderBase]: For 35784/36398 co-relation queries the response was YES. [2023-12-09 15:39:42,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93335 conditions, 17270 events. 8487/17270 cut-off events. For 35784/36398 co-relation queries the response was YES. Maximal size of possible extension queue 1436. Compared 164444 event pairs, 65 based on Foata normal form. 144/16122 useless extension candidates. Maximal degree in co-relation 70974. Up to 9676 conditions per place. [2023-12-09 15:39:42,529 INFO L140 encePairwiseOnDemand]: 113/185 looper letters, 3437 selfloop transitions, 2255 changer transitions 484/6218 dead transitions. [2023-12-09 15:39:42,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1089 places, 6218 transitions, 73559 flow [2023-12-09 15:39:42,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 265 states. [2023-12-09 15:39:42,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2023-12-09 15:39:42,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 13460 transitions. [2023-12-09 15:39:42,542 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.274553799082101 [2023-12-09 15:39:42,542 INFO L72 ComplementDD]: Start complementDD. Operand 265 states and 13460 transitions. [2023-12-09 15:39:42,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 265 states and 13460 transitions. [2023-12-09 15:39:42,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:39:42,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 265 states and 13460 transitions. [2023-12-09 15:39:42,556 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 266 states, 265 states have (on average 50.79245283018868) internal successors, (13460), 265 states have internal predecessors, (13460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:39:42,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 266 states, 266 states have (on average 185.0) internal successors, (49210), 266 states have internal predecessors, (49210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:39:42,587 INFO L81 ComplementDD]: Finished complementDD. Result has 266 states, 266 states have (on average 185.0) internal successors, (49210), 266 states have internal predecessors, (49210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:39:42,589 INFO L308 CegarLoopForPetriNet]: 168 programPoint places, 921 predicate places. [2023-12-09 15:39:42,589 INFO L500 AbstractCegarLoop]: Abstraction has has 1089 places, 6218 transitions, 73559 flow [2023-12-09 15:39:42,590 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 50.088235294117645) internal successors, (5109), 102 states have internal predecessors, (5109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:39:42,590 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:39:42,590 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:39:42,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-09 15:39:42,795 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:39:42,796 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:39:42,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:39:42,796 INFO L85 PathProgramCache]: Analyzing trace with hash 854209035, now seen corresponding path program 4 times [2023-12-09 15:39:42,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:39:42,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932833208] [2023-12-09 15:39:42,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:39:42,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:39:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:39:45,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:39:45,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:39:45,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932833208] [2023-12-09 15:39:45,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932833208] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:39:45,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238885649] [2023-12-09 15:39:45,273 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-09 15:39:45,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:39:45,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:39:45,274 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:39:45,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-09 15:39:45,391 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-09 15:39:45,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:39:45,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 56 conjunts are in the unsatisfiable core [2023-12-09 15:39:45,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:39:47,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:39:47,168 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:39:47,921 INFO L349 Elim1Store]: treesize reduction 22, result has 89.8 percent of original size [2023-12-09 15:39:47,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 98 treesize of output 226 [2023-12-09 15:39:53,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:39:53,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238885649] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:39:53,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:39:53,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 30, 29] total 88 [2023-12-09 15:39:53,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233028089] [2023-12-09 15:39:53,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:39:53,846 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2023-12-09 15:39:53,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:39:53,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2023-12-09 15:39:53,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=933, Invalid=6723, Unknown=0, NotChecked=0, Total=7656 [2023-12-09 15:39:53,850 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 185 [2023-12-09 15:39:53,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1089 places, 6218 transitions, 73559 flow. Second operand has 88 states, 88 states have (on average 57.45454545454545) internal successors, (5056), 88 states have internal predecessors, (5056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:39:53,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:39:53,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 185 [2023-12-09 15:39:53,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-12-09 15:39:56,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-12-09 15:39:56,789 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-12-09 15:39:56,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-09 15:39:56,805 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-09 15:39:56,805 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-09 15:39:56,994 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:39:56,994 WARN L624 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-16-9-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-9-1 term,while PolyPacSimplificationTermWalker was simplifying 9 xjuncts wrt. a ∧-12-3-1 context. [2023-12-09 15:39:56,997 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-12-09 15:39:56,997 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-12-09 15:39:56,997 INFO L457 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2023-12-09 15:39:56,999 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-09 15:39:56,999 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-09 15:39:57,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:39:57 BasicIcfg [2023-12-09 15:39:57,002 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-09 15:39:57,002 INFO L158 Benchmark]: Toolchain (without parser) took 262322.20ms. Allocated memory was 375.4MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 323.4MB in the beginning and 662.0MB in the end (delta: -338.6MB). Peak memory consumption was 907.6MB. Max. memory is 8.0GB. [2023-12-09 15:39:57,002 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 234.9MB. Free memory is still 186.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-09 15:39:57,002 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.17ms. Allocated memory is still 375.4MB. Free memory was 322.9MB in the beginning and 311.3MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-09 15:39:57,003 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.98ms. Allocated memory is still 375.4MB. Free memory was 311.3MB in the beginning and 308.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-09 15:39:57,003 INFO L158 Benchmark]: Boogie Preprocessor took 25.43ms. Allocated memory is still 375.4MB. Free memory was 308.7MB in the beginning and 307.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-09 15:39:57,003 INFO L158 Benchmark]: RCFGBuilder took 474.43ms. Allocated memory is still 375.4MB. Free memory was 307.2MB in the beginning and 277.2MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2023-12-09 15:39:57,003 INFO L158 Benchmark]: TraceAbstraction took 261589.62ms. Allocated memory was 375.4MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 276.2MB in the beginning and 662.0MB in the end (delta: -385.8MB). Peak memory consumption was 860.4MB. Max. memory is 8.0GB. [2023-12-09 15:39:57,004 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.10ms. Allocated memory is still 234.9MB. Free memory is still 186.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.17ms. Allocated memory is still 375.4MB. Free memory was 322.9MB in the beginning and 311.3MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.98ms. Allocated memory is still 375.4MB. Free memory was 311.3MB in the beginning and 308.7MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.43ms. Allocated memory is still 375.4MB. Free memory was 308.7MB in the beginning and 307.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 474.43ms. Allocated memory is still 375.4MB. Free memory was 307.2MB in the beginning and 277.2MB in the end (delta: 29.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 261589.62ms. Allocated memory was 375.4MB in the beginning and 1.6GB in the end (delta: 1.2GB). Free memory was 276.2MB in the beginning and 662.0MB in the end (delta: -385.8MB). Peak memory consumption was 860.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-16-9-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-9-1 term,while PolyPacSimplificationTermWalker was simplifying 9 xjuncts wrt. a ∧-12-3-1 context. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-16-9-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-9-1 term,while PolyPacSimplificationTermWalker was simplifying 9 xjuncts wrt. a ∧-12-3-1 context. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-16-9-3-2-2-1 term,while PolyPacSimplificationTermWalker was simplifying a ∨-9-1 term,while PolyPacSimplificationTermWalker was simplifying 9 xjuncts wrt. a ∧-12-3-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 195 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 261.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 175.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 467 mSolverCounterUnknown, 11628 SdHoareTripleChecker+Valid, 31.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11628 mSDsluCounter, 13903 SdHoareTripleChecker+Invalid, 28.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 952 IncrementalHoareTripleChecker+Unchecked, 13462 mSDsCounter, 2399 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30986 IncrementalHoareTripleChecker+Invalid, 34804 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2399 mSolverCounterUnsat, 441 mSDtfsCounter, 30986 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 467 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2370 GetRequests, 1057 SyntacticMatches, 1 SemanticMatches, 1311 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 189034 ImplicationChecksByTransitivity, 150.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73559occurred in iteration=8, InterpolantAutomatonStates: 940, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 84.1s InterpolantComputationTime, 1984 NumberOfCodeBlocks, 1969 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2607 ConstructedInterpolants, 79 QuantifiedInterpolants, 54829 SizeOfPredicates, 197 NumberOfNonLiveVariables, 1382 ConjunctsInSsa, 257 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 7/55 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown