/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION --traceabstraction.abstraction.used.for.commutativity.in.por VARIABLES_GLOBAL -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-e23131f-m [2024-05-03 12:11:40,154 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-03 12:11:40,215 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-03 12:11:40,220 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-03 12:11:40,221 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-03 12:11:40,243 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-03 12:11:40,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-03 12:11:40,244 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-03 12:11:40,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-03 12:11:40,247 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-03 12:11:40,248 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-03 12:11:40,248 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-03 12:11:40,248 INFO L153 SettingsManager]: * Use SBE=true [2024-05-03 12:11:40,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-03 12:11:40,250 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-03 12:11:40,250 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-03 12:11:40,250 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-03 12:11:40,250 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-03 12:11:40,250 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-03 12:11:40,250 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-03 12:11:40,250 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-03 12:11:40,251 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-03 12:11:40,252 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-03 12:11:40,252 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-03 12:11:40,252 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-03 12:11:40,252 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-03 12:11:40,252 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-03 12:11:40,252 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-03 12:11:40,253 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-03 12:11:40,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 12:11:40,254 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-03 12:11:40,254 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-03 12:11:40,254 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-03 12:11:40,254 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-03 12:11:40,254 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-03 12:11:40,254 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-03 12:11:40,254 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-03 12:11:40,254 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-03 12:11:40,254 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-03 12:11:40,255 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/UGemCutter-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: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstraction used for commutativity in POR -> VARIABLES_GLOBAL [2024-05-03 12:11:40,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-03 12:11:40,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-03 12:11:40,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-03 12:11:40,448 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-03 12:11:40,448 INFO L274 PluginConnector]: CDTParser initialized [2024-05-03 12:11:40,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c [2024-05-03 12:11:41,510 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-03 12:11:41,672 INFO L384 CDTParser]: Found 1 translation units. [2024-05-03 12:11:41,672 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c [2024-05-03 12:11:41,682 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0ed6b8584/651551d23b61456990e81107e6d99360/FLAG08d0ac3ee [2024-05-03 12:11:41,695 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0ed6b8584/651551d23b61456990e81107e6d99360 [2024-05-03 12:11:41,698 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-03 12:11:41,700 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-03 12:11:41,702 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-03 12:11:41,702 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-03 12:11:41,706 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-03 12:11:41,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:11:41" (1/1) ... [2024-05-03 12:11:41,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e02a16a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:11:41, skipping insertion in model container [2024-05-03 12:11:41,707 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 12:11:41" (1/1) ... [2024-05-03 12:11:41,729 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-03 12:11:41,859 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2500,2513] [2024-05-03 12:11:41,866 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 12:11:41,872 INFO L202 MainTranslator]: Completed pre-run [2024-05-03 12:11:41,891 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2500,2513] [2024-05-03 12:11:41,893 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 12:11:41,903 INFO L206 MainTranslator]: Completed translation [2024-05-03 12:11:41,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:11:41 WrapperNode [2024-05-03 12:11:41,904 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-03 12:11:41,905 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-03 12:11:41,905 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-03 12:11:41,905 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-03 12:11:41,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:11:41" (1/1) ... [2024-05-03 12:11:41,915 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:11:41" (1/1) ... [2024-05-03 12:11:41,939 INFO L138 Inliner]: procedures = 24, calls = 34, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 147 [2024-05-03 12:11:41,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-03 12:11:41,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-03 12:11:41,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-03 12:11:41,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-03 12:11:41,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:11:41" (1/1) ... [2024-05-03 12:11:41,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:11:41" (1/1) ... [2024-05-03 12:11:41,949 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:11:41" (1/1) ... [2024-05-03 12:11:41,949 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:11:41" (1/1) ... [2024-05-03 12:11:41,954 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:11:41" (1/1) ... [2024-05-03 12:11:41,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:11:41" (1/1) ... [2024-05-03 12:11:41,957 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:11:41" (1/1) ... [2024-05-03 12:11:41,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:11:41" (1/1) ... [2024-05-03 12:11:41,960 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-03 12:11:41,960 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-03 12:11:41,960 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-03 12:11:41,960 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-03 12:11:41,961 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:11:41" (1/1) ... [2024-05-03 12:11:41,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 12:11:41,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 12:11:41,986 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-03 12:11:42,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-03 12:11:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-03 12:11:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-03 12:11:42,047 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-03 12:11:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-03 12:11:42,047 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-03 12:11:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-03 12:11:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-03 12:11:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-03 12:11:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-03 12:11:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-03 12:11:42,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-03 12:11:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-03 12:11:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-03 12:11:42,051 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-03 12:11:42,158 INFO L241 CfgBuilder]: Building ICFG [2024-05-03 12:11:42,160 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-03 12:11:42,360 INFO L282 CfgBuilder]: Performing block encoding [2024-05-03 12:11:42,371 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-03 12:11:42,372 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-03 12:11:42,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:11:42 BoogieIcfgContainer [2024-05-03 12:11:42,372 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-03 12:11:42,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-03 12:11:42,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-03 12:11:42,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-03 12:11:42,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 12:11:41" (1/3) ... [2024-05-03 12:11:42,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11cdffd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:11:42, skipping insertion in model container [2024-05-03 12:11:42,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 12:11:41" (2/3) ... [2024-05-03 12:11:42,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11cdffd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 12:11:42, skipping insertion in model container [2024-05-03 12:11:42,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 12:11:42" (3/3) ... [2024-05-03 12:11:42,378 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-3.wvr.c [2024-05-03 12:11:42,385 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-03 12:11:42,392 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-03 12:11:42,392 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-03 12:11:42,392 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-03 12:11:42,460 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-03 12:11:42,511 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 12:11:42,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 12:11:42,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 12:11:42,516 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-03 12:11:42,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-03 12:11:42,550 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 12:11:42,556 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-03 12:11:42,561 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@20a1276f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 12:11:42,561 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 12:11:42,766 INFO L78 Accepts]: Start accepts. Automaton has currently 738 states, but on-demand construction may add more states Word has length 100 [2024-05-03 12:11:42,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 12:11:42,767 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 12:11:42,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 12:11:42,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1566695842, now seen corresponding path program 1 times [2024-05-03 12:11:42,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 12:11:42,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139219884] [2024-05-03 12:11:42,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 12:11:42,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 12:11:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 12:11:43,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 12:11:43,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 12:11:43,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139219884] [2024-05-03 12:11:43,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139219884] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 12:11:43,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 12:11:43,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-03 12:11:43,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766062509] [2024-05-03 12:11:43,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 12:11:43,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-03 12:11:43,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 12:11:43,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-03 12:11:43,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-03 12:11:43,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:11:43,037 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 12:11:43,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 50.0) internal successors, (100), 2 states have internal predecessors, (100), 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) [2024-05-03 12:11:43,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:11:43,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:11:43,082 INFO L78 Accepts]: Start accepts. Automaton has currently 738 states, but on-demand construction may add more states Word has length 95 [2024-05-03 12:11:43,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 12:11:43,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-03 12:11:43,083 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 12:11:43,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 12:11:43,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1119003591, now seen corresponding path program 1 times [2024-05-03 12:11:43,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 12:11:43,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636393033] [2024-05-03 12:11:43,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 12:11:43,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 12:11:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 12:11:43,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 12:11:43,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 12:11:43,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636393033] [2024-05-03 12:11:43,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636393033] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 12:11:43,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 12:11:43,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-03 12:11:43,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361861976] [2024-05-03 12:11:43,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 12:11:43,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-03 12:11:43,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 12:11:43,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-03 12:11:43,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-05-03 12:11:43,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:11:43,427 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 12:11:43,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 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) [2024-05-03 12:11:43,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:11:43,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:11:43,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:11:43,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 12:11:43,544 INFO L78 Accepts]: Start accepts. Automaton has currently 745 states, but on-demand construction may add more states Word has length 103 [2024-05-03 12:11:43,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 12:11:43,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-03 12:11:43,547 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 12:11:43,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 12:11:43,548 INFO L85 PathProgramCache]: Analyzing trace with hash -688973404, now seen corresponding path program 1 times [2024-05-03 12:11:43,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 12:11:43,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839004688] [2024-05-03 12:11:43,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 12:11:43,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 12:11:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 12:11:43,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-03 12:11:43,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 12:11:43,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839004688] [2024-05-03 12:11:43,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839004688] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 12:11:43,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 12:11:43,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-03 12:11:43,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252058104] [2024-05-03 12:11:43,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 12:11:43,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-03 12:11:43,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 12:11:43,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-03 12:11:43,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-03 12:11:43,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:11:43,835 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 12:11:43,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 6 states have internal predecessors, (103), 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) [2024-05-03 12:11:43,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:11:43,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 12:11:43,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:11:43,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:11:43,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 12:11:43,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 12:11:43,962 INFO L78 Accepts]: Start accepts. Automaton has currently 653 states, but on-demand construction may add more states Word has length 116 [2024-05-03 12:11:43,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 12:11:43,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-03 12:11:43,964 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 12:11:43,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 12:11:43,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1997832491, now seen corresponding path program 1 times [2024-05-03 12:11:43,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 12:11:43,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487741455] [2024-05-03 12:11:43,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 12:11:43,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 12:11:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 12:11:44,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-03 12:11:44,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 12:11:44,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487741455] [2024-05-03 12:11:44,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487741455] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 12:11:44,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927166093] [2024-05-03 12:11:44,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 12:11:44,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 12:11:44,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 12:11:44,362 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 12:11:44,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-03 12:11:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 12:11:44,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-03 12:11:44,451 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 12:11:44,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-03 12:11:44,518 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 12:11:44,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-03 12:11:44,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927166093] provided 1 perfect and 1 imperfect interpolant sequences [2024-05-03 12:11:44,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-05-03 12:11:44,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 7 [2024-05-03 12:11:44,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696802932] [2024-05-03 12:11:44,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 12:11:44,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-03 12:11:44,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 12:11:44,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-03 12:11:44,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-05-03 12:11:44,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:11:44,591 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 12:11:44,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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) [2024-05-03 12:11:44,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:11:44,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 12:11:44,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 12:11:44,591 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:11:44,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:11:44,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 12:11:44,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 12:11:44,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-03 12:11:44,639 INFO L78 Accepts]: Start accepts. Automaton has currently 660 states, but on-demand construction may add more states Word has length 153 [2024-05-03 12:11:44,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 12:11:44,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-03 12:11:44,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 12:11:44,850 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 12:11:44,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 12:11:44,851 INFO L85 PathProgramCache]: Analyzing trace with hash 783855516, now seen corresponding path program 1 times [2024-05-03 12:11:44,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 12:11:44,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629858214] [2024-05-03 12:11:44,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 12:11:44,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 12:11:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 12:11:45,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-03 12:11:45,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 12:11:45,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629858214] [2024-05-03 12:11:45,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629858214] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 12:11:45,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812830127] [2024-05-03 12:11:45,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 12:11:45,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 12:11:45,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 12:11:45,259 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 12:11:45,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-03 12:11:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 12:11:45,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 33 conjunts are in the unsatisfiable core [2024-05-03 12:11:45,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 12:11:45,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-05-03 12:11:45,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 12:11:45,923 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 12:11:46,361 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-05-03 12:11:46,362 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 19 treesize of output 7 [2024-05-03 12:11:47,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 12:11:47,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812830127] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 12:11:47,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 12:11:47,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 18, 18] total 36 [2024-05-03 12:11:47,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048568279] [2024-05-03 12:11:47,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 12:11:47,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-05-03 12:11:47,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 12:11:47,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-05-03 12:11:47,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1145, Unknown=0, NotChecked=0, Total=1260 [2024-05-03 12:11:47,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:11:47,054 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 12:11:47,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 11.222222222222221) internal successors, (404), 36 states have internal predecessors, (404), 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) [2024-05-03 12:11:47,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:11:47,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 12:11:47,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 12:11:47,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-03 12:11:47,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:11:48,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:11:48,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 12:11:48,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 12:11:48,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-03 12:11:48,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-03 12:11:48,329 INFO L78 Accepts]: Start accepts. Automaton has currently 875 states, but on-demand construction may add more states Word has length 174 [2024-05-03 12:11:48,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 12:11:48,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-03 12:11:48,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 12:11:48,536 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 12:11:48,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 12:11:48,537 INFO L85 PathProgramCache]: Analyzing trace with hash -569130302, now seen corresponding path program 2 times [2024-05-03 12:11:48,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 12:11:48,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163985800] [2024-05-03 12:11:48,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 12:11:48,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 12:11:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 12:11:49,085 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-03 12:11:49,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 12:11:49,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163985800] [2024-05-03 12:11:49,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163985800] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 12:11:49,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524289157] [2024-05-03 12:11:49,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-03 12:11:49,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 12:11:49,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 12:11:49,087 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 12:11:49,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-03 12:11:49,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-03 12:11:49,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 12:11:49,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-03 12:11:49,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 12:11:50,005 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-03 12:11:50,005 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 12:11:50,598 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-05-03 12:11:50,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524289157] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 12:11:50,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 12:11:50,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 30 [2024-05-03 12:11:50,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110249966] [2024-05-03 12:11:50,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 12:11:50,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-05-03 12:11:50,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 12:11:50,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-05-03 12:11:50,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2024-05-03 12:11:50,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:11:50,601 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 12:11:50,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.166666666666666) internal successors, (245), 30 states have internal predecessors, (245), 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) [2024-05-03 12:11:50,601 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:11:50,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 12:11:50,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 12:11:50,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-03 12:11:50,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-03 12:11:50,602 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:11:52,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:11:52,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 12:11:52,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 12:11:52,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-03 12:11:52,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-03 12:11:52,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-03 12:11:52,600 INFO L78 Accepts]: Start accepts. Automaton has currently 548 states, but on-demand construction may add more states Word has length 213 [2024-05-03 12:11:52,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 12:11:52,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-03 12:11:52,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 12:11:52,806 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 12:11:52,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 12:11:52,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1095653113, now seen corresponding path program 3 times [2024-05-03 12:11:52,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 12:11:52,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585291463] [2024-05-03 12:11:52,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 12:11:52,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 12:11:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 12:11:53,329 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-05-03 12:11:53,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 12:11:53,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585291463] [2024-05-03 12:11:53,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585291463] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 12:11:53,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681184115] [2024-05-03 12:11:53,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-03 12:11:53,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 12:11:53,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 12:11:53,332 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 12:11:53,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-03 12:11:53,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-05-03 12:11:53,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 12:11:53,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 91 conjunts are in the unsatisfiable core [2024-05-03 12:11:53,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 12:11:54,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-05-03 12:11:54,881 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 [2024-05-03 12:11:54,956 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 [2024-05-03 12:11:57,688 INFO L349 Elim1Store]: treesize reduction 37, result has 54.3 percent of original size [2024-05-03 12:11:57,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 165 treesize of output 88 [2024-05-03 12:11:57,936 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 12:11:57,937 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 12:12:04,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 12:12:04,081 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 704 treesize of output 404 [2024-05-03 12:12:04,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 12:12:04,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 2052 treesize of output 1956 [2024-05-03 12:12:04,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 12:12:04,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 465 treesize of output 473 [2024-05-03 12:12:10,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-03 12:12:10,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 316 treesize of output 480 [2024-05-03 12:12:47,174 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-03 12:12:56,464 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-03 12:13:10,049 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-03 12:13:54,434 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-03 12:13:55,342 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2024-05-03 12:14:02,034 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 12:14:02,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681184115] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 12:14:02,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 12:14:02,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 48, 44] total 103 [2024-05-03 12:14:02,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330011095] [2024-05-03 12:14:02,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 12:14:02,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2024-05-03 12:14:02,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 12:14:02,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2024-05-03 12:14:02,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=9915, Unknown=59, NotChecked=0, Total=10506 [2024-05-03 12:14:02,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:14:02,040 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 12:14:02,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 5.87378640776699) internal successors, (605), 103 states have internal predecessors, (605), 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) [2024-05-03 12:14:02,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:14:02,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 12:14:02,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 12:14:02,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-03 12:14:02,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-03 12:14:02,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-03 12:14:02,041 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:14:17,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:14:17,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 12:14:17,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 12:14:17,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-03 12:14:17,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-03 12:14:17,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-03 12:14:17,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2024-05-03 12:14:17,329 INFO L78 Accepts]: Start accepts. Automaton has currently 705 states, but on-demand construction may add more states Word has length 258 [2024-05-03 12:14:17,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 12:14:17,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-05-03 12:14:17,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-05-03 12:14:17,531 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 12:14:17,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 12:14:17,531 INFO L85 PathProgramCache]: Analyzing trace with hash -609926049, now seen corresponding path program 4 times [2024-05-03 12:14:17,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 12:14:17,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715131327] [2024-05-03 12:14:17,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 12:14:17,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 12:14:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 12:14:24,594 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-05-03 12:14:24,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 12:14:24,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715131327] [2024-05-03 12:14:24,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715131327] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 12:14:24,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719263030] [2024-05-03 12:14:24,594 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-03 12:14:24,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 12:14:24,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 12:14:24,595 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 12:14:24,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-05-03 12:14:24,843 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-03 12:14:24,844 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 12:14:24,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 30 conjunts are in the unsatisfiable core [2024-05-03 12:14:24,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 12:14:34,763 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-05-03 12:14:34,763 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 12:14:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-05-03 12:14:40,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719263030] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 12:14:40,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 12:14:40,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 18] total 47 [2024-05-03 12:14:40,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774388404] [2024-05-03 12:14:40,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 12:14:40,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-05-03 12:14:40,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 12:14:40,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-05-03 12:14:40,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=1860, Unknown=3, NotChecked=0, Total=2162 [2024-05-03 12:14:40,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:14:40,983 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 12:14:40,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 7.51063829787234) internal successors, (353), 47 states have internal predecessors, (353), 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) [2024-05-03 12:14:40,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:14:40,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 12:14:40,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 12:14:40,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-03 12:14:40,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-03 12:14:40,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-03 12:14:40,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2024-05-03 12:14:40,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:14:57,672 WARN L293 SmtUtils]: Spent 10.85s on a formula simplification. DAG size of input: 74 DAG size of output: 64 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-03 12:15:05,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-03 12:16:12,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:16:12,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-03 12:16:12,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 12:16:12,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-03 12:16:12,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-05-03 12:16:12,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-03 12:16:12,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2024-05-03 12:16:12,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-03 12:16:12,429 INFO L78 Accepts]: Start accepts. Automaton has currently 1372 states, but on-demand construction may add more states Word has length 336 [2024-05-03 12:16:12,430 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 12:16:12,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-05-03 12:16:12,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 12:16:12,638 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 12:16:12,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 12:16:12,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1316853759, now seen corresponding path program 5 times [2024-05-03 12:16:12,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 12:16:12,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475725147] [2024-05-03 12:16:12,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 12:16:12,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 12:16:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 12:16:13,656 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 675 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-05-03 12:16:13,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 12:16:13,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475725147] [2024-05-03 12:16:13,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475725147] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-03 12:16:13,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429414760] [2024-05-03 12:16:13,657 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-03 12:16:13,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-03 12:16:13,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 12:16:13,658 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-03 12:16:13,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-05-03 12:16:28,455 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-05-03 12:16:28,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-03 12:16:28,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 54 conjunts are in the unsatisfiable core [2024-05-03 12:16:28,467 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-03 12:16:29,226 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 635 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-05-03 12:16:29,227 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-03 12:20:12,380 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 0 proven. 565 refuted. 70 times theorem prover too weak. 157 trivial. 0 not checked. [2024-05-03 12:20:12,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429414760] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-03 12:20:12,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-03 12:20:12,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 56 [2024-05-03 12:20:12,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270034673] [2024-05-03 12:20:12,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-03 12:20:12,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-05-03 12:20:12,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 12:20:12,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-05-03 12:20:12,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2779, Unknown=92, NotChecked=0, Total=3080 [2024-05-03 12:20:12,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:20:12,383 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 12:20:12,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 7.803571428571429) internal successors, (437), 56 states have internal predecessors, (437), 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) [2024-05-03 12:20:12,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:20:12,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-03 12:20:12,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-03 12:20:12,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-05-03 12:20:12,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2024-05-03 12:20:12,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2024-05-03 12:20:12,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2024-05-03 12:20:12,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-03 12:20:12,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 12:20:16,981 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296))) (and (<= .cse0 0) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 6) .cse2)) (< v_z_2 (+ (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (= 6 |c_thread1Thread1of1ForFork0_~i~0#1|) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse3 (* 8589934593 v_z_2))) (< (+ (* (div .cse3 4294967296) 4294967296) 6) .cse3)) (< v_z_2 (+ (mod (+ 5 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (let ((.cse4 (* 8589934593 v_z_2))) (< (+ (* (div .cse4 4294967296) 4294967296) 6) .cse4)))) (let ((.cse5 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse5 4294967296) 4294967296)) (+ .cse5 (* .cse0 4294967296)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse6 (* 8589934593 v_z_2))) (< (+ (* (div .cse6 4294967296) 4294967296) 6) .cse6)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse7 (* 8589934593 v_z_2))) (< (+ (* (div .cse7 4294967296) 4294967296) 6) .cse7)) (< v_z_2 (+ (mod (+ 6 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))))) is different from false [2024-05-03 12:20:19,008 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 6) .cse2)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< v_z_2 (+ (mod (+ 5 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (< 4294967295 v_z_2) (let ((.cse3 (* 8589934593 v_z_2))) (< (+ (* (div .cse3 4294967296) 4294967296) 6) .cse3)))) (let ((.cse4 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse4 4294967296) 4294967296)) .cse4)) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse5 (* 8589934593 v_z_2))) (< (+ (* (div .cse5 4294967296) 4294967296) 6) .cse5)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse6 (* 8589934593 v_z_2))) (< (+ (* (div .cse6 4294967296) 4294967296) 6) .cse6)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 1))))) is different from false [2024-05-03 12:20:21,044 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< v_z_2 (+ (mod (+ 5 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)) (< 4294967295 v_z_2) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 6) .cse2)))) (let ((.cse3 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse3 4294967296) 4294967296)) .cse3)) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse4 (* 8589934593 v_z_2))) (< (+ (* (div .cse4 4294967296) 4294967296) 6) .cse4)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse5 (* 8589934593 v_z_2))) (< (+ (* (div .cse5 4294967296) 4294967296) 6) .cse5)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 1))))) is different from false [2024-05-03 12:20:23,063 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 6) .cse2)) (< v_z_2 (+ (mod (+ 5 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (let ((.cse3 (* 8589934593 v_z_2))) (< (+ (* (div .cse3 4294967296) 4294967296) 6) .cse3)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse4 (* 8589934593 v_z_2))) (< (+ (* (div .cse4 4294967296) 4294967296) 6) .cse4)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (let ((.cse5 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse5 4294967296) 4294967296)) .cse5))) is different from false [2024-05-03 12:20:25,073 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 6) .cse2)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (let ((.cse3 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse3 4294967296) 4294967296)) .cse3)) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse4 (* 8589934593 v_z_2))) (< (+ (* (div .cse4 4294967296) 4294967296) 6) .cse4)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse5 (* 8589934593 v_z_2))) (< (+ (* (div .cse5 4294967296) 4294967296) 6) .cse5)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 1))))) is different from false [2024-05-03 12:20:27,084 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (let ((.cse2 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse2 4294967296) 4294967296)) .cse2)) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse3 (* 8589934593 v_z_2))) (< (+ (* (div .cse3 4294967296) 4294967296) 6) .cse3)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse4 (* 8589934593 v_z_2))) (< (+ (* (div .cse4 4294967296) 4294967296) 6) .cse4)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 4) 4294967296) 1))))) is different from false [2024-05-03 12:20:29,109 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod (+ 4 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 6) .cse2)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse3 (* 8589934593 v_z_2))) (< (+ (* (div .cse3 4294967296) 4294967296) 6) .cse3)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (let ((.cse4 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse4 4294967296) 4294967296)) .cse4))) is different from false [2024-05-03 12:20:31,116 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 6) .cse2)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (let ((.cse3 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse3 4294967296) 4294967296)) .cse3)) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse4 (* 8589934593 v_z_2))) (< (+ (* (div .cse4 4294967296) 4294967296) 6) .cse4)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1))))) is different from false [2024-05-03 12:20:33,150 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (let ((.cse2 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse2 4294967296) 4294967296)) .cse2)) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse3 (* 8589934593 v_z_2))) (< (+ (* (div .cse3 4294967296) 4294967296) 6) .cse3)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1))))) is different from false [2024-05-03 12:20:35,167 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 6) .cse2)) (< v_z_2 (+ (mod (+ 3 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (let ((.cse3 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse3 4294967296) 4294967296)) .cse3))) is different from false [2024-05-03 12:20:37,174 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse2 (* 8589934593 v_z_2))) (< (+ (* (div .cse2 4294967296) 4294967296) 6) .cse2)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (let ((.cse3 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse3 4294967296) 4294967296)) .cse3))) is different from false [2024-05-03 12:20:39,181 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_~i~0#1| 1) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 1)))) (let ((.cse2 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse2 4294967296) 4294967296)) .cse2))) is different from false [2024-05-03 12:20:41,200 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (let ((.cse0 (* 8589934593 v_z_2))) (< (+ (* (div .cse0 4294967296) 4294967296) 6) .cse0)) (< v_z_2 (+ (mod (+ 2 |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296) 1)))) (forall ((v_z_2 Int)) (or (< 4294967295 v_z_2) (< v_z_2 (+ (mod (+ |c_thread1Thread1of1ForFork0_#t~post2#1| 1) 4294967296) 1)) (let ((.cse1 (* 8589934593 v_z_2))) (< (+ (* (div .cse1 4294967296) 4294967296) 6) .cse1)))) (let ((.cse2 (* 3 c_~n~0))) (<= (+ 7 (* (div .cse2 4294967296) 4294967296)) .cse2))) is different from false [2024-05-03 12:21:54,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:21:56,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:21:58,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:22:00,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:22:03,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:22:05,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:22:07,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:22:09,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:22:11,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:22:13,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:22:15,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:22:17,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:22:19,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:22:21,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:22:23,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:22:25,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:22:27,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:22:29,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:22:31,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:22:33,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:22:35,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:22:37,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:22:39,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:22:42,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:22:44,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:22:46,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:22:48,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:22:50,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:22:52,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:22:54,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:22:56,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:24:14,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:24:16,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:24:18,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:24:20,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:24:23,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:24:25,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:24:27,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:24:29,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:24:31,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:24:33,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:24:35,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:24:37,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:24:39,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:24:41,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:24:43,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:24:45,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:24:47,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:24:49,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:24:51,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:24:53,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:24:56,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:24:58,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:00,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:02,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:04,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:06,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:08,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:11,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:13,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:15,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:17,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:19,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:21,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:23,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:25,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:27,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:29,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:31,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:33,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:35,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:37,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:39,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:41,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:43,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:45,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:49,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:51,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:53,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:55,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:57,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:25:59,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:26:01,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-05-03 12:26:03,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2024-05-03 12:26:03,394 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-03 12:26:03,394 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-03 12:26:03,394 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-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 [2024-05-03 12:26:04,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-05-03 12:26:04,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-03 12:26:04,601 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-05-03 12:26:04,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2024-05-03 12:26:04,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-03 12:26:04,680 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2024-05-03 12:26:04,682 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-03 12:26:04,686 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2024-05-03 12:26:04,687 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/3) [2024-05-03 12:26:04,689 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-03 12:26:04,689 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-03 12:26:04,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.05 12:26:04 BasicIcfg [2024-05-03 12:26:04,690 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-03 12:26:04,691 INFO L158 Benchmark]: Toolchain (without parser) took 862991.28ms. Allocated memory was 179.3MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 107.8MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 93.9MB. Max. memory is 8.0GB. [2024-05-03 12:26:04,691 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 179.3MB. Free memory is still 109.7MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-03 12:26:04,691 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.23ms. Allocated memory is still 179.3MB. Free memory was 107.6MB in the beginning and 95.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-05-03 12:26:04,691 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.77ms. Allocated memory is still 179.3MB. Free memory was 95.6MB in the beginning and 93.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-03 12:26:04,691 INFO L158 Benchmark]: Boogie Preprocessor took 20.03ms. Allocated memory is still 179.3MB. Free memory was 93.5MB in the beginning and 91.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-03 12:26:04,691 INFO L158 Benchmark]: RCFGBuilder took 411.74ms. Allocated memory was 179.3MB in the beginning and 295.7MB in the end (delta: 116.4MB). Free memory was 91.8MB in the beginning and 258.4MB in the end (delta: -166.6MB). Peak memory consumption was 17.4MB. Max. memory is 8.0GB. [2024-05-03 12:26:04,692 INFO L158 Benchmark]: TraceAbstraction took 862316.82ms. Allocated memory was 295.7MB in the beginning and 1.3GB in the end (delta: 983.6MB). Free memory was 257.4MB in the beginning and 1.1GB in the end (delta: -857.2MB). Peak memory consumption was 125.8MB. Max. memory is 8.0GB. [2024-05-03 12:26:04,693 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.40ms. Allocated memory is still 179.3MB. Free memory is still 109.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 202.23ms. Allocated memory is still 179.3MB. Free memory was 107.6MB in the beginning and 95.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.77ms. Allocated memory is still 179.3MB. Free memory was 95.6MB in the beginning and 93.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.03ms. Allocated memory is still 179.3MB. Free memory was 93.5MB in the beginning and 91.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 411.74ms. Allocated memory was 179.3MB in the beginning and 295.7MB in the end (delta: 116.4MB). Free memory was 91.8MB in the beginning and 258.4MB in the end (delta: -166.6MB). Peak memory consumption was 17.4MB. Max. memory is 8.0GB. * TraceAbstraction took 862316.82ms. Allocated memory was 295.7MB in the beginning and 1.3GB in the end (delta: 983.6MB). Free memory was 257.4MB in the beginning and 1.1GB in the end (delta: -857.2MB). Peak memory consumption was 125.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 792, independent: 696, independent conditional: 696, independent unconditional: 0, dependent: 96, dependent conditional: 96, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7428, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 702, dependent conditional: 702, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6726, independent: 5178, independent conditional: 0, independent unconditional: 5178, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1548, unknown conditional: 0, unknown unconditional: 1548] , Statistics on independence cache: Total cache size (in pairs): 693, Positive cache size: 693, Positive conditional cache size: 0, Positive unconditional cache size: 693, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 96, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 704, independent: 640, independent conditional: 640, independent unconditional: 0, dependent: 64, dependent conditional: 64, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7428, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 702, dependent conditional: 702, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6726, independent: 5178, independent conditional: 0, independent unconditional: 5178, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1548, unknown conditional: 0, unknown unconditional: 1548] , Statistics on independence cache: Total cache size (in pairs): 693, Positive cache size: 693, Positive conditional cache size: 0, Positive unconditional cache size: 693, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 160, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 704, independent: 640, independent conditional: 640, independent unconditional: 0, dependent: 64, dependent conditional: 64, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7428, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 702, dependent conditional: 702, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6726, independent: 5178, independent conditional: 0, independent unconditional: 5178, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1548, unknown conditional: 0, unknown unconditional: 1548] , Statistics on independence cache: Total cache size (in pairs): 776, Positive cache size: 776, Positive conditional cache size: 0, Positive unconditional cache size: 776, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 224, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 593, independent: 537, independent conditional: 537, independent unconditional: 0, dependent: 56, dependent conditional: 56, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7428, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 702, dependent conditional: 702, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6726, independent: 5178, independent conditional: 0, independent unconditional: 5178, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1548, unknown conditional: 0, unknown unconditional: 1548] , Statistics on independence cache: Total cache size (in pairs): 971, Positive cache size: 971, Positive conditional cache size: 0, Positive unconditional cache size: 971, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 280, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 599, independent: 544, independent conditional: 544, independent unconditional: 0, dependent: 55, dependent conditional: 55, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7428, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 702, dependent conditional: 702, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6726, independent: 5178, independent conditional: 0, independent unconditional: 5178, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1548, unknown conditional: 0, unknown unconditional: 1548] , Statistics on independence cache: Total cache size (in pairs): 1078, Positive cache size: 1078, Positive conditional cache size: 0, Positive unconditional cache size: 1078, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 335, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 813, independent: 740, independent conditional: 740, independent unconditional: 0, dependent: 73, dependent conditional: 73, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7428, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 702, dependent conditional: 702, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6726, independent: 5178, independent conditional: 0, independent unconditional: 5178, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1548, unknown conditional: 0, unknown unconditional: 1548] , Statistics on independence cache: Total cache size (in pairs): 1521, Positive cache size: 1521, Positive conditional cache size: 0, Positive unconditional cache size: 1521, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 408, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 378, independent: 338, independent conditional: 338, independent unconditional: 0, dependent: 40, dependent conditional: 40, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7428, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 702, dependent conditional: 702, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6726, independent: 5178, independent conditional: 0, independent unconditional: 5178, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1548, unknown conditional: 0, unknown unconditional: 1548] , Statistics on independence cache: Total cache size (in pairs): 1521, Positive cache size: 1521, Positive conditional cache size: 0, Positive unconditional cache size: 1521, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 448, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 498, independent: 445, independent conditional: 445, independent unconditional: 0, dependent: 53, dependent conditional: 53, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7428, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 702, dependent conditional: 702, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6726, independent: 5178, independent conditional: 0, independent unconditional: 5178, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1548, unknown conditional: 0, unknown unconditional: 1548] , Statistics on independence cache: Total cache size (in pairs): 1548, Positive cache size: 1548, Positive conditional cache size: 0, Positive unconditional cache size: 1548, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 501, Statistics for Abstraction: - StatisticsResult: Independence relation #9 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1154, independent: 1051, independent conditional: 1051, independent unconditional: 0, dependent: 103, dependent conditional: 103, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7428, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 702, dependent conditional: 702, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6726, independent: 5178, independent conditional: 0, independent unconditional: 5178, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1548, unknown conditional: 0, unknown unconditional: 1548] , Statistics on independence cache: Total cache size (in pairs): 1548, Positive cache size: 1548, Positive conditional cache size: 0, Positive unconditional cache size: 1548, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 604, Statistics for Abstraction: - StatisticsResult: Independence relation #10 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1193, independent: 1095, independent conditional: 1095, independent unconditional: 0, dependent: 98, dependent conditional: 98, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 7428, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 702, dependent conditional: 702, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 6726, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6726, independent: 6726, independent conditional: 0, independent unconditional: 6726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1548, independent: 1548, independent conditional: 0, independent unconditional: 1548, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 6726, independent: 5178, independent conditional: 0, independent unconditional: 5178, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1548, unknown conditional: 0, unknown unconditional: 1548] , Statistics on independence cache: Total cache size (in pairs): 1548, Positive cache size: 1548, Positive conditional cache size: 0, Positive unconditional cache size: 1548, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 702, Statistics for Abstraction: - StatisticsResult: Visitor Statistics States: 719, Transitions: 790, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 719, Transitions: 734, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 726, Transitions: 741, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 620, Transitions: 632, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 627, Transitions: 639, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 828, Transitions: 844, Traversal time: 1.3s - StatisticsResult: Visitor Statistics States: 462, Transitions: 469, Traversal time: 2.0s - StatisticsResult: Visitor Statistics States: 617, Transitions: 624, Traversal time: 15.3s - StatisticsResult: Visitor Statistics States: 1205, Transitions: 1218, Traversal time: 91.4s - StatisticsResult: Visitor Statistics States: 1157, Transitions: 1168, Traversal time: 352.3s - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 5 procedures, 235 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 862.2s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 462.9s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 320, 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, 16.1s SatisfiabilityAnalysisTime, 381.3s InterpolantComputationTime, 2798 NumberOfCodeBlocks, 2798 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4027 ConstructedInterpolants, 144 QuantifiedInterpolants, 59965 SizeOfPredicates, 132 NumberOfNonLiveVariables, 2288 ConjunctsInSsa, 232 ConjunctsInUnsatCore, 21 InterpolantComputations, 4 PerfectInterpolantSequences, 679/3511 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