/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/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-e23131f-m [2024-05-03 03:56:26,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-03 03:56:26,565 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-03 03:56:26,569 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-03 03:56:26,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-03 03:56:26,569 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-03 03:56:26,591 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-03 03:56:26,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-03 03:56:26,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-03 03:56:26,595 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-03 03:56:26,595 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-03 03:56:26,595 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-03 03:56:26,595 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-03 03:56:26,597 INFO L153 SettingsManager]: * Use SBE=true [2024-05-03 03:56:26,597 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-03 03:56:26,597 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-03 03:56:26,597 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-03 03:56:26,597 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-03 03:56:26,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-03 03:56:26,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-03 03:56:26,598 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-03 03:56:26,598 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-03 03:56:26,599 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-03 03:56:26,599 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-03 03:56:26,599 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-03 03:56:26,600 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-03 03:56:26,600 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-03 03:56:26,600 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-03 03:56:26,600 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-03 03:56:26,600 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-03 03:56:26,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 03:56:26,601 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-03 03:56:26,602 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-03 03:56:26,602 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-03 03:56:26,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-03 03:56:26,602 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-03 03:56:26,602 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-03 03:56:26,602 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-03 03:56:26,602 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-03 03:56:26,602 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-03 03:56:26,603 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-03 03:56:26,603 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 [2024-05-03 03:56:26,806 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-03 03:56:26,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-03 03:56:26,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-03 03:56:26,835 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-03 03:56:26,835 INFO L274 PluginConnector]: CDTParser initialized [2024-05-03 03:56:26,836 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2024-05-03 03:56:27,914 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-03 03:56:28,113 INFO L384 CDTParser]: Found 1 translation units. [2024-05-03 03:56:28,113 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2024-05-03 03:56:28,123 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e5a320d73/a84da8843239469f83b83ab7a3196cbc/FLAG8894bac96 [2024-05-03 03:56:28,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/e5a320d73/a84da8843239469f83b83ab7a3196cbc [2024-05-03 03:56:28,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-03 03:56:28,135 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-03 03:56:28,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-03 03:56:28,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-03 03:56:28,140 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-03 03:56:28,141 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 03:56:28" (1/1) ... [2024-05-03 03:56:28,141 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@633ecdeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 03:56:28, skipping insertion in model container [2024-05-03 03:56:28,141 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 03:56:28" (1/1) ... [2024-05-03 03:56:28,185 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-03 03:56:28,310 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i[1120,1133] [2024-05-03 03:56:28,415 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 03:56:28,425 INFO L202 MainTranslator]: Completed pre-run [2024-05-03 03:56:28,433 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i[1120,1133] [2024-05-03 03:56:28,505 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-03 03:56:28,555 INFO L206 MainTranslator]: Completed translation [2024-05-03 03:56:28,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 03:56:28 WrapperNode [2024-05-03 03:56:28,555 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-03 03:56:28,557 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-03 03:56:28,557 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-03 03:56:28,557 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-03 03:56:28,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 03:56:28" (1/1) ... [2024-05-03 03:56:28,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 03:56:28" (1/1) ... [2024-05-03 03:56:28,625 INFO L138 Inliner]: procedures = 166, calls = 49, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 164 [2024-05-03 03:56:28,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-03 03:56:28,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-03 03:56:28,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-03 03:56:28,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-03 03:56:28,632 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 03:56:28" (1/1) ... [2024-05-03 03:56:28,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 03:56:28" (1/1) ... [2024-05-03 03:56:28,637 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 03:56:28" (1/1) ... [2024-05-03 03:56:28,637 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 03:56:28" (1/1) ... [2024-05-03 03:56:28,650 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 03:56:28" (1/1) ... [2024-05-03 03:56:28,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 03:56:28" (1/1) ... [2024-05-03 03:56:28,652 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 03:56:28" (1/1) ... [2024-05-03 03:56:28,653 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 03:56:28" (1/1) ... [2024-05-03 03:56:28,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-03 03:56:28,656 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-03 03:56:28,656 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-03 03:56:28,656 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-03 03:56:28,657 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 03:56:28" (1/1) ... [2024-05-03 03:56:28,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-03 03:56:28,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 03:56:28,689 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-03 03:56:28,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-03 03:56:28,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-03 03:56:28,736 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-05-03 03:56:28,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-03 03:56:28,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-03 03:56:28,736 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-05-03 03:56:28,736 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-05-03 03:56:28,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-03 03:56:28,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-03 03:56:28,736 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-05-03 03:56:28,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-03 03:56:28,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-03 03:56:28,739 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-03 03:56:28,864 INFO L241 CfgBuilder]: Building ICFG [2024-05-03 03:56:28,866 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-03 03:56:29,136 INFO L282 CfgBuilder]: Performing block encoding [2024-05-03 03:56:29,161 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-03 03:56:29,161 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-03 03:56:29,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 03:56:29 BoogieIcfgContainer [2024-05-03 03:56:29,162 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-03 03:56:29,163 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-03 03:56:29,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-03 03:56:29,166 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-03 03:56:29,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 03:56:28" (1/3) ... [2024-05-03 03:56:29,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e050ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 03:56:29, skipping insertion in model container [2024-05-03 03:56:29,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 03:56:28" (2/3) ... [2024-05-03 03:56:29,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e050ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 03:56:29, skipping insertion in model container [2024-05-03 03:56:29,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 03:56:29" (3/3) ... [2024-05-03 03:56:29,168 INFO L112 eAbstractionObserver]: Analyzing ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2024-05-03 03:56:29,175 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-03 03:56:29,182 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-03 03:56:29,183 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-05-03 03:56:29,183 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-03 03:56:29,235 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-03 03:56:29,269 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 03:56:29,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 03:56:29,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 03:56:29,272 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-03 03:56:29,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-03 03:56:29,344 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 03:56:29,353 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ======== [2024-05-03 03:56:29,360 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=LoopsAndPotentialCycles, 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;@56cffc2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 03:56:29,360 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 03:56:29,368 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 03:56:29,390 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 41 states. [2024-05-03 03:56:29,390 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 03:56:29,395 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-05-03 03:56:29,403 INFO L445 BasicCegarLoop]: Path program histogram: [] [2024-05-03 03:56:29,405 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (1/7) [2024-05-03 03:56:29,422 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 03:56:29,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 03:56:29,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 03:56:29,455 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-03 03:56:29,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-05-03 03:56:29,460 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 03:56:29,461 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-03 03:56:29,461 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=LoopsAndPotentialCycles, 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;@56cffc2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 03:56:29,461 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 03:56:29,462 WARN L438 OrderReductionFacade]: DynamicStratifiedReduction did not find any initial state. Returning directly. [2024-05-03 03:56:29,462 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-03 03:56:29,463 INFO L445 BasicCegarLoop]: Path program histogram: [] [2024-05-03 03:56:29,463 INFO L308 ceAbstractionStarter]: Result for error location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (2/7) [2024-05-03 03:56:29,466 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 03:56:29,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 03:56:29,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 03:56:29,482 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-03 03:56:29,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-05-03 03:56:29,488 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 03:56:29,488 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funErr1ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-03 03:56:29,489 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=LoopsAndPotentialCycles, 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;@56cffc2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 03:56:29,489 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 03:56:29,489 WARN L438 OrderReductionFacade]: DynamicStratifiedReduction did not find any initial state. Returning directly. [2024-05-03 03:56:29,489 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-03 03:56:29,490 INFO L445 BasicCegarLoop]: Path program histogram: [] [2024-05-03 03:56:29,491 INFO L308 ceAbstractionStarter]: Result for error location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION was SAFE (3/7) [2024-05-03 03:56:29,493 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 03:56:29,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 03:56:29,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 03:56:29,499 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-03 03:56:29,505 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 03:56:29,506 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funErr2ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-03 03:56:29,506 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=LoopsAndPotentialCycles, 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;@56cffc2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 03:56:29,507 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 03:56:29,507 WARN L438 OrderReductionFacade]: DynamicStratifiedReduction did not find any initial state. Returning directly. [2024-05-03 03:56:29,507 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-03 03:56:29,508 INFO L445 BasicCegarLoop]: Path program histogram: [] [2024-05-03 03:56:29,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-05-03 03:56:29,508 INFO L308 ceAbstractionStarter]: Result for error location t_funErr2ASSERT_VIOLATIONERROR_FUNCTION was SAFE (4/7) [2024-05-03 03:56:29,511 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 03:56:29,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 03:56:29,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 03:56:29,527 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-03 03:56:29,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Waiting until timeout for monitored process [2024-05-03 03:56:29,537 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 03:56:29,538 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-03 03:56:29,538 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=LoopsAndPotentialCycles, 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;@56cffc2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 03:56:29,538 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 03:56:29,538 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 03:56:29,555 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 93 states. [2024-05-03 03:56:29,556 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 03:56:29,558 INFO L78 Accepts]: Start accepts. Automaton has currently 97 states, but on-demand construction may add more states Word has length 67 [2024-05-03 03:56:29,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 03:56:29,561 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 03:56:29,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 03:56:29,567 INFO L85 PathProgramCache]: Analyzing trace with hash -634920985, now seen corresponding path program 1 times [2024-05-03 03:56:29,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 03:56:29,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145463791] [2024-05-03 03:56:29,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 03:56:29,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 03:56:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 03:56:30,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 03:56:30,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 03:56:30,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145463791] [2024-05-03 03:56:30,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145463791] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 03:56:30,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 03:56:30,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-03 03:56:30,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708749315] [2024-05-03 03:56:30,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 03:56:30,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-03 03:56:30,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 03:56:30,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-03 03:56:30,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-05-03 03:56:30,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:30,155 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 03:56:30,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 03:56:30,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:30,156 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 03:56:30,776 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 361 states. [2024-05-03 03:56:30,776 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 03:56:30,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-03 03:56:30,778 INFO L78 Accepts]: Start accepts. Automaton has currently 417 states, but on-demand construction may add more states Word has length 98 [2024-05-03 03:56:30,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 03:56:30,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-03 03:56:30,779 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 03:56:30,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 03:56:30,779 INFO L85 PathProgramCache]: Analyzing trace with hash -315391276, now seen corresponding path program 1 times [2024-05-03 03:56:30,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 03:56:30,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952702974] [2024-05-03 03:56:30,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 03:56:30,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 03:56:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 03:56:30,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 03:56:30,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 03:56:30,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952702974] [2024-05-03 03:56:30,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952702974] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 03:56:30,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 03:56:30,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-03 03:56:30,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945922153] [2024-05-03 03:56:30,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 03:56:30,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-03 03:56:30,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 03:56:30,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-03 03:56:30,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-03 03:56:30,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:30,975 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 03:56:30,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 03:56:30,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-03 03:56:30,976 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:30,977 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 03:56:31,093 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 173 states. [2024-05-03 03:56:31,094 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 03:56:31,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-03 03:56:31,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 03:56:31,099 INFO L78 Accepts]: Start accepts. Automaton has currently 207 states, but on-demand construction may add more states Word has length 100 [2024-05-03 03:56:31,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 03:56:31,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-03 03:56:31,102 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 03:56:31,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 03:56:31,102 INFO L85 PathProgramCache]: Analyzing trace with hash 514391150, now seen corresponding path program 1 times [2024-05-03 03:56:31,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 03:56:31,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299847119] [2024-05-03 03:56:31,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 03:56:31,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 03:56:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 03:56:31,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 03:56:31,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 03:56:31,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299847119] [2024-05-03 03:56:31,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299847119] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 03:56:31,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 03:56:31,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-05-03 03:56:31,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496956648] [2024-05-03 03:56:31,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 03:56:31,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-03 03:56:31,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 03:56:31,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-03 03:56:31,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-05-03 03:56:31,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:31,377 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 03:56:31,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 03:56:31,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-03 03:56:31,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 03:56:31,377 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:31,377 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 03:56:31,757 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 200 states. [2024-05-03 03:56:31,757 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 03:56:31,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-03 03:56:31,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 03:56:31,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-05-03 03:56:31,758 INFO L78 Accepts]: Start accepts. Automaton has currently 237 states, but on-demand construction may add more states Word has length 105 [2024-05-03 03:56:31,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 03:56:31,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-03 03:56:31,759 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 03:56:31,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 03:56:31,760 INFO L85 PathProgramCache]: Analyzing trace with hash -694546480, now seen corresponding path program 1 times [2024-05-03 03:56:31,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 03:56:31,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637748794] [2024-05-03 03:56:31,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 03:56:31,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 03:56:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 03:56:31,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 03:56:31,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 03:56:31,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637748794] [2024-05-03 03:56:31,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637748794] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 03:56:31,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 03:56:31,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-03 03:56:31,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674282600] [2024-05-03 03:56:31,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 03:56:31,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-03 03:56:31,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 03:56:31,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-03 03:56:31,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-05-03 03:56:31,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:31,897 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 03:56:31,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 03:56:31,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-05-03 03:56:31,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 03:56:31,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-05-03 03:56:31,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:31,897 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 03:56:32,544 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1269 states. [2024-05-03 03:56:32,545 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 03:56:32,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-03 03:56:32,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 03:56:32,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-05-03 03:56:32,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-03 03:56:32,545 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-03 03:56:32,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-03 03:56:32,550 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-05-03 03:56:32,550 INFO L308 ceAbstractionStarter]: Result for error location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (5/7) [2024-05-03 03:56:32,555 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 03:56:32,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 03:56:32,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 03:56:32,583 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-03 03:56:32,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2024-05-03 03:56:32,601 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 03:56:32,602 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funErr1ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-03 03:56:32,602 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=LoopsAndPotentialCycles, 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;@56cffc2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 03:56:32,602 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 03:56:32,603 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 03:56:32,605 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 113 states. [2024-05-03 03:56:32,605 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 03:56:32,605 INFO L78 Accepts]: Start accepts. Automaton has currently 118 states, but on-demand construction may add more states Word has length 77 [2024-05-03 03:56:32,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 03:56:32,606 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 03:56:32,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 03:56:32,606 INFO L85 PathProgramCache]: Analyzing trace with hash -497977812, now seen corresponding path program 1 times [2024-05-03 03:56:32,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 03:56:32,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557409001] [2024-05-03 03:56:32,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 03:56:32,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 03:56:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 03:56:32,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 03:56:32,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 03:56:32,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557409001] [2024-05-03 03:56:32,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557409001] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 03:56:32,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 03:56:32,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-03 03:56:32,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137604180] [2024-05-03 03:56:32,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 03:56:32,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-03 03:56:32,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 03:56:32,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-03 03:56:32,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-03 03:56:32,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:32,634 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 03:56:32,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.5) internal successors, (77), 2 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 03:56:32,634 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:32,634 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 03:56:32,676 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 168 states. [2024-05-03 03:56:32,677 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 03:56:32,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:32,677 INFO L78 Accepts]: Start accepts. Automaton has currently 224 states, but on-demand construction may add more states Word has length 75 [2024-05-03 03:56:32,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 03:56:32,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-03 03:56:32,678 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 03:56:32,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 03:56:32,681 INFO L85 PathProgramCache]: Analyzing trace with hash -167927923, now seen corresponding path program 1 times [2024-05-03 03:56:32,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 03:56:32,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450902477] [2024-05-03 03:56:32,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 03:56:32,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 03:56:32,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 03:56:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 03:56:32,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 03:56:32,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450902477] [2024-05-03 03:56:32,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450902477] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 03:56:32,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 03:56:32,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-03 03:56:32,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958612201] [2024-05-03 03:56:32,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 03:56:32,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-03 03:56:32,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 03:56:32,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-03 03:56:32,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-05-03 03:56:32,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:32,855 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 03:56:32,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 8 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-03 03:56:32,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:32,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:32,856 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 03:56:33,304 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 866 states. [2024-05-03 03:56:33,304 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 03:56:33,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:33,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-03 03:56:33,305 INFO L78 Accepts]: Start accepts. Automaton has currently 999 states, but on-demand construction may add more states Word has length 106 [2024-05-03 03:56:33,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 03:56:33,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-03 03:56:33,306 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 03:56:33,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 03:56:33,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1604453754, now seen corresponding path program 1 times [2024-05-03 03:56:33,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 03:56:33,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428162541] [2024-05-03 03:56:33,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 03:56:33,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 03:56:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 03:56:33,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 03:56:33,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 03:56:33,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428162541] [2024-05-03 03:56:33,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428162541] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 03:56:33,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 03:56:33,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-03 03:56:33,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530691156] [2024-05-03 03:56:33,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 03:56:33,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-03 03:56:33,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 03:56:33,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-03 03:56:33,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-03 03:56:33,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:33,430 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 03:56:33,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 03:56:33,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:33,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-03 03:56:33,430 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:33,430 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 03:56:33,511 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 242 states. [2024-05-03 03:56:33,511 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 03:56:33,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:33,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-03 03:56:33,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 03:56:33,512 INFO L78 Accepts]: Start accepts. Automaton has currently 281 states, but on-demand construction may add more states Word has length 108 [2024-05-03 03:56:33,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 03:56:33,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-03 03:56:33,513 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 03:56:33,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 03:56:33,513 INFO L85 PathProgramCache]: Analyzing trace with hash -709278444, now seen corresponding path program 1 times [2024-05-03 03:56:33,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 03:56:33,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416560593] [2024-05-03 03:56:33,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 03:56:33,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 03:56:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 03:56:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 03:56:33,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 03:56:33,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416560593] [2024-05-03 03:56:33,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416560593] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 03:56:33,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 03:56:33,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-03 03:56:33,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946365644] [2024-05-03 03:56:33,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 03:56:33,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-03 03:56:33,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 03:56:33,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-03 03:56:33,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-03 03:56:33,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:33,695 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 03:56:33,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 03:56:33,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:33,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-03 03:56:33,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 03:56:33,695 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:33,695 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 03:56:33,793 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 288 states. [2024-05-03 03:56:33,793 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 03:56:33,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:33,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-03 03:56:33,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 03:56:33,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 03:56:33,794 INFO L78 Accepts]: Start accepts. Automaton has currently 345 states, but on-demand construction may add more states Word has length 115 [2024-05-03 03:56:33,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 03:56:33,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-03 03:56:33,795 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 03:56:33,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 03:56:33,795 INFO L85 PathProgramCache]: Analyzing trace with hash -2086556708, now seen corresponding path program 1 times [2024-05-03 03:56:33,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 03:56:33,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563927633] [2024-05-03 03:56:33,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 03:56:33,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 03:56:33,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 03:56:33,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 03:56:33,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 03:56:33,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563927633] [2024-05-03 03:56:33,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563927633] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 03:56:33,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 03:56:33,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-03 03:56:33,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231220868] [2024-05-03 03:56:33,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 03:56:33,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-03 03:56:33,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 03:56:33,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-03 03:56:33,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-05-03 03:56:33,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:33,937 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 03:56:33,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 03:56:33,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:33,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2024-05-03 03:56:33,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 03:56:33,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 03:56:33,939 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:33,939 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 03:56:34,612 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1560 states. [2024-05-03 03:56:34,613 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 03:56:34,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:34,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-05-03 03:56:34,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 03:56:34,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 03:56:34,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-05-03 03:56:34,615 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-03 03:56:34,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-03 03:56:34,618 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-05-03 03:56:34,620 INFO L308 ceAbstractionStarter]: Result for error location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION was SAFE (6/7) [2024-05-03 03:56:34,621 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 03:56:34,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-03 03:56:34,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-03 03:56:34,624 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-03 03:56:34,645 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-03 03:56:34,645 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funErr2ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-03 03:56:34,646 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=LoopsAndPotentialCycles, 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;@56cffc2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-03 03:56:34,646 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-03 03:56:34,646 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 03:56:34,650 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 187 states. [2024-05-03 03:56:34,650 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 03:56:34,650 INFO L78 Accepts]: Start accepts. Automaton has currently 193 states, but on-demand construction may add more states Word has length 114 [2024-05-03 03:56:34,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 03:56:34,650 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 03:56:34,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 03:56:34,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1705151698, now seen corresponding path program 1 times [2024-05-03 03:56:34,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 03:56:34,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484517785] [2024-05-03 03:56:34,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 03:56:34,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 03:56:34,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2024-05-03 03:56:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 03:56:34,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 03:56:34,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 03:56:34,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484517785] [2024-05-03 03:56:34,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484517785] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 03:56:34,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 03:56:34,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-03 03:56:34,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831883428] [2024-05-03 03:56:34,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 03:56:34,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-03 03:56:34,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 03:56:34,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-03 03:56:34,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-03 03:56:34,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:34,675 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 03:56:34,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 57.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 03:56:34,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:34,675 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 03:56:34,760 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 411 states. [2024-05-03 03:56:34,760 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 03:56:34,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:34,760 INFO L78 Accepts]: Start accepts. Automaton has currently 632 states, but on-demand construction may add more states Word has length 108 [2024-05-03 03:56:34,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 03:56:34,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-03 03:56:34,761 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 03:56:34,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 03:56:34,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1536567184, now seen corresponding path program 1 times [2024-05-03 03:56:34,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 03:56:34,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593202159] [2024-05-03 03:56:34,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 03:56:34,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 03:56:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 03:56:34,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 03:56:34,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 03:56:34,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593202159] [2024-05-03 03:56:34,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593202159] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 03:56:34,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 03:56:34,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-05-03 03:56:34,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829885434] [2024-05-03 03:56:34,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 03:56:34,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-03 03:56:34,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 03:56:34,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-03 03:56:34,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-05-03 03:56:34,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:34,987 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 03:56:34,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 03:56:34,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:34,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:34,988 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 03:56:35,559 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 651 states. [2024-05-03 03:56:35,559 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 03:56:35,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:35,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-03 03:56:35,560 INFO L78 Accepts]: Start accepts. Automaton has currently 927 states, but on-demand construction may add more states Word has length 115 [2024-05-03 03:56:35,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 03:56:35,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-03 03:56:35,561 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 03:56:35,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 03:56:35,562 INFO L85 PathProgramCache]: Analyzing trace with hash -2112884418, now seen corresponding path program 1 times [2024-05-03 03:56:35,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 03:56:35,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843945179] [2024-05-03 03:56:35,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 03:56:35,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 03:56:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 03:56:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 03:56:35,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 03:56:35,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843945179] [2024-05-03 03:56:35,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843945179] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 03:56:35,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 03:56:35,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-03 03:56:35,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073129216] [2024-05-03 03:56:35,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 03:56:35,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-03 03:56:35,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 03:56:35,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-03 03:56:35,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-05-03 03:56:35,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:35,674 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 03:56:35,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 03:56:35,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:35,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-05-03 03:56:35,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:35,675 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 03:56:36,053 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 889 states. [2024-05-03 03:56:36,053 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 03:56:36,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:36,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-03 03:56:36,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-05-03 03:56:36,054 INFO L78 Accepts]: Start accepts. Automaton has currently 1213 states, but on-demand construction may add more states Word has length 152 [2024-05-03 03:56:36,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 03:56:36,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-03 03:56:36,055 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 03:56:36,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 03:56:36,057 INFO L85 PathProgramCache]: Analyzing trace with hash 813358955, now seen corresponding path program 1 times [2024-05-03 03:56:36,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 03:56:36,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891504527] [2024-05-03 03:56:36,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 03:56:36,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 03:56:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 03:56:36,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 03:56:36,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 03:56:36,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891504527] [2024-05-03 03:56:36,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891504527] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 03:56:36,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 03:56:36,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-03 03:56:36,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026303393] [2024-05-03 03:56:36,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 03:56:36,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-03 03:56:36,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 03:56:36,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-03 03:56:36,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-05-03 03:56:36,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:36,212 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 03:56:36,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.0) internal successors, (152), 8 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 03:56:36,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:36,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-05-03 03:56:36,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-05-03 03:56:36,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:36,213 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 03:56:37,975 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 3828 states. [2024-05-03 03:56:37,975 INFO L212 cStratifiedReduction]: Copied states 10 times. [2024-05-03 03:56:37,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:37,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-05-03 03:56:37,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-03 03:56:37,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-03 03:56:37,976 INFO L78 Accepts]: Start accepts. Automaton has currently 4191 states, but on-demand construction may add more states Word has length 116 [2024-05-03 03:56:37,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 03:56:37,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-05-03 03:56:37,977 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 03:56:37,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 03:56:37,977 INFO L85 PathProgramCache]: Analyzing trace with hash -69166213, now seen corresponding path program 1 times [2024-05-03 03:56:37,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 03:56:37,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637454983] [2024-05-03 03:56:37,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 03:56:37,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 03:56:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 03:56:38,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 03:56:38,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 03:56:38,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637454983] [2024-05-03 03:56:38,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637454983] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 03:56:38,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 03:56:38,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-05-03 03:56:38,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834376165] [2024-05-03 03:56:38,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 03:56:38,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-05-03 03:56:38,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 03:56:38,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-05-03 03:56:38,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-05-03 03:56:38,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:38,141 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 03:56:38,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 11 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 03:56:38,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:38,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-05-03 03:56:38,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-03 03:56:38,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-03 03:56:38,141 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:38,141 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 03:56:39,797 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 4059 states. [2024-05-03 03:56:39,797 INFO L212 cStratifiedReduction]: Copied states 10 times. [2024-05-03 03:56:39,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:39,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-05-03 03:56:39,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-03 03:56:39,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-03 03:56:39,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-03 03:56:39,798 INFO L78 Accepts]: Start accepts. Automaton has currently 4469 states, but on-demand construction may add more states Word has length 152 [2024-05-03 03:56:39,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 03:56:39,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-05-03 03:56:39,799 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 03:56:39,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 03:56:39,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1405363029, now seen corresponding path program 2 times [2024-05-03 03:56:39,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 03:56:39,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305381103] [2024-05-03 03:56:39,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 03:56:39,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 03:56:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 03:56:39,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 03:56:39,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 03:56:39,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305381103] [2024-05-03 03:56:39,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305381103] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 03:56:39,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 03:56:39,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-03 03:56:39,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695557901] [2024-05-03 03:56:39,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 03:56:39,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-03 03:56:39,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 03:56:39,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-03 03:56:39,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-03 03:56:39,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:39,969 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 03:56:39,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 03:56:39,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:39,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-05-03 03:56:39,969 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-03 03:56:39,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-03 03:56:39,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-03 03:56:39,970 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:39,970 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 03:56:40,108 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 834 states. [2024-05-03 03:56:40,109 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 03:56:40,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:40,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-05-03 03:56:40,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-03 03:56:40,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-03 03:56:40,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-03 03:56:40,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 03:56:40,110 INFO L78 Accepts]: Start accepts. Automaton has currently 966 states, but on-demand construction may add more states Word has length 152 [2024-05-03 03:56:40,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 03:56:40,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-05-03 03:56:40,111 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 03:56:40,111 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 03:56:40,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1753071083, now seen corresponding path program 3 times [2024-05-03 03:56:40,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 03:56:40,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113163317] [2024-05-03 03:56:40,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 03:56:40,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 03:56:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 03:56:40,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 03:56:40,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 03:56:40,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113163317] [2024-05-03 03:56:40,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113163317] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 03:56:40,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 03:56:40,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-03 03:56:40,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597651429] [2024-05-03 03:56:40,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 03:56:40,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-03 03:56:40,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 03:56:40,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-03 03:56:40,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-05-03 03:56:40,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:40,378 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 03:56:40,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 03:56:40,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:40,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-05-03 03:56:40,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-03 03:56:40,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-03 03:56:40,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-03 03:56:40,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 03:56:40,378 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:40,378 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 03:56:40,511 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 677 states. [2024-05-03 03:56:40,512 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 03:56:40,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:40,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-05-03 03:56:40,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-03 03:56:40,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-03 03:56:40,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-03 03:56:40,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 03:56:40,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 03:56:40,513 INFO L78 Accepts]: Start accepts. Automaton has currently 798 states, but on-demand construction may add more states Word has length 152 [2024-05-03 03:56:40,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-03 03:56:40,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-05-03 03:56:40,514 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-03 03:56:40,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-03 03:56:40,515 INFO L85 PathProgramCache]: Analyzing trace with hash -752099157, now seen corresponding path program 4 times [2024-05-03 03:56:40,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-03 03:56:40,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101046672] [2024-05-03 03:56:40,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-03 03:56:40,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-03 03:56:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-03 03:56:40,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-03 03:56:40,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-03 03:56:40,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101046672] [2024-05-03 03:56:40,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101046672] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-03 03:56:40,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-03 03:56:40,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-05-03 03:56:40,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225739637] [2024-05-03 03:56:40,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-03 03:56:40,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-05-03 03:56:40,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-03 03:56:40,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-05-03 03:56:40,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-05-03 03:56:40,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:40,815 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-03 03:56:40,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.0) internal successors, (152), 8 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-03 03:56:40,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:40,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2024-05-03 03:56:40,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-03 03:56:40,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-03 03:56:40,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-03 03:56:40,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 03:56:40,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-03 03:56:40,815 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:40,815 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-03 03:56:41,322 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2014 states. [2024-05-03 03:56:41,322 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-03 03:56:41,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-03 03:56:41,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-05-03 03:56:41,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-03 03:56:41,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-03 03:56:41,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-03 03:56:41,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 03:56:41,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-03 03:56:41,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-03 03:56:41,323 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-03 03:56:41,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-05-03 03:56:41,341 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2024-05-03 03:56:41,341 INFO L308 ceAbstractionStarter]: Result for error location t_funErr2ASSERT_VIOLATIONERROR_FUNCTION was SAFE (7/7) [2024-05-03 03:56:41,342 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-03 03:56:41,342 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-03 03:56:41,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.05 03:56:41 BasicIcfg [2024-05-03 03:56:41,346 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-03 03:56:41,346 INFO L158 Benchmark]: Toolchain (without parser) took 13210.92ms. Allocated memory was 151.0MB in the beginning and 1.1GB in the end (delta: 908.1MB). Free memory was 85.3MB in the beginning and 801.6MB in the end (delta: -716.3MB). Peak memory consumption was 395.4MB. Max. memory is 8.0GB. [2024-05-03 03:56:41,346 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 151.0MB. Free memory is still 92.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-03 03:56:41,347 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.97ms. Allocated memory is still 151.0MB. Free memory was 85.2MB in the beginning and 121.0MB in the end (delta: -35.9MB). Peak memory consumption was 22.3MB. Max. memory is 8.0GB. [2024-05-03 03:56:41,347 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.46ms. Allocated memory is still 151.0MB. Free memory was 121.0MB in the beginning and 118.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-03 03:56:41,347 INFO L158 Benchmark]: Boogie Preprocessor took 29.79ms. Allocated memory is still 151.0MB. Free memory was 118.5MB in the beginning and 116.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-03 03:56:41,347 INFO L158 Benchmark]: RCFGBuilder took 505.86ms. Allocated memory is still 151.0MB. Free memory was 116.8MB in the beginning and 94.4MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2024-05-03 03:56:41,347 INFO L158 Benchmark]: TraceAbstraction took 12182.78ms. Allocated memory was 151.0MB in the beginning and 1.1GB in the end (delta: 908.1MB). Free memory was 93.3MB in the beginning and 801.6MB in the end (delta: -708.3MB). Peak memory consumption was 403.6MB. Max. memory is 8.0GB. [2024-05-03 03:56:41,348 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 151.0MB. Free memory is still 92.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 418.97ms. Allocated memory is still 151.0MB. Free memory was 85.2MB in the beginning and 121.0MB in the end (delta: -35.9MB). Peak memory consumption was 22.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.46ms. Allocated memory is still 151.0MB. Free memory was 121.0MB in the beginning and 118.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.79ms. Allocated memory is still 151.0MB. Free memory was 118.5MB in the beginning and 116.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 505.86ms. Allocated memory is still 151.0MB. Free memory was 116.8MB in the beginning and 94.4MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 12182.78ms. Allocated memory was 151.0MB in the beginning and 1.1GB in the end (delta: 908.1MB). Free memory was 93.3MB in the beginning and 801.6MB in the end (delta: -708.3MB). Peak memory consumption was 403.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.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] , ThreadSeparatingIndependenceRelation.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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 0 - StatisticsResult: Reduction benchmarks 21.6ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 41, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Visitor Statistics States: 42, Transitions: 41, Traversal time: 0.0s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 0, Times there's more than one choice: 0, Avg number of choices: NaN - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.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] , ThreadSeparatingIndependenceRelation.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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 0 - StatisticsResult: Visitor Statistics States: 0, Transitions: 0, Traversal time: 14214129.5s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 0, Times there's more than one choice: 0, Avg number of choices: NaN - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.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] , ThreadSeparatingIndependenceRelation.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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 0 - StatisticsResult: Visitor Statistics States: 0, Transitions: 0, Traversal time: 14214129.5s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 0, Times there's more than one choice: 0, Avg number of choices: NaN - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.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] , ThreadSeparatingIndependenceRelation.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: DisjunctiveConditionalIndependenceRelation.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] , DisjunctiveConditionalIndependenceRelation.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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.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.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: 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] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 0 - StatisticsResult: Visitor Statistics States: 0, Transitions: 0, Traversal time: 14214129.5s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 0, Times there's more than one choice: 0, Avg number of choices: NaN - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1570, independent: 1510, independent conditional: 1510, independent unconditional: 0, dependent: 60, dependent conditional: 60, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1522, independent: 1510, independent conditional: 1510, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1522, independent: 1510, independent conditional: 1510, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1563, independent: 1510, independent conditional: 0, independent unconditional: 1510, dependent: 53, dependent conditional: 41, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1563, independent: 1510, independent conditional: 0, independent unconditional: 1510, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1563, independent: 1510, independent conditional: 0, independent unconditional: 1510, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1522, independent: 1510, independent conditional: 0, independent unconditional: 1510, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1522, independent: 1497, independent conditional: 0, independent unconditional: 1497, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 25, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 25, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1563, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 1522, unknown conditional: 0, unknown unconditional: 1522] , Statistics on independence cache: Total cache size (in pairs): 1522, Positive cache size: 1510, Positive conditional cache size: 0, Positive unconditional cache size: 1510, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 41, Maximal queried relation: 4, Independence queries for same thread: 48 - StatisticsResult: Reduction benchmarks 16.6ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 93, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 620.2ms Time before loop, 0.0ms Time in loop, 0.6s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 361, Duplicate States: 0, Protected Variables: 6 - StatisticsResult: Reduction benchmarks 116.4ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 173, Duplicate States: 0, Protected Variables: 10 - StatisticsResult: Reduction benchmarks 379.7ms Time before loop, 0.0ms Time in loop, 0.4s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 200, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 646.6ms Time before loop, 0.0ms Time in loop, 0.6s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 1269, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Visitor Statistics States: 68, Transitions: 67, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 325, Transitions: 335, Traversal time: 0.6s - StatisticsResult: Visitor Statistics States: 138, Transitions: 147, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 157, Transitions: 174, Traversal time: 0.4s - StatisticsResult: Visitor Statistics States: 1218, Transitions: 1274, Traversal time: 0.6s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 91, Times there's more than one choice: 38, Avg number of choices: 2.1868131868131866 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2525, independent: 2432, independent conditional: 2432, independent unconditional: 0, dependent: 93, dependent conditional: 93, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2447, independent: 2432, independent conditional: 2432, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2447, independent: 2432, independent conditional: 2432, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2514, independent: 2432, independent conditional: 0, independent unconditional: 2432, dependent: 82, dependent conditional: 67, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2514, independent: 2432, independent conditional: 0, independent unconditional: 2432, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2514, independent: 2432, independent conditional: 0, independent unconditional: 2432, dependent: 82, dependent conditional: 0, dependent unconditional: 82, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2447, independent: 2432, independent conditional: 0, independent unconditional: 2432, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2447, independent: 2415, independent conditional: 0, independent unconditional: 2415, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 32, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 32, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 32, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 59, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2514, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 2447, unknown conditional: 0, unknown unconditional: 2447] , Statistics on independence cache: Total cache size (in pairs): 2447, Positive cache size: 2432, Positive conditional cache size: 0, Positive unconditional cache size: 2432, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 67, Maximal queried relation: 5, Independence queries for same thread: 78 - StatisticsResult: Reduction benchmarks 2.3ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 113, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 42.1ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 168, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 448.3ms Time before loop, 0.0ms Time in loop, 0.4s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 866, Duplicate States: 0, Protected Variables: 6 - StatisticsResult: Reduction benchmarks 80.3ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 242, Duplicate States: 0, Protected Variables: 10 - StatisticsResult: Reduction benchmarks 97.2ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 288, Duplicate States: 0, Protected Variables: 11 - StatisticsResult: Reduction benchmarks 672.8ms Time before loop, 0.0ms Time in loop, 0.7s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 1560, Duplicate States: 0, Protected Variables: 12 - StatisticsResult: Visitor Statistics States: 78, Transitions: 77, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 132, Transitions: 134, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 804, Transitions: 832, Traversal time: 0.4s - StatisticsResult: Visitor Statistics States: 188, Transitions: 208, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 221, Transitions: 254, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 1491, Transitions: 1565, Traversal time: 0.7s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 4, RedundantProofs: 1, ProvenStates: 157, Times there's more than one choice: 69, Avg number of choices: 2.178343949044586 - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 11844, independent: 11398, independent conditional: 11398, independent unconditional: 0, dependent: 446, dependent conditional: 446, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11428, independent: 11398, independent conditional: 11398, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11428, independent: 11398, independent conditional: 11398, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11602, independent: 11398, independent conditional: 0, independent unconditional: 11398, dependent: 204, dependent conditional: 174, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11602, independent: 11398, independent conditional: 0, independent unconditional: 11398, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11602, independent: 11398, independent conditional: 0, independent unconditional: 11398, dependent: 204, dependent conditional: 0, dependent unconditional: 204, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11428, independent: 11398, independent conditional: 0, independent unconditional: 11398, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11428, independent: 11382, independent conditional: 0, independent unconditional: 11382, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 46, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 46, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 55, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 11602, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 174, dependent conditional: 0, dependent unconditional: 174, unknown: 11428, unknown conditional: 0, unknown unconditional: 11428] , Statistics on independence cache: Total cache size (in pairs): 11428, Positive cache size: 11398, Positive conditional cache size: 0, Positive unconditional cache size: 11398, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 174, Maximal queried relation: 8, Independence queries for same thread: 416 - StatisticsResult: Reduction benchmarks 3.7ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 187, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 84.5ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 411, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 570.8ms Time before loop, 0.0ms Time in loop, 0.6s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 651, Duplicate States: 0, Protected Variables: 12 - StatisticsResult: Reduction benchmarks 377.9ms Time before loop, 0.0ms Time in loop, 0.4s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 889, Duplicate States: 0, Protected Variables: 12 - StatisticsResult: Reduction benchmarks 1761.8ms Time before loop, 0.0ms Time in loop, 1.8s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 3828, Duplicate States: 10, Protected Variables: 12 - StatisticsResult: Reduction benchmarks 1655.1ms Time before loop, 0.0ms Time in loop, 1.7s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 4059, Duplicate States: 10, Protected Variables: 12 - StatisticsResult: Reduction benchmarks 137.8ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 834, Duplicate States: 0, Protected Variables: 16 - StatisticsResult: Reduction benchmarks 132.8ms Time before loop, 0.0ms Time in loop, 0.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 677, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 506.3ms Time before loop, 0.0ms Time in loop, 0.5s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 2014, Duplicate States: 0, Protected Variables: 19 - StatisticsResult: Visitor Statistics States: 115, Transitions: 114, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 333, Transitions: 344, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 564, Transitions: 584, Traversal time: 0.6s - StatisticsResult: Visitor Statistics States: 799, Transitions: 830, Traversal time: 0.4s - StatisticsResult: Visitor Statistics States: 3649, Transitions: 3794, Traversal time: 1.8s - StatisticsResult: Visitor Statistics States: 3879, Transitions: 4035, Traversal time: 1.7s - StatisticsResult: Visitor Statistics States: 647, Transitions: 768, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 533, Transitions: 610, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 1846, Transitions: 2018, Traversal time: 0.5s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 12, RedundantProofs: 3, ProvenStates: 726, Times there's more than one choice: 410, Avg number of choices: 3.12534435261708 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances CFG has 3 procedures, 269 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t_funErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 3 procedures, 269 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t_funErr0ASSERT_VIOLATIONERROR_FUNCTION with 2 thread instances CFG has 3 procedures, 269 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.8s, 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: 51, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 370 NumberOfCodeBlocks, 370 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 366 ConstructedInterpolants, 0 QuantifiedInterpolants, 1132 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data for error location: t_funErr1ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 3 procedures, 269 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t_funErr1ASSERT_VIOLATIONERROR_FUNCTION with 2 thread instances CFG has 3 procedures, 269 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.4s, 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: 43, 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.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 481 NumberOfCodeBlocks, 481 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 476 ConstructedInterpolants, 0 QuantifiedInterpolants, 1712 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data for error location: t_funErr2ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 3 procedures, 269 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.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: 0, 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: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for error location: t_funErr2ASSERT_VIOLATIONERROR_FUNCTION with 2 thread instances CFG has 3 procedures, 269 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 5.2s, 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: 111, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1061 NumberOfCodeBlocks, 1061 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1053 ConstructedInterpolants, 0 QuantifiedInterpolants, 4158 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-05-03 03:56:41,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Ended with exit code 0 [2024-05-03 03:56:41,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Forceful destruction successful, exit code 0 [2024-05-03 03:56:41,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Forceful destruction successful, exit code 0 [2024-05-03 03:56:41,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Forceful destruction successful, exit code 0 [2024-05-03 03:56:42,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Ended with exit code 0 [2024-05-03 03:56:42,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2024-05-03 03:56:42,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-03 03:56:42,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...