/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --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/ldv-races/race-3_2-container_of-global.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-57af04c-m [2024-01-25 23:04:40,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-25 23:04:40,442 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-01-25 23:04:40,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-25 23:04:40,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-25 23:04:40,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-01-25 23:04:40,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-25 23:04:40,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-25 23:04:40,478 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-25 23:04:40,481 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-25 23:04:40,481 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-25 23:04:40,481 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-25 23:04:40,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-25 23:04:40,482 INFO L153 SettingsManager]: * Use SBE=true [2024-01-25 23:04:40,482 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-25 23:04:40,482 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-25 23:04:40,482 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-25 23:04:40,482 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-25 23:04:40,483 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-25 23:04:40,483 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-25 23:04:40,483 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-25 23:04:40,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-25 23:04:40,484 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-25 23:04:40,485 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-25 23:04:40,485 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-25 23:04:40,485 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-25 23:04:40,485 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-25 23:04:40,485 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-25 23:04:40,486 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-01-25 23:04:40,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-25 23:04:40,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-25 23:04:40,487 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-25 23:04:40,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-25 23:04:40,487 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-01-25 23:04:40,487 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-01-25 23:04:40,487 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-25 23:04:40,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-25 23:04:40,487 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-25 23:04:40,487 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-01-25 23:04:40,488 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-25 23:04:40,488 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-01-25 23:04:40,488 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-01-25 23:04:40,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-25 23:04:40,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-25 23:04:40,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-25 23:04:40,678 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-25 23:04:40,678 INFO L274 PluginConnector]: CDTParser initialized [2024-01-25 23:04:40,679 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2024-01-25 23:04:41,689 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-25 23:04:41,897 INFO L384 CDTParser]: Found 1 translation units. [2024-01-25 23:04:41,897 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i [2024-01-25 23:04:41,924 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/28a80dab3/7168edfab70d490f92d16d0f39f1bc41/FLAGdfffd747b [2024-01-25 23:04:41,936 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/28a80dab3/7168edfab70d490f92d16d0f39f1bc41 [2024-01-25 23:04:41,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-25 23:04:41,939 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-01-25 23:04:41,941 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-25 23:04:41,941 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-25 23:04:41,944 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-25 23:04:41,944 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 11:04:41" (1/1) ... [2024-01-25 23:04:41,945 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31fabceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:04:41, skipping insertion in model container [2024-01-25 23:04:41,945 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 11:04:41" (1/1) ... [2024-01-25 23:04:41,995 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-25 23:04:42,250 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[186294,186307] [2024-01-25 23:04:42,288 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-25 23:04:42,296 INFO L202 MainTranslator]: Completed pre-run [2024-01-25 23:04:42,347 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-3_2-container_of-global.i[186294,186307] [2024-01-25 23:04:42,361 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-25 23:04:42,395 INFO L206 MainTranslator]: Completed translation [2024-01-25 23:04:42,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:04:42 WrapperNode [2024-01-25 23:04:42,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-25 23:04:42,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-25 23:04:42,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-25 23:04:42,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-25 23:04:42,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:04:42" (1/1) ... [2024-01-25 23:04:42,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:04:42" (1/1) ... [2024-01-25 23:04:42,447 INFO L138 Inliner]: procedures = 246, calls = 51, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 135 [2024-01-25 23:04:42,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-25 23:04:42,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-25 23:04:42,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-25 23:04:42,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-25 23:04:42,453 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:04:42" (1/1) ... [2024-01-25 23:04:42,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:04:42" (1/1) ... [2024-01-25 23:04:42,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:04:42" (1/1) ... [2024-01-25 23:04:42,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:04:42" (1/1) ... [2024-01-25 23:04:42,483 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:04:42" (1/1) ... [2024-01-25 23:04:42,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:04:42" (1/1) ... [2024-01-25 23:04:42,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:04:42" (1/1) ... [2024-01-25 23:04:42,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:04:42" (1/1) ... [2024-01-25 23:04:42,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-25 23:04:42,494 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-25 23:04:42,495 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-25 23:04:42,495 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-25 23:04:42,495 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:04:42" (1/1) ... [2024-01-25 23:04:42,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-01-25 23:04:42,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-25 23:04:42,527 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-01-25 23:04:42,563 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-01-25 23:04:42,567 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-01-25 23:04:42,567 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-01-25 23:04:42,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-25 23:04:42,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-25 23:04:42,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-25 23:04:42,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-25 23:04:42,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-01-25 23:04:42,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-01-25 23:04:42,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-25 23:04:42,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-01-25 23:04:42,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-01-25 23:04:42,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-25 23:04:42,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-25 23:04:42,571 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-25 23:04:42,809 INFO L241 CfgBuilder]: Building ICFG [2024-01-25 23:04:42,810 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-25 23:04:42,991 INFO L282 CfgBuilder]: Performing block encoding [2024-01-25 23:04:43,006 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-25 23:04:43,006 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-01-25 23:04:43,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 11:04:43 BoogieIcfgContainer [2024-01-25 23:04:43,006 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-25 23:04:43,025 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-25 23:04:43,025 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-25 23:04:43,028 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-25 23:04:43,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 11:04:41" (1/3) ... [2024-01-25 23:04:43,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa4f873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 11:04:43, skipping insertion in model container [2024-01-25 23:04:43,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 11:04:42" (2/3) ... [2024-01-25 23:04:43,029 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aa4f873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 11:04:43, skipping insertion in model container [2024-01-25 23:04:43,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 11:04:43" (3/3) ... [2024-01-25 23:04:43,030 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2024-01-25 23:04:43,036 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-25 23:04:43,043 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-25 23:04:43,044 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-01-25 23:04:43,044 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-25 23:04:43,084 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-25 23:04:43,110 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-25 23:04:43,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-25 23:04:43,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-25 23:04:43,112 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-01-25 23:04:43,120 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-01-25 23:04:43,141 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-25 23:04:43,147 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-25 23:04:43,151 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;@7fdcdeb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-25 23:04:43,151 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-01-25 23:04:43,166 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:04:43,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:04:43,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1813170212, now seen corresponding path program 1 times [2024-01-25 23:04:43,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:04:43,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295562290] [2024-01-25 23:04:43,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:04:43,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:04:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:04:43,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-25 23:04:43,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:04:43,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295562290] [2024-01-25 23:04:43,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295562290] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:04:43,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:04:43,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-25 23:04:43,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672539207] [2024-01-25 23:04:43,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:04:43,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-25 23:04:43,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:04:43,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-25 23:04:43,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-25 23:04:43,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:04:43,687 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:04:43,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 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-01-25 23:04:43,688 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:04:43,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-25 23:04:43,736 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-01-25 23:04:43,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-25 23:04:43,739 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2024-01-25 23:04:43,740 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/8) [2024-01-25 23:04:43,744 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-25 23:04:43,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-25 23:04:43,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-25 23:04:43,782 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-01-25 23:04:43,798 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-25 23:04:43,798 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-25 23:04:43,799 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-01-25 23:04:43,799 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;@7fdcdeb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-25 23:04:43,799 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. Found a loop, use abstraction hammer [2024-01-25 23:04:43,805 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:04:43,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:04:43,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1669371631, now seen corresponding path program 1 times [2024-01-25 23:04:43,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:04:43,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043074969] [2024-01-25 23:04:43,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:04:43,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:04:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:04:43,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-25 23:04:43,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:04:43,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043074969] [2024-01-25 23:04:43,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043074969] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:04:43,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:04:43,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-25 23:04:43,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003803284] [2024-01-25 23:04:43,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:04:43,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-25 23:04:43,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:04:43,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-25 23:04:43,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-25 23:04:43,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:04:43,848 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:04:43,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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-01-25 23:04:43,849 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:04:43,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:04:43,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-25 23:04:43,864 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:04:43,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:04:43,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1884397698, now seen corresponding path program 1 times [2024-01-25 23:04:43,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:04:43,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872185096] [2024-01-25 23:04:43,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:04:43,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:04:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:04:44,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-25 23:04:44,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:04:44,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872185096] [2024-01-25 23:04:44,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872185096] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:04:44,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:04:44,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-25 23:04:44,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45906049] [2024-01-25 23:04:44,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:04:44,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-25 23:04:44,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:04:44,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-25 23:04:44,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-25 23:04:44,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:04:44,071 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:04:44,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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-01-25 23:04:44,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:04:44,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:04:44,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:04:44,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-25 23:04:44,147 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-01-25 23:04:44,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-25 23:04:44,152 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-01-25 23:04:44,152 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION was SAFE (2/8) [2024-01-25 23:04:44,158 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-25 23:04:44,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-25 23:04:44,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-25 23:04:44,186 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-01-25 23:04:44,189 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-01-25 23:04:44,192 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-25 23:04:44,192 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-25 23:04:44,193 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;@7fdcdeb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-25 23:04:44,193 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. Found a loop, use abstraction hammer [2024-01-25 23:04:44,210 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:04:44,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:04:44,210 INFO L85 PathProgramCache]: Analyzing trace with hash -612052010, now seen corresponding path program 1 times [2024-01-25 23:04:44,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:04:44,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686224864] [2024-01-25 23:04:44,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:04:44,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:04:44,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:04:44,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-25 23:04:44,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:04:44,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686224864] [2024-01-25 23:04:44,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686224864] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:04:44,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:04:44,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-25 23:04:44,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732880312] [2024-01-25 23:04:44,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:04:44,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-25 23:04:44,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:04:44,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-25 23:04:44,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-25 23:04:44,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:04:44,244 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:04:44,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 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-01-25 23:04:44,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:04:44,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:04:44,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-25 23:04:44,249 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:04:44,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:04:44,249 INFO L85 PathProgramCache]: Analyzing trace with hash 621419061, now seen corresponding path program 1 times [2024-01-25 23:04:44,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:04:44,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042173214] [2024-01-25 23:04:44,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:04:44,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:04:44,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:04:44,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-25 23:04:44,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:04:44,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042173214] [2024-01-25 23:04:44,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042173214] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:04:44,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:04:44,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-25 23:04:44,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757806572] [2024-01-25 23:04:44,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:04:44,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-25 23:04:44,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:04:44,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-25 23:04:44,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-25 23:04:44,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:04:44,431 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:04:44,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-01-25 23:04:44,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:04:44,432 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-25 23:06:31,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:06:31,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-25 23:06:31,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-25 23:06:31,493 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:06:31,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:06:31,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1249797795, now seen corresponding path program 1 times [2024-01-25 23:06:31,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:06:31,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033843777] [2024-01-25 23:06:31,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:06:31,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:06:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:06:31,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-25 23:06:31,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:06:31,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033843777] [2024-01-25 23:06:31,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033843777] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:06:31,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:06:31,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-25 23:06:31,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371897215] [2024-01-25 23:06:31,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:06:31,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-25 23:06:31,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:06:31,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-25 23:06:31,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-25 23:06:31,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:06:31,664 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:06:31,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 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-01-25 23:06:31,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:06:31,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-01-25 23:06:31,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-25 23:08:29,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:08:29,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-25 23:08:29,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-25 23:08:29,104 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-01-25 23:08:29,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-01-25 23:08:29,129 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-01-25 23:08:29,130 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION was SAFE (3/8) [2024-01-25 23:08:29,132 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-25 23:08:29,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-25 23:08:29,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-25 23:08:29,134 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-01-25 23:08:29,152 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-01-25 23:08:29,155 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-25 23:08:29,155 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-25 23:08:29,155 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;@7fdcdeb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-25 23:08:29,155 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. Found a loop, use abstraction hammer [2024-01-25 23:08:29,167 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:08:29,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:08:29,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1203095876, now seen corresponding path program 1 times [2024-01-25 23:08:29,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:08:29,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986299363] [2024-01-25 23:08:29,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:08:29,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:08:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:08:29,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-25 23:08:29,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:08:29,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986299363] [2024-01-25 23:08:29,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986299363] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:08:29,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:08:29,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-25 23:08:29,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950142902] [2024-01-25 23:08:29,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:08:29,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-25 23:08:29,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:08:29,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-25 23:08:29,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-25 23:08:29,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:08:29,200 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:08:29,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 42.0) internal successors, (84), 2 states have internal predecessors, (84), 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-01-25 23:08:29,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:08:29,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:08:29,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-25 23:08:29,208 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:08:29,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:08:29,209 INFO L85 PathProgramCache]: Analyzing trace with hash 22777485, now seen corresponding path program 1 times [2024-01-25 23:08:29,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:08:29,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563988382] [2024-01-25 23:08:29,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:08:29,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:08:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:08:29,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-25 23:08:29,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:08:29,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563988382] [2024-01-25 23:08:29,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563988382] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:08:29,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:08:29,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-01-25 23:08:29,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098405018] [2024-01-25 23:08:29,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:08:29,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-25 23:08:29,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:08:29,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-25 23:08:29,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-25 23:08:29,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:08:29,419 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:08:29,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 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-01-25 23:08:29,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:08:29,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-25 23:09:14,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:09:14,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-25 23:09:14,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-25 23:09:14,515 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:09:14,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:09:14,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1996786507, now seen corresponding path program 1 times [2024-01-25 23:09:14,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:09:14,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204435097] [2024-01-25 23:09:14,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:09:14,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:09:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:09:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-25 23:09:14,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:09:14,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204435097] [2024-01-25 23:09:14,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204435097] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:09:14,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:09:14,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-01-25 23:09:14,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992272765] [2024-01-25 23:09:14,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:09:14,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-25 23:09:14,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:09:14,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-25 23:09:14,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-25 23:09:14,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:09:14,663 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:09:14,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 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-01-25 23:09:14,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:09:14,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-01-25 23:09:14,663 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer Found a loop, use abstraction hammer [2024-01-25 23:11:04,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:11:04,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-01-25 23:11:04,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-01-25 23:11:04,206 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-01-25 23:11:04,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-25 23:11:04,208 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-01-25 23:11:04,209 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION was SAFE (4/8) [2024-01-25 23:11:04,210 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-25 23:11:04,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-01-25 23:11:04,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-01-25 23:11:04,213 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-01-25 23:11:04,221 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-01-25 23:11:04,232 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-01-25 23:11:04,232 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-01-25 23:11:04,233 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;@7fdcdeb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-25 23:11:04,233 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. Found a loop, use abstraction hammer [2024-01-25 23:11:04,243 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:11:04,243 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:11:04,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1721899730, now seen corresponding path program 1 times [2024-01-25 23:11:04,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:11:04,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098141688] [2024-01-25 23:11:04,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:11:04,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:11:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:11:04,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-25 23:11:04,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:11:04,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098141688] [2024-01-25 23:11:04,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098141688] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:11:04,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:11:04,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-25 23:11:04,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119836719] [2024-01-25 23:11:04,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:11:04,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-01-25 23:11:04,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:11:04,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-01-25 23:11:04,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-01-25 23:11:04,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:11:04,308 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:11:04,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.5) internal successors, (125), 2 states have internal predecessors, (125), 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-01-25 23:11:04,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:11:04,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:11:04,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-01-25 23:11:04,318 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:11:04,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:11:04,318 INFO L85 PathProgramCache]: Analyzing trace with hash 558901359, now seen corresponding path program 1 times [2024-01-25 23:11:04,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:11:04,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019704092] [2024-01-25 23:11:04,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:11:04,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:11:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:11:06,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-25 23:11:06,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:11:06,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019704092] [2024-01-25 23:11:06,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019704092] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:11:06,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:11:06,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-01-25 23:11:06,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928968064] [2024-01-25 23:11:06,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:11:06,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-01-25 23:11:06,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:11:06,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-01-25 23:11:06,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-01-25 23:11:06,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:11:06,835 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:11:06,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 17 states have internal predecessors, (121), 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-01-25 23:11:06,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:11:06,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:11:08,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:11:08,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-01-25 23:11:08,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-01-25 23:11:08,574 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-01-25 23:11:08,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-25 23:11:08,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1070950511, now seen corresponding path program 2 times [2024-01-25 23:11:08,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-25 23:11:08,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438563505] [2024-01-25 23:11:08,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-25 23:11:08,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-25 23:11:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-25 23:11:10,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-25 23:11:10,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-25 23:11:10,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438563505] [2024-01-25 23:11:10,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438563505] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-25 23:11:10,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-25 23:11:10,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-01-25 23:11:10,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674100939] [2024-01-25 23:11:10,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-25 23:11:10,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-01-25 23:11:10,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-25 23:11:10,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-01-25 23:11:10,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2024-01-25 23:11:10,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:11:10,670 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-01-25 23:11:10,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.761904761904762) internal successors, (121), 21 states have internal predecessors, (121), 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-01-25 23:11:10,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-01-25 23:11:10,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-01-25 23:11:10,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Found a loop, use abstraction hammer Received shutdown request... [2024-01-25 23:19:05,358 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-01-25 23:19:05,358 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-01-25 23:19:05,358 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-01-25 23:19:05,379 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-01-25 23:19:05,394 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-01-25 23:19:05,394 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-01-25 23:19:05,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-01-25 23:19:05,671 WARN L619 AbstractCegarLoop]: Verification canceled: while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. [2024-01-25 23:19:05,672 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-01-25 23:19:05,674 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1] [2024-01-25 23:19:05,675 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (5/8) [2024-01-25 23:19:05,676 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-01-25 23:19:05,676 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-01-25 23:19:05,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 11:19:05 BasicIcfg [2024-01-25 23:19:05,679 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-01-25 23:19:05,679 INFO L158 Benchmark]: Toolchain (without parser) took 863739.93ms. Allocated memory was 209.7MB in the beginning and 1.2GB in the end (delta: 998.2MB). Free memory was 172.2MB in the beginning and 283.4MB in the end (delta: -111.2MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2024-01-25 23:19:05,679 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 209.7MB. Free memory is still 166.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-01-25 23:19:05,679 INFO L158 Benchmark]: CACSL2BoogieTranslator took 454.60ms. Allocated memory is still 209.7MB. Free memory was 172.2MB in the beginning and 137.6MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2024-01-25 23:19:05,680 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.24ms. Allocated memory is still 209.7MB. Free memory was 137.6MB in the beginning and 134.9MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-01-25 23:19:05,680 INFO L158 Benchmark]: Boogie Preprocessor took 46.34ms. Allocated memory is still 209.7MB. Free memory was 134.9MB in the beginning and 132.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-01-25 23:19:05,680 INFO L158 Benchmark]: RCFGBuilder took 512.36ms. Allocated memory is still 209.7MB. Free memory was 132.1MB in the beginning and 107.6MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2024-01-25 23:19:05,680 INFO L158 Benchmark]: TraceAbstraction took 862653.67ms. Allocated memory was 209.7MB in the beginning and 1.2GB in the end (delta: 998.2MB). Free memory was 181.5MB in the beginning and 283.4MB in the end (delta: -101.9MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2024-01-25 23:19:05,681 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 209.7MB. Free memory is still 166.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 454.60ms. Allocated memory is still 209.7MB. Free memory was 172.2MB in the beginning and 137.6MB in the end (delta: 34.6MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.24ms. Allocated memory is still 209.7MB. Free memory was 137.6MB in the beginning and 134.9MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.34ms. Allocated memory is still 209.7MB. Free memory was 134.9MB in the beginning and 132.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 512.36ms. Allocated memory is still 209.7MB. Free memory was 132.1MB in the beginning and 107.6MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 862653.67ms. Allocated memory was 209.7MB in the beginning and 1.2GB in the end (delta: 998.2MB). Free memory was 181.5MB in the beginning and 283.4MB in the end (delta: -101.9MB). Peak memory consumption was 1.0GB. 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: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 1, Times there's more than one choice: 0, Avg number of choices: 1.0 - StatisticsResult: Reduction benchmarks 0.0s Time before loop, 0.0s Time in loop, 0.0s Time in total, Has Loop: false, Protected Variables: [ULTIMATE.start_ldv_assert_#in~expression#1, ULTIMATE.start_my_drv_probe_#t~mem6#1, ULTIMATE.start_my_drv_probe_~data#1.offset, ULTIMATE.start_my_drv_probe_~data#1.base, ULTIMATE.start_ldv_assert_~expression#1, #memory_int], Protected Variables before encountering a loop: [ULTIMATE.start_ldv_assert_#in~expression#1, ULTIMATE.start_my_drv_probe_#t~mem6#1, ULTIMATE.start_my_drv_probe_~data#1.offset, ULTIMATE.start_my_drv_probe_~data#1.base, ULTIMATE.start_ldv_assert_~expression#1, #memory_int] - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, 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: 2 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 3, Times there's more than one choice: 1, Avg number of choices: 1.3333333333333333 - StatisticsResult: Reduction benchmarks 0.1s Time before loop, 0.0s Time in loop, 0.1s Time in total, Has Loop: false, Protected Variables: [ULTIMATE.start_ldv_assert_#in~expression#1, ULTIMATE.start_my_drv_probe_#t~mem7#1, ULTIMATE.start_my_drv_probe_~data#1.offset, ULTIMATE.start_my_drv_probe_~data#1.base, ULTIMATE.start_ldv_assert_~expression#1, #memory_int], Protected Variables before encountering a loop: [ULTIMATE.start_ldv_assert_#in~expression#1, ULTIMATE.start_my_drv_probe_#t~mem7#1, ULTIMATE.start_my_drv_probe_~data#1.offset, ULTIMATE.start_my_drv_probe_~data#1.base, ULTIMATE.start_ldv_assert_~expression#1, #memory_int] - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 20544, independent: 20368, independent conditional: 20368, independent unconditional: 0, dependent: 176, dependent conditional: 176, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20505, independent: 20368, independent conditional: 20368, independent unconditional: 0, dependent: 137, dependent conditional: 137, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20505, independent: 20368, independent conditional: 20368, independent unconditional: 0, dependent: 137, dependent conditional: 137, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20861, independent: 20368, independent conditional: 0, independent unconditional: 20368, dependent: 493, dependent conditional: 356, dependent unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20861, independent: 20368, independent conditional: 0, independent unconditional: 20368, dependent: 493, dependent conditional: 0, dependent unconditional: 493, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20861, independent: 20368, independent conditional: 0, independent unconditional: 20368, dependent: 493, dependent conditional: 0, dependent unconditional: 493, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20505, independent: 20368, independent conditional: 0, independent unconditional: 20368, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20505, independent: 20323, independent conditional: 0, independent unconditional: 20323, dependent: 182, dependent conditional: 0, dependent unconditional: 182, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 182, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 182, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 182, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 77936, independent: 428, independent conditional: 0, independent unconditional: 428, dependent: 77508, dependent conditional: 0, dependent unconditional: 77508, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 20861, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 356, dependent conditional: 0, dependent unconditional: 356, unknown: 20505, unknown conditional: 0, unknown unconditional: 20505] , Statistics on independence cache: Total cache size (in pairs): 20505, Positive cache size: 20368, Positive conditional cache size: 0, Positive unconditional cache size: 20368, Negative cache size: 137, Negative conditional cache size: 0, Negative unconditional cache size: 137, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 356, Maximal queried relation: 3, Independence queries for same thread: 39 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 1, RedundantProofs: 1, ProvenStates: 49, Times there's more than one choice: 29, Avg number of choices: 1.9591836734693877 - StatisticsResult: Reduction benchmarks 0.7s Time before loop, 116.7s Time in loop, 117.4s Time in total, Has Loop: true, Protected Variables: [ULTIMATE.start_main_~#data~1#1.base, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_ldv_assert_#in~expression#1, ULTIMATE.start_main_#t~ret18#1, ULTIMATE.start_main_~probe_ret~0#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_ldv_assert_~expression#1, ULTIMATE.start_main_~#data~1#1.offset, #memory_int], Protected Variables before encountering a loop: [ULTIMATE.start_main_~#data~1#1.base, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_ldv_assert_#in~expression#1, ULTIMATE.start_ldv_assert_~expression#1, ULTIMATE.start_main_~#data~1#1.offset, #memory_int] - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 17286, independent: 17122, independent conditional: 17122, independent unconditional: 0, dependent: 164, dependent conditional: 164, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17232, independent: 17122, independent conditional: 17122, independent unconditional: 0, dependent: 110, dependent conditional: 110, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 17232, independent: 17122, independent conditional: 17122, independent unconditional: 0, dependent: 110, dependent conditional: 110, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17534, independent: 17122, independent conditional: 0, independent unconditional: 17122, dependent: 412, dependent conditional: 302, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17534, independent: 17122, independent conditional: 0, independent unconditional: 17122, dependent: 412, dependent conditional: 0, dependent unconditional: 412, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17534, independent: 17122, independent conditional: 0, independent unconditional: 17122, dependent: 412, dependent conditional: 0, dependent unconditional: 412, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17232, independent: 17122, independent conditional: 0, independent unconditional: 17122, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17232, independent: 17086, independent conditional: 0, independent unconditional: 17086, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 146, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 146, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 146, independent: 36, independent conditional: 0, independent unconditional: 36, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 63489, independent: 309, independent conditional: 0, independent unconditional: 309, dependent: 63180, dependent conditional: 0, dependent unconditional: 63180, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 17534, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 302, dependent conditional: 0, dependent unconditional: 302, unknown: 17232, unknown conditional: 0, unknown unconditional: 17232] , Statistics on independence cache: Total cache size (in pairs): 17232, Positive cache size: 17122, Positive conditional cache size: 0, Positive unconditional cache size: 17122, Negative cache size: 110, Negative conditional cache size: 0, Negative unconditional cache size: 110, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 302, Maximal queried relation: 3, Independence queries for same thread: 54 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 1, RedundantProofs: 1, ProvenStates: 64, Times there's more than one choice: 43, Avg number of choices: 2.09375 - StatisticsResult: Reduction benchmarks 0.0s Time before loop, 109.5s Time in loop, 109.5s Time in total, Has Loop: true, Protected Variables: [ULTIMATE.start_main_~#data~1#1.base, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_ldv_assert_#in~expression#1, ULTIMATE.start_main_#t~ret18#1, ULTIMATE.start_main_~probe_ret~0#1, ULTIMATE.start_my_drv_probe_#res#1, ULTIMATE.start_ldv_assert_~expression#1, ULTIMATE.start_main_~#data~1#1.offset, #memory_int], Protected Variables before encountering a loop: [] - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 19245, independent: 19085, independent conditional: 19085, independent unconditional: 0, dependent: 160, dependent conditional: 160, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19214, independent: 19085, independent conditional: 19085, independent unconditional: 0, dependent: 129, dependent conditional: 129, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19214, independent: 19085, independent conditional: 19085, independent unconditional: 0, dependent: 129, dependent conditional: 129, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19600, independent: 19085, independent conditional: 0, independent unconditional: 19085, dependent: 515, dependent conditional: 386, dependent unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19600, independent: 19085, independent conditional: 0, independent unconditional: 19085, dependent: 515, dependent conditional: 0, dependent unconditional: 515, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19600, independent: 19085, independent conditional: 0, independent unconditional: 19085, dependent: 515, dependent conditional: 0, dependent unconditional: 515, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19214, independent: 19085, independent conditional: 0, independent unconditional: 19085, dependent: 129, dependent conditional: 0, dependent unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19214, independent: 19061, independent conditional: 0, independent unconditional: 19061, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 153, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 129, dependent conditional: 0, dependent unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 153, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 129, dependent conditional: 0, dependent unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 153, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 129, dependent conditional: 0, dependent unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 80204, independent: 237, independent conditional: 0, independent unconditional: 237, dependent: 79967, dependent conditional: 0, dependent unconditional: 79967, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 19600, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 386, dependent conditional: 0, dependent unconditional: 386, unknown: 19214, unknown conditional: 0, unknown unconditional: 19214] , Statistics on independence cache: Total cache size (in pairs): 19214, Positive cache size: 19085, Positive conditional cache size: 0, Positive unconditional cache size: 19085, Negative cache size: 129, Negative conditional cache size: 0, Negative unconditional cache size: 129, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 386, Maximal queried relation: 3, Independence queries for same thread: 31 - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 1, RedundantProofs: 1, ProvenStates: 31, Times there's more than one choice: 25, Avg number of choices: 2.5161290322580645 - StatisticsResult: Reduction benchmarks 1.7s Time before loop, 0.0s Time in loop, 1.7s Time in total, Has Loop: false, Protected Variables: [ULTIMATE.start_my_drv_probe_#in~data#1.offset, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_~#data~1#1.base, ULTIMATE.start_ldv_assert_#in~expression#1, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~__mptr~0.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_probe_#in~data#1.base, my_callbackThread1of1ForFork1_#t~nondet4.base, ULTIMATE.start_my_drv_probe_~data#1.offset, my_callbackThread1of1ForFork1_~data~0.offset, #valid, ULTIMATE.start_my_drv_probe_~data#1.base, ~my_dev~0.offset, my_callbackThread1of1ForFork1_~__mptr~0.offset, ULTIMATE.start_ldv_assert_~expression#1, ~my_dev~0.base, my_callbackThread1of1ForFork1_#t~nondet4.offset, ULTIMATE.start_main_~#data~1#1.offset, #memory_int], Protected Variables before encountering a loop: [ULTIMATE.start_my_drv_probe_#in~data#1.offset, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_~#data~1#1.base, ULTIMATE.start_ldv_assert_#in~expression#1, my_callbackThread1of1ForFork1_~data~0.base, my_callbackThread1of1ForFork1_~__mptr~0.base, ULTIMATE.start_my_drv_disconnect_~#status~0#1.base, ULTIMATE.start_my_drv_probe_#in~data#1.base, my_callbackThread1of1ForFork1_#t~nondet4.base, ULTIMATE.start_my_drv_probe_~data#1.offset, my_callbackThread1of1ForFork1_~data~0.offset, #valid, ULTIMATE.start_my_drv_probe_~data#1.base, ~my_dev~0.offset, my_callbackThread1of1ForFork1_~__mptr~0.offset, ULTIMATE.start_ldv_assert_~expression#1, ~my_dev~0.base, my_callbackThread1of1ForFork1_#t~nondet4.offset, ULTIMATE.start_main_~#data~1#1.offset, #memory_int] - PositiveResult [Line: 3887]: 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: 3887]: 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: 3887]: 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: 3887]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - TimeoutResultAtElement [Line: 3887]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 4 procedures, 195 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 1, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, 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: 6, 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.3s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 63 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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: ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 4 procedures, 195 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, 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: 9, 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.2s InterpolantComputationTime, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 173 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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: ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 4 procedures, 195 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 224.9s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 224.5s, 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: 20, 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.3s InterpolantComputationTime, 235 NumberOfCodeBlocks, 235 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 232 ConstructedInterpolants, 0 QuantifiedInterpolants, 279 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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: ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 4 procedures, 195 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 155.1s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 154.7s, 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: 20, 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.3s InterpolantComputationTime, 261 NumberOfCodeBlocks, 261 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 258 ConstructedInterpolants, 0 QuantifiedInterpolants, 375 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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: ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 4 procedures, 195 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 481.4s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 476.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: 61, 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, 4.5s InterpolantComputationTime, 367 NumberOfCodeBlocks, 367 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 364 ConstructedInterpolants, 0 QuantifiedInterpolants, 3160 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown