/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/mult-dist.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 22:41:05,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 22:41:05,993 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-30 22:41:05,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 22:41:05,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 22:41:06,017 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 22:41:06,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 22:41:06,018 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 22:41:06,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 22:41:06,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 22:41:06,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 22:41:06,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 22:41:06,019 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 22:41:06,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 22:41:06,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 22:41:06,020 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 22:41:06,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 22:41:06,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 22:41:06,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 22:41:06,021 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 22:41:06,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 22:41:06,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 22:41:06,021 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 22:41:06,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 22:41:06,022 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 22:41:06,022 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 22:41:06,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 22:41:06,022 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 22:41:06,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 22:41:06,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 22:41:06,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 22:41:06,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 22:41:06,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 22:41:06,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 22:41:06,024 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-30 22:41:06,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-30 22:41:06,024 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 22:41:06,024 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 22:41:06,024 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 22:41:06,024 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-30 22:41:06,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 22:41:06,200 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 22:41:06,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 22:41:06,202 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 22:41:06,202 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 22:41:06,203 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/mult-dist.wvr.c [2024-05-30 22:41:07,267 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 22:41:07,445 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 22:41:07,446 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-dist.wvr.c [2024-05-30 22:41:07,461 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4ce53e49f/2ac1339b8686444390613cafcb15c4ee/FLAG2781946ab [2024-05-30 22:41:07,473 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/4ce53e49f/2ac1339b8686444390613cafcb15c4ee [2024-05-30 22:41:07,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 22:41:07,476 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 22:41:07,477 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 22:41:07,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 22:41:07,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 22:41:07,483 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 10:41:07" (1/1) ... [2024-05-30 22:41:07,484 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56a39ded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 10:41:07, skipping insertion in model container [2024-05-30 22:41:07,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 10:41:07" (1/1) ... [2024-05-30 22:41:07,500 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 22:41:07,614 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/mult-dist.wvr.c[2116,2129] [2024-05-30 22:41:07,617 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 22:41:07,623 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 22:41:07,637 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/mult-dist.wvr.c[2116,2129] [2024-05-30 22:41:07,644 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 22:41:07,654 INFO L206 MainTranslator]: Completed translation [2024-05-30 22:41:07,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 10:41:07 WrapperNode [2024-05-30 22:41:07,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 22:41:07,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 22:41:07,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 22:41:07,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 22:41:07,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 10:41:07" (1/1) ... [2024-05-30 22:41:07,672 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 10:41:07" (1/1) ... [2024-05-30 22:41:07,693 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 72 [2024-05-30 22:41:07,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 22:41:07,693 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 22:41:07,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 22:41:07,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 22:41:07,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 10:41:07" (1/1) ... [2024-05-30 22:41:07,703 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 10:41:07" (1/1) ... [2024-05-30 22:41:07,706 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 10:41:07" (1/1) ... [2024-05-30 22:41:07,706 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 10:41:07" (1/1) ... [2024-05-30 22:41:07,710 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 10:41:07" (1/1) ... [2024-05-30 22:41:07,712 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 10:41:07" (1/1) ... [2024-05-30 22:41:07,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 10:41:07" (1/1) ... [2024-05-30 22:41:07,719 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 10:41:07" (1/1) ... [2024-05-30 22:41:07,720 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 22:41:07,721 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 22:41:07,721 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 22:41:07,721 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 22:41:07,722 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 10:41:07" (1/1) ... [2024-05-30 22:41:07,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 22:41:07,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 22:41:07,746 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-30 22:41:07,770 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-30 22:41:07,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 22:41:07,787 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-30 22:41:07,787 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-30 22:41:07,787 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-30 22:41:07,787 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-30 22:41:07,787 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-05-30 22:41:07,787 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-05-30 22:41:07,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 22:41:07,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 22:41:07,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 22:41:07,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 22:41:07,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 22:41:07,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-30 22:41:07,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 22:41:07,789 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-30 22:41:07,860 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 22:41:07,861 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 22:41:08,152 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 22:41:08,160 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 22:41:08,160 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-30 22:41:08,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 10:41:08 BoogieIcfgContainer [2024-05-30 22:41:08,161 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 22:41:08,162 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 22:41:08,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 22:41:08,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 22:41:08,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 10:41:07" (1/3) ... [2024-05-30 22:41:08,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6fed38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 10:41:08, skipping insertion in model container [2024-05-30 22:41:08,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 10:41:07" (2/3) ... [2024-05-30 22:41:08,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6fed38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 10:41:08, skipping insertion in model container [2024-05-30 22:41:08,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 10:41:08" (3/3) ... [2024-05-30 22:41:08,166 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-dist.wvr.c [2024-05-30 22:41:08,173 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 22:41:08,179 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 22:41:08,179 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-30 22:41:08,180 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 22:41:08,257 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-05-30 22:41:08,319 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 22:41:08,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 22:41:08,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 22:41:08,322 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-30 22:41:08,331 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-30 22:41:08,391 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 22:41:08,398 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 22:41:08,410 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;@659a996c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 22:41:08,411 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 22:41:08,696 INFO L78 Accepts]: Start accepts. Automaton has currently 572 states, but on-demand construction may add more states Word has length 76 [2024-05-30 22:41:08,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 22:41:08,697 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 22:41:08,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 22:41:08,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1473421353, now seen corresponding path program 1 times [2024-05-30 22:41:08,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 22:41:08,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623006829] [2024-05-30 22:41:08,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:41:08,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 22:41:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 22:41:08,883 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-30 22:41:08,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 22:41:08,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623006829] [2024-05-30 22:41:08,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623006829] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 22:41:08,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 22:41:08,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 22:41:08,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065729183] [2024-05-30 22:41:08,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 22:41:08,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 22:41:08,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 22:41:08,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 22:41:08,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 22:41:08,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:41:08,912 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 22:41:08,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 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-30 22:41:08,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:41:08,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:41:08,960 INFO L78 Accepts]: Start accepts. Automaton has currently 572 states, but on-demand construction may add more states Word has length 75 [2024-05-30 22:41:08,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 22:41:08,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 22:41:08,961 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 22:41:08,962 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 22:41:08,962 INFO L85 PathProgramCache]: Analyzing trace with hash 601748910, now seen corresponding path program 1 times [2024-05-30 22:41:08,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 22:41:08,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834322671] [2024-05-30 22:41:08,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:41:08,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 22:41:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 22:41:09,552 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-30 22:41:09,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 22:41:09,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834322671] [2024-05-30 22:41:09,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834322671] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 22:41:09,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 22:41:09,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-30 22:41:09,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163236569] [2024-05-30 22:41:09,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 22:41:09,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-30 22:41:09,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 22:41:09,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-30 22:41:09,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-05-30 22:41:09,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:41:09,557 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 22:41:09,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 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-30 22:41:09,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:41:09,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:41:09,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:41:09,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 22:41:09,616 INFO L78 Accepts]: Start accepts. Automaton has currently 288 states, but on-demand construction may add more states Word has length 80 [2024-05-30 22:41:09,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 22:41:09,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-30 22:41:09,617 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 22:41:09,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 22:41:09,619 INFO L85 PathProgramCache]: Analyzing trace with hash 620088758, now seen corresponding path program 1 times [2024-05-30 22:41:09,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 22:41:09,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104620353] [2024-05-30 22:41:09,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:41:09,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 22:41:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 22:41:09,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 22:41:09,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 22:41:09,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104620353] [2024-05-30 22:41:09,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104620353] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 22:41:09,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973341473] [2024-05-30 22:41:09,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:41:09,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:41:09,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 22:41:10,038 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-30 22:41:10,056 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-30 22:41:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 22:41:10,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 11 conjunts are in the unsatisfiable core [2024-05-30 22:41:10,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 22:41:10,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 22:41:10,914 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 22:41:12,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 22:41:12,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973341473] provided 1 perfect and 1 imperfect interpolant sequences [2024-05-30 22:41:12,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-05-30 22:41:12,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 7] total 12 [2024-05-30 22:41:12,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527517739] [2024-05-30 22:41:12,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 22:41:12,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-30 22:41:12,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 22:41:12,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-30 22:41:12,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-05-30 22:41:12,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:41:12,109 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 22:41:12,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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-30 22:41:12,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:41:12,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 22:41:12,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:41:12,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:41:12,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 22:41:12,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:41:12,271 INFO L78 Accepts]: Start accepts. Automaton has currently 433 states, but on-demand construction may add more states Word has length 90 [2024-05-30 22:41:12,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 22:41:12,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-30 22:41:12,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-05-30 22:41:12,477 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 22:41:12,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 22:41:12,478 INFO L85 PathProgramCache]: Analyzing trace with hash -718090985, now seen corresponding path program 1 times [2024-05-30 22:41:12,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 22:41:12,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904414032] [2024-05-30 22:41:12,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:41:12,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 22:41:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 22:41:12,926 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-30 22:41:12,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 22:41:12,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904414032] [2024-05-30 22:41:12,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904414032] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 22:41:12,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145612635] [2024-05-30 22:41:12,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:41:12,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:41:12,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 22:41:12,937 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-30 22:41:12,969 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-30 22:41:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 22:41:13,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 23 conjunts are in the unsatisfiable core [2024-05-30 22:41:13,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 22:41:13,511 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-30 22:41:13,511 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 22:41:14,017 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-30 22:41:14,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145612635] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 22:41:14,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 22:41:14,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 37 [2024-05-30 22:41:14,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661346261] [2024-05-30 22:41:14,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 22:41:14,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-05-30 22:41:14,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 22:41:14,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-05-30 22:41:14,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2024-05-30 22:41:14,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:41:14,020 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 22:41:14,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.081081081081081) internal successors, (151), 37 states have internal predecessors, (151), 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-30 22:41:14,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:41:14,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 22:41:14,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:41:14,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:41:15,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:41:15,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 22:41:15,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:41:15,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-30 22:41:15,264 INFO L78 Accepts]: Start accepts. Automaton has currently 249 states, but on-demand construction may add more states Word has length 105 [2024-05-30 22:41:15,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 22:41:15,273 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-30 22:41:15,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:41:15,466 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 22:41:15,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 22:41:15,466 INFO L85 PathProgramCache]: Analyzing trace with hash 669846848, now seen corresponding path program 2 times [2024-05-30 22:41:15,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 22:41:15,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710765209] [2024-05-30 22:41:15,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:41:15,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 22:41:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 22:41:16,371 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 22:41:16,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 22:41:16,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710765209] [2024-05-30 22:41:16,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710765209] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 22:41:16,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270368995] [2024-05-30 22:41:16,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 22:41:16,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:41:16,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 22:41:16,373 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-30 22:41:16,401 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-30 22:41:16,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 22:41:16,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 22:41:16,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 35 conjunts are in the unsatisfiable core [2024-05-30 22:41:16,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 22:41:17,094 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 22:41:17,095 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 22:41:18,047 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 22:41:18,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270368995] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 22:41:18,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 22:41:18,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 51 [2024-05-30 22:41:18,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217850428] [2024-05-30 22:41:18,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 22:41:18,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-05-30 22:41:18,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 22:41:18,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-05-30 22:41:18,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=2252, Unknown=0, NotChecked=0, Total=2550 [2024-05-30 22:41:18,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:41:18,050 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 22:41:18,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.5294117647058822) internal successors, (180), 51 states have internal predecessors, (180), 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-30 22:41:18,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:41:18,050 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 22:41:18,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:41:18,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-30 22:41:18,051 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:41:19,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:41:19,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 22:41:19,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:41:19,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-30 22:41:19,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 22:41:19,502 INFO L78 Accepts]: Start accepts. Automaton has currently 313 states, but on-demand construction may add more states Word has length 125 [2024-05-30 22:41:19,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 22:41:19,522 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-30 22:41:19,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:41:19,721 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 22:41:19,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 22:41:19,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1257822016, now seen corresponding path program 3 times [2024-05-30 22:41:19,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 22:41:19,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898742862] [2024-05-30 22:41:19,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:41:19,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 22:41:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 22:41:20,547 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 22:41:20,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 22:41:20,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898742862] [2024-05-30 22:41:20,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898742862] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 22:41:20,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853969214] [2024-05-30 22:41:20,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 22:41:20,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:41:20,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 22:41:20,549 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-30 22:41:20,551 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-30 22:41:20,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-05-30 22:41:20,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 22:41:20,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 53 conjunts are in the unsatisfiable core [2024-05-30 22:41:20,773 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 22:41:21,762 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 22:41:21,762 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 22:41:23,616 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 22:41:23,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853969214] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 22:41:23,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 22:41:23,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31, 30] total 78 [2024-05-30 22:41:23,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600794389] [2024-05-30 22:41:23,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 22:41:23,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2024-05-30 22:41:23,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 22:41:23,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2024-05-30 22:41:23,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=5335, Unknown=0, NotChecked=0, Total=6006 [2024-05-30 22:41:23,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:41:23,630 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 22:41:23,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 3.08974358974359) internal successors, (241), 78 states have internal predecessors, (241), 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-30 22:41:23,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:41:23,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 22:41:23,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:41:23,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-30 22:41:23,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 22:41:23,630 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:41:39,852 WARN L293 SmtUtils]: Spent 13.08s on a formula simplification. DAG size of input: 80 DAG size of output: 67 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 22:41:49,195 WARN L293 SmtUtils]: Spent 8.15s on a formula simplification. DAG size of input: 76 DAG size of output: 63 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 22:41:55,489 WARN L293 SmtUtils]: Spent 5.62s on a formula simplification. DAG size of input: 73 DAG size of output: 60 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 22:42:03,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:42:03,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 22:42:03,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:42:03,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-30 22:42:03,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 22:42:03,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-05-30 22:42:03,049 INFO L78 Accepts]: Start accepts. Automaton has currently 437 states, but on-demand construction may add more states Word has length 165 [2024-05-30 22:42:03,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 22:42:03,055 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-30 22:42:03,250 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,SelfDestructingSolverStorable5 [2024-05-30 22:42:03,251 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 22:42:03,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 22:42:03,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1976210624, now seen corresponding path program 4 times [2024-05-30 22:42:03,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 22:42:03,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609732801] [2024-05-30 22:42:03,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 22:42:03,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 22:42:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 22:42:04,897 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 548 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 22:42:04,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 22:42:04,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609732801] [2024-05-30 22:42:04,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609732801] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 22:42:04,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647020287] [2024-05-30 22:42:04,898 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 22:42:04,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:42:04,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 22:42:04,899 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-30 22:42:04,905 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-30 22:42:05,060 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 22:42:05,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 22:42:05,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 84 conjunts are in the unsatisfiable core [2024-05-30 22:42:05,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 22:42:07,332 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 548 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 22:42:07,333 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 22:42:13,000 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 548 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 22:42:13,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647020287] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 22:42:13,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 22:42:13,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 46] total 128 [2024-05-30 22:42:13,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815700913] [2024-05-30 22:42:13,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 22:42:13,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2024-05-30 22:42:13,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 22:42:13,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2024-05-30 22:42:13,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1732, Invalid=14524, Unknown=0, NotChecked=0, Total=16256 [2024-05-30 22:42:13,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:42:13,040 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 22:42:13,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 128 states, 128 states have (on average 2.890625) internal successors, (370), 128 states have internal predecessors, (370), 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-30 22:42:13,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:42:13,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 22:42:13,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 22:42:13,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-30 22:42:13,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 22:42:13,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2024-05-30 22:42:13,044 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 22:43:26,544 WARN L293 SmtUtils]: Spent 37.97s on a formula simplification. DAG size of input: 107 DAG size of output: 93 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 22:44:55,066 WARN L293 SmtUtils]: Spent 52.66s on a formula simplification. DAG size of input: 131 DAG size of output: 119 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 22:44:56,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 22:44:58,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 22:45:00,922 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~a~0 4294967296))) (let ((.cse0 (< (+ 4294967295 (* (div (+ (- 2) .cse2) 4294967296) 4294967296)) .cse2)) (.cse1 (< (+ 4294967297 (* (div (+ .cse2 (- 4294967295)) 4294967296) 4294967296)) .cse2))) (and (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 5) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse2)) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 10) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 12) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 1) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 8) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296) .cse2)) (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 15) 4294967296) 4294967295) (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 14) 4294967296) 4294967295) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296) .cse2) .cse0 .cse1) (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 13) 4294967296) 4294967295) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 9) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 10) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 9) 4294967296) .cse2)) (or (< (mod (+ 7 |c_thread1Thread1of1ForFork2_#t~post1|) 4294967296) .cse2) .cse0 .cse1) (or (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 6) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 4) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 13) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 11) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 3) 4294967296) .cse2)) (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 14) 4294967296) 4294967295) (or (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 12) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 11) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 2) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) .cse2))))) is different from false [2024-05-30 22:45:29,923 WARN L293 SmtUtils]: Spent 15.14s on a formula simplification. DAG size of input: 90 DAG size of output: 91 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 22:45:33,780 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~a~0 4294967296))) (let ((.cse0 (< (+ 4294967295 (* (div (+ (- 2) .cse2) 4294967296) 4294967296)) .cse2)) (.cse1 (< (+ 4294967297 (* (div (+ .cse2 (- 4294967295)) 4294967296) 4294967296)) .cse2))) (and (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 5) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse2)) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 10) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 12) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 1) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 8) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296) .cse2)) (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 14) 4294967296) 4294967295) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296) .cse2) .cse0 .cse1) (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 13) 4294967296) 4294967295) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 9) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 10) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 9) 4294967296) .cse2)) (or (< (mod (+ 7 |c_thread1Thread1of1ForFork2_#t~post1|) 4294967296) .cse2) .cse0 .cse1) (or (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 6) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 4) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 13) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 11) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 3) 4294967296) .cse2)) (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 14) 4294967296) 4294967295) (or (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 12) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 11) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 2) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) .cse2))))) is different from false [2024-05-30 22:46:04,153 WARN L293 SmtUtils]: Spent 19.48s on a formula simplification. DAG size of input: 86 DAG size of output: 87 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 22:46:08,801 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~a~0 4294967296))) (let ((.cse0 (< (+ 4294967295 (* (div (+ (- 2) .cse2) 4294967296) 4294967296)) .cse2)) (.cse1 (< (+ 4294967297 (* (div (+ .cse2 (- 4294967295)) 4294967296) 4294967296)) .cse2))) (and (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 5) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse2)) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 10) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 12) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 1) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 8) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296) .cse2)) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296) .cse2) .cse0 .cse1) (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 13) 4294967296) 4294967295) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 9) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 10) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 9) 4294967296) .cse2)) (or (< (mod (+ 7 |c_thread1Thread1of1ForFork2_#t~post1|) 4294967296) .cse2) .cse0 .cse1) (or (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 6) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 4) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 13) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 11) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 3) 4294967296) .cse2)) (or (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 12) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 11) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 2) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) .cse2))))) is different from false [2024-05-30 22:46:36,067 WARN L293 SmtUtils]: Spent 17.43s on a formula simplification that was a NOOP. DAG size: 82 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 22:46:38,866 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~a~0 4294967296))) (let ((.cse0 (< (+ 4294967295 (* (div (+ (- 2) .cse2) 4294967296) 4294967296)) .cse2)) (.cse1 (< (+ 4294967297 (* (div (+ .cse2 (- 4294967295)) 4294967296) 4294967296)) .cse2))) (and (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 5) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse2)) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 10) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 12) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 1) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 8) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296) .cse2)) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296) .cse2) .cse0 .cse1) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 9) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 10) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 9) 4294967296) .cse2)) (or (< (mod (+ 7 |c_thread1Thread1of1ForFork2_#t~post1|) 4294967296) .cse2) .cse0 .cse1) (or (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 6) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 4) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 11) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 3) 4294967296) .cse2)) (or (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 12) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 11) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 2) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) .cse2))))) is different from false [2024-05-30 22:46:54,801 WARN L293 SmtUtils]: Spent 7.50s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 22:49:46,139 WARN L293 SmtUtils]: Spent 2.05m on a formula simplification that was a NOOP. DAG size: 122 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 22:49:48,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 22:49:50,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 22:49:53,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 22:49:55,331 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-30 22:49:57,341 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-30 22:49:59,346 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-30 22:50:00,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 22:52:39,625 WARN L293 SmtUtils]: Spent 1.83m on a formula simplification that was a NOOP. DAG size: 118 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 22:52:41,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 22:52:42,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 22:52:44,500 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 [] [2024-05-30 22:52:46,506 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 [] [2024-05-30 22:54:56,159 WARN L293 SmtUtils]: Spent 1.33m on a formula simplification that was a NOOP. DAG size: 113 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-05-30 22:54:58,165 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-30 22:55:00,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 22:55:01,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-05-30 22:55:03,473 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~a~0 4294967296))) (let ((.cse0 (< (+ 4294967295 (* (div (+ (- 2) .cse2) 4294967296) 4294967296)) .cse2)) (.cse1 (< (+ 4294967297 (* (div (+ .cse2 (- 4294967295)) 4294967296) 4294967296)) .cse2))) (and (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 5) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ 5 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse2)) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 6) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 1) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 8) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 3) 4294967296) .cse2)) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 1) 4294967296) .cse2) .cse0 .cse1) (or (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 2) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 9) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 8) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 10) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 9) 4294967296) .cse2)) (or (< (mod (+ 7 |c_thread1Thread1of1ForFork2_#t~post1|) 4294967296) .cse2) .cse0 .cse1) (or (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 6) 4294967296) .cse2) .cse0 .cse1) (or .cse0 .cse1 (< (mod (+ c_thread1Thread1of1ForFork2_~i~0 4) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 4) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ 7 c_thread1Thread1of1ForFork2_~i~0) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 3) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod (+ |c_thread1Thread1of1ForFork2_#t~post1| 2) 4294967296) .cse2)) (or .cse0 .cse1 (< (mod c_thread1Thread1of1ForFork2_~i~0 4294967296) .cse2))))) is different from false Received shutdown request... [2024-05-30 22:55:45,740 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-30 22:55:45,772 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-30 22:55:45,786 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 22:55:46,415 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-30 22:55:46,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 22:55:46,609 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 234 known predicates. [2024-05-30 22:55:46,611 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 22:55:46,616 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2024-05-30 22:55:46,617 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/4) [2024-05-30 22:55:46,618 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-30 22:55:46,618 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-30 22:55:46,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.05 10:55:46 BasicIcfg [2024-05-30 22:55:46,620 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-30 22:55:46,620 INFO L158 Benchmark]: Toolchain (without parser) took 879143.97ms. Allocated memory was 319.8MB in the beginning and 571.5MB in the end (delta: 251.7MB). Free memory was 247.4MB in the beginning and 236.5MB in the end (delta: 10.9MB). Peak memory consumption was 264.1MB. Max. memory is 8.0GB. [2024-05-30 22:55:46,621 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 319.8MB. Free memory is still 288.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 22:55:46,621 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.78ms. Allocated memory is still 319.8MB. Free memory was 247.1MB in the beginning and 235.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-30 22:55:46,621 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.54ms. Allocated memory is still 319.8MB. Free memory was 235.6MB in the beginning and 233.7MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-30 22:55:46,621 INFO L158 Benchmark]: Boogie Preprocessor took 26.88ms. Allocated memory is still 319.8MB. Free memory was 233.7MB in the beginning and 232.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 22:55:46,621 INFO L158 Benchmark]: RCFGBuilder took 440.07ms. Allocated memory is still 319.8MB. Free memory was 232.4MB in the beginning and 284.5MB in the end (delta: -52.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2024-05-30 22:55:46,621 INFO L158 Benchmark]: TraceAbstraction took 878457.63ms. Allocated memory was 319.8MB in the beginning and 571.5MB in the end (delta: 251.7MB). Free memory was 283.5MB in the beginning and 236.5MB in the end (delta: 47.0MB). Peak memory consumption was 299.7MB. Max. memory is 8.0GB. [2024-05-30 22:55:46,622 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.11ms. Allocated memory is still 319.8MB. Free memory is still 288.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 177.78ms. Allocated memory is still 319.8MB. Free memory was 247.1MB in the beginning and 235.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.54ms. Allocated memory is still 319.8MB. Free memory was 235.6MB in the beginning and 233.7MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.88ms. Allocated memory is still 319.8MB. Free memory was 233.7MB in the beginning and 232.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 440.07ms. Allocated memory is still 319.8MB. Free memory was 232.4MB in the beginning and 284.5MB in the end (delta: -52.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 878457.63ms. Allocated memory was 319.8MB in the beginning and 571.5MB in the end (delta: 251.7MB). Free memory was 283.5MB in the beginning and 236.5MB in the end (delta: 47.0MB). Peak memory consumption was 299.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1246, independent: 1092, independent conditional: 1092, independent unconditional: 0, dependent: 154, dependent conditional: 154, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4822, independent: 4466, independent conditional: 4466, independent unconditional: 0, dependent: 356, dependent conditional: 356, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4466, independent: 4466, independent conditional: 4466, 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: 4466, independent: 4466, independent conditional: 4466, 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: 4466, independent: 4466, independent conditional: 0, independent unconditional: 4466, 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: 4466, independent: 4466, independent conditional: 0, independent unconditional: 4466, 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: 4466, independent: 4466, independent conditional: 0, independent unconditional: 4466, 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: 498, independent: 498, independent conditional: 0, independent unconditional: 498, 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: 498, independent: 498, independent conditional: 0, independent unconditional: 498, 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: 4466, independent: 3968, independent conditional: 0, independent unconditional: 3968, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 498, unknown conditional: 0, unknown unconditional: 498] , Statistics on independence cache: Total cache size (in pairs): 259, Positive cache size: 259, Positive conditional cache size: 0, Positive unconditional cache size: 259, 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: 154, Statistics for Abstraction: - StatisticsResult: Independence relation #2 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 1052, independent: 1000, independent conditional: 1000, independent unconditional: 0, dependent: 52, dependent conditional: 52, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4822, independent: 4466, independent conditional: 4466, independent unconditional: 0, dependent: 356, dependent conditional: 356, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4466, independent: 4466, independent conditional: 4466, 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: 4466, independent: 4466, independent conditional: 4466, 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: 4466, independent: 4466, independent conditional: 0, independent unconditional: 4466, 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: 4466, independent: 4466, independent conditional: 0, independent unconditional: 4466, 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: 4466, independent: 4466, independent conditional: 0, independent unconditional: 4466, 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: 498, independent: 498, independent conditional: 0, independent unconditional: 498, 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: 498, independent: 498, independent conditional: 0, independent unconditional: 498, 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: 4466, independent: 3968, independent conditional: 0, independent unconditional: 3968, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 498, unknown conditional: 0, unknown unconditional: 498] , Statistics on independence cache: Total cache size (in pairs): 259, Positive cache size: 259, Positive conditional cache size: 0, Positive unconditional cache size: 259, 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: 206, Statistics for Abstraction: - StatisticsResult: Independence relation #3 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 379, independent: 359, independent conditional: 359, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4822, independent: 4466, independent conditional: 4466, independent unconditional: 0, dependent: 356, dependent conditional: 356, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4466, independent: 4466, independent conditional: 4466, 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: 4466, independent: 4466, independent conditional: 4466, 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: 4466, independent: 4466, independent conditional: 0, independent unconditional: 4466, 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: 4466, independent: 4466, independent conditional: 0, independent unconditional: 4466, 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: 4466, independent: 4466, independent conditional: 0, independent unconditional: 4466, 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: 498, independent: 498, independent conditional: 0, independent unconditional: 498, 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: 498, independent: 498, independent conditional: 0, independent unconditional: 498, 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: 4466, independent: 3968, independent conditional: 0, independent unconditional: 3968, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 498, unknown conditional: 0, unknown unconditional: 498] , Statistics on independence cache: Total cache size (in pairs): 299, Positive cache size: 299, Positive conditional cache size: 0, Positive unconditional cache size: 299, 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: 226, Statistics for Abstraction: - StatisticsResult: Independence relation #4 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 710, independent: 666, independent conditional: 666, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4822, independent: 4466, independent conditional: 4466, independent unconditional: 0, dependent: 356, dependent conditional: 356, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4466, independent: 4466, independent conditional: 4466, 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: 4466, independent: 4466, independent conditional: 4466, 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: 4466, independent: 4466, independent conditional: 0, independent unconditional: 4466, 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: 4466, independent: 4466, independent conditional: 0, independent unconditional: 4466, 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: 4466, independent: 4466, independent conditional: 0, independent unconditional: 4466, 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: 498, independent: 498, independent conditional: 0, independent unconditional: 498, 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: 498, independent: 498, independent conditional: 0, independent unconditional: 498, 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: 4466, independent: 3968, independent conditional: 0, independent unconditional: 3968, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 498, unknown conditional: 0, unknown unconditional: 498] , Statistics on independence cache: Total cache size (in pairs): 444, Positive cache size: 444, Positive conditional cache size: 0, Positive unconditional cache size: 444, 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: 270, Statistics for Abstraction: - StatisticsResult: Independence relation #5 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 212, independent: 196, independent conditional: 196, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4822, independent: 4466, independent conditional: 4466, independent unconditional: 0, dependent: 356, dependent conditional: 356, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4466, independent: 4466, independent conditional: 4466, 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: 4466, independent: 4466, independent conditional: 4466, 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: 4466, independent: 4466, independent conditional: 0, independent unconditional: 4466, 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: 4466, independent: 4466, independent conditional: 0, independent unconditional: 4466, 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: 4466, independent: 4466, independent conditional: 0, independent unconditional: 4466, 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: 498, independent: 498, independent conditional: 0, independent unconditional: 498, 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: 498, independent: 498, independent conditional: 0, independent unconditional: 498, 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: 4466, independent: 3968, independent conditional: 0, independent unconditional: 3968, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 498, unknown conditional: 0, unknown unconditional: 498] , Statistics on independence cache: Total cache size (in pairs): 498, Positive cache size: 498, Positive conditional cache size: 0, Positive unconditional cache size: 498, 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: 286, Statistics for Abstraction: - StatisticsResult: Independence relation #6 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 292, independent: 272, independent conditional: 272, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4822, independent: 4466, independent conditional: 4466, independent unconditional: 0, dependent: 356, dependent conditional: 356, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4466, independent: 4466, independent conditional: 4466, 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: 4466, independent: 4466, independent conditional: 4466, 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: 4466, independent: 4466, independent conditional: 0, independent unconditional: 4466, 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: 4466, independent: 4466, independent conditional: 0, independent unconditional: 4466, 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: 4466, independent: 4466, independent conditional: 0, independent unconditional: 4466, 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: 498, independent: 498, independent conditional: 0, independent unconditional: 498, 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: 498, independent: 498, independent conditional: 0, independent unconditional: 498, 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: 4466, independent: 3968, independent conditional: 0, independent unconditional: 3968, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 498, unknown conditional: 0, unknown unconditional: 498] , Statistics on independence cache: Total cache size (in pairs): 498, Positive cache size: 498, Positive conditional cache size: 0, Positive unconditional cache size: 498, 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: 306, Statistics for Abstraction: - StatisticsResult: Independence relation #7 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 452, independent: 424, independent conditional: 424, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4822, independent: 4466, independent conditional: 4466, independent unconditional: 0, dependent: 356, dependent conditional: 356, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4466, independent: 4466, independent conditional: 4466, 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: 4466, independent: 4466, independent conditional: 4466, 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: 4466, independent: 4466, independent conditional: 0, independent unconditional: 4466, 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: 4466, independent: 4466, independent conditional: 0, independent unconditional: 4466, 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: 4466, independent: 4466, independent conditional: 0, independent unconditional: 4466, 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: 498, independent: 498, independent conditional: 0, independent unconditional: 498, 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: 498, independent: 498, independent conditional: 0, independent unconditional: 498, 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: 4466, independent: 3968, independent conditional: 0, independent unconditional: 3968, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 498, unknown conditional: 0, unknown unconditional: 498] , Statistics on independence cache: Total cache size (in pairs): 498, Positive cache size: 498, Positive conditional cache size: 0, Positive unconditional cache size: 498, 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: 334, Statistics for Abstraction: - StatisticsResult: Independence relation #8 benchmarks IndependenceRelationWithAbstraction.Independence Queries: [ total: 479, independent: 457, independent conditional: 457, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , IndependenceRelationWithAbstraction.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4822, independent: 4466, independent conditional: 4466, independent unconditional: 0, dependent: 356, dependent conditional: 356, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4466, independent: 4466, independent conditional: 4466, 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: 4466, independent: 4466, independent conditional: 4466, 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: 4466, independent: 4466, independent conditional: 0, independent unconditional: 4466, 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: 4466, independent: 4466, independent conditional: 0, independent unconditional: 4466, 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: 4466, independent: 4466, independent conditional: 0, independent unconditional: 4466, 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: 498, independent: 498, independent conditional: 0, independent unconditional: 498, 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: 498, independent: 498, independent conditional: 0, independent unconditional: 498, 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: 4466, independent: 3968, independent conditional: 0, independent unconditional: 3968, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 498, unknown conditional: 0, unknown unconditional: 498] , Statistics on independence cache: Total cache size (in pairs): 498, Positive cache size: 498, Positive conditional cache size: 0, Positive unconditional cache size: 498, 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: 356, Statistics for Abstraction: - StatisticsResult: Visitor Statistics States: 521, Transitions: 619, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 521, Transitions: 571, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 226, Transitions: 243, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 364, Transitions: 388, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 152, Transitions: 157, Traversal time: 1.2s - StatisticsResult: Visitor Statistics States: 172, Transitions: 177, Traversal time: 1.4s - StatisticsResult: Visitor Statistics States: 212, Transitions: 217, Traversal time: 39.4s - StatisticsResult: Visitor Statistics States: 154, Transitions: 153, Traversal time: 813.4s - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 234 known predicates. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 7 procedures, 136 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 878.3s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 856.0s, 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: 293, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 19.7s InterpolantComputationTime, 1281 NumberOfCodeBlocks, 1281 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1829 ConstructedInterpolants, 0 QuantifiedInterpolants, 14565 SizeOfPredicates, 134 NumberOfNonLiveVariables, 1254 ConjunctsInSsa, 206 ConjunctsInUnsatCore, 17 InterpolantComputations, 3 PerfectInterpolantSequences, 1/2094 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