/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 18:19:52,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 18:19:52,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-30 18:19:52,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 18:19:52,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 18:19:53,026 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 18:19:53,027 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 18:19:53,027 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 18:19:53,028 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 18:19:53,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 18:19:53,033 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 18:19:53,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 18:19:53,033 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 18:19:53,035 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 18:19:53,035 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 18:19:53,035 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 18:19:53,035 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 18:19:53,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 18:19:53,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 18:19:53,036 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 18:19:53,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 18:19:53,038 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 18:19:53,038 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 18:19:53,038 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 18:19:53,039 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 18:19:53,039 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 18:19:53,039 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 18:19:53,039 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 18:19:53,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 18:19:53,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 18:19:53,041 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 18:19:53,041 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 18:19:53,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 18:19:53,041 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 18:19:53,041 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-30 18:19:53,042 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-30 18:19:53,042 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 18:19:53,042 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 18:19:53,042 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 18:19:53,042 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-05-30 18:19:53,246 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 18:19:53,266 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 18:19:53,268 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 18:19:53,269 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 18:19:53,270 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 18:19:53,271 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2024-05-30 18:19:54,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 18:19:54,827 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 18:19:54,828 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i [2024-05-30 18:19:54,858 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9a1e469e7/15a6dba5d5554f3e9264b64925e38d35/FLAGe1892aef6 [2024-05-30 18:19:55,061 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/9a1e469e7/15a6dba5d5554f3e9264b64925e38d35 [2024-05-30 18:19:55,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 18:19:55,064 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 18:19:55,065 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 18:19:55,066 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 18:19:55,070 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 18:19:55,071 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 06:19:55" (1/1) ... [2024-05-30 18:19:55,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6de8dfa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:19:55, skipping insertion in model container [2024-05-30 18:19:55,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 06:19:55" (1/1) ... [2024-05-30 18:19:55,123 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 18:19:55,776 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-2_5-container_of.i[75002,75015] [2024-05-30 18:19:55,847 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 18:19:55,868 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 18:19:55,918 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-2_5-container_of.i[75002,75015] [2024-05-30 18:19:55,945 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 18:19:56,059 INFO L206 MainTranslator]: Completed translation [2024-05-30 18:19:56,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:19:56 WrapperNode [2024-05-30 18:19:56,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 18:19:56,061 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 18:19:56,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 18:19:56,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 18:19:56,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:19:56" (1/1) ... [2024-05-30 18:19:56,113 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:19:56" (1/1) ... [2024-05-30 18:19:56,148 INFO L138 Inliner]: procedures = 469, calls = 63, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 144 [2024-05-30 18:19:56,149 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 18:19:56,149 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 18:19:56,150 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 18:19:56,150 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 18:19:56,159 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:19:56" (1/1) ... [2024-05-30 18:19:56,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:19:56" (1/1) ... [2024-05-30 18:19:56,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:19:56" (1/1) ... [2024-05-30 18:19:56,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:19:56" (1/1) ... [2024-05-30 18:19:56,186 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:19:56" (1/1) ... [2024-05-30 18:19:56,188 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:19:56" (1/1) ... [2024-05-30 18:19:56,192 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:19:56" (1/1) ... [2024-05-30 18:19:56,193 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:19:56" (1/1) ... [2024-05-30 18:19:56,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 18:19:56,199 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 18:19:56,199 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 18:19:56,199 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 18:19:56,200 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:19:56" (1/1) ... [2024-05-30 18:19:56,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 18:19:56,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 18:19:56,233 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-30 18:19:56,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-30 18:19:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-30 18:19:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 18:19:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-30 18:19:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-30 18:19:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-05-30 18:19:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 18:19:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-05-30 18:19:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 18:19:56,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 18:19:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-05-30 18:19:56,274 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-05-30 18:19:56,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 18:19:56,275 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-05-30 18:19:56,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 18:19:56,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 18:19:56,277 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-30 18:19:56,499 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 18:19:56,501 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 18:19:56,782 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 18:19:56,832 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 18:19:56,832 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-30 18:19:56,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 06:19:56 BoogieIcfgContainer [2024-05-30 18:19:56,833 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 18:19:56,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 18:19:56,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 18:19:56,839 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 18:19:56,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 06:19:55" (1/3) ... [2024-05-30 18:19:56,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be0513c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 06:19:56, skipping insertion in model container [2024-05-30 18:19:56,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:19:56" (2/3) ... [2024-05-30 18:19:56,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3be0513c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 06:19:56, skipping insertion in model container [2024-05-30 18:19:56,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 06:19:56" (3/3) ... [2024-05-30 18:19:56,841 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_5-container_of.i [2024-05-30 18:19:56,849 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 18:19:56,859 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 18:19:56,859 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-05-30 18:19:56,860 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 18:19:56,926 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-30 18:19:56,968 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 18:19:56,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 18:19:56,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 18:19:56,976 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 18:19:57,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-30 18:19:57,028 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 18:19:57,034 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 18:19:57,042 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@54d7d79c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 18:19:57,042 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 18:19:57,081 INFO L78 Accepts]: Start accepts. Automaton has currently 64 states, but on-demand construction may add more states Word has length 54 [2024-05-30 18:19:57,082 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:19:57,083 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:19:57,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:19:57,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1097834492, now seen corresponding path program 1 times [2024-05-30 18:19:57,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:19:57,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775668605] [2024-05-30 18:19:57,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:19:57,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:19:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:19:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 18:19:57,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:19:57,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775668605] [2024-05-30 18:19:57,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775668605] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 18:19:57,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 18:19:57,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-30 18:19:57,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904378073] [2024-05-30 18:19:57,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 18:19:57,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-30 18:19:57,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:19:57,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-30 18:19:57,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-30 18:19:57,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:19:57,948 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:19:57,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 18:19:57,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:20:15,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 18:20:15,732 INFO L78 Accepts]: Start accepts. Automaton has currently 10426 states, but on-demand construction may add more states Word has length 77 [2024-05-30 18:20:15,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:20:15,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 18:20:15,734 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:20:15,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:20:15,734 INFO L85 PathProgramCache]: Analyzing trace with hash 742350497, now seen corresponding path program 1 times [2024-05-30 18:20:15,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:20:15,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49657675] [2024-05-30 18:20:15,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:20:15,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:20:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:20:15,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 18:20:15,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:20:15,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49657675] [2024-05-30 18:20:15,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49657675] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 18:20:15,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 18:20:15,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-30 18:20:15,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861868572] [2024-05-30 18:20:15,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 18:20:15,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-30 18:20:15,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:20:15,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-30 18:20:15,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-30 18:20:15,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:20:15,943 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:20:15,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 18:20:15,943 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 18:20:15,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:20:18,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 18:20:18,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 18:20:18,519 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 18:20:18,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-30 18:20:18,527 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 18:20:18,529 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/8) [2024-05-30 18:20:18,534 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 18:20:18,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 18:20:18,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 18:20:18,571 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 18:20:18,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2024-05-30 18:20:18,591 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 18:20:18,592 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 18:20:18,593 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@54d7d79c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 18:20:18,593 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 18:20:18,602 INFO L78 Accepts]: Start accepts. Automaton has currently 173 states, but on-demand construction may add more states Word has length 102 [2024-05-30 18:20:18,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:20:18,603 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:20:18,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:20:18,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1775666171, now seen corresponding path program 1 times [2024-05-30 18:20:18,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:20:18,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585885715] [2024-05-30 18:20:18,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:20:18,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:20:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:20:19,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 18:20:19,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:20:19,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585885715] [2024-05-30 18:20:19,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585885715] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 18:20:19,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 18:20:19,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 18:20:19,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672440922] [2024-05-30 18:20:19,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 18:20:19,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-30 18:20:19,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:20:19,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-30 18:20:19,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-30 18:20:19,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:20:19,014 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:20:19,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 51.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 18:20:19,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:20:25,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 18:20:25,700 INFO L78 Accepts]: Start accepts. Automaton has currently 284 states, but on-demand construction may add more states Word has length 98 [2024-05-30 18:20:25,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:20:25,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-30 18:20:25,703 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:20:25,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:20:25,703 INFO L85 PathProgramCache]: Analyzing trace with hash -181342207, now seen corresponding path program 1 times [2024-05-30 18:20:25,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:20:25,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822688266] [2024-05-30 18:20:25,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:20:25,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:20:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:20:27,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 18:20:27,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:20:27,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822688266] [2024-05-30 18:20:27,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822688266] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 18:20:27,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 18:20:27,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-05-30 18:20:27,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180718626] [2024-05-30 18:20:27,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 18:20:27,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-05-30 18:20:27,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:20:27,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-05-30 18:20:27,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-05-30 18:20:27,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:20:27,018 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:20:27,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.125) internal successors, (98), 17 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 18:20:27,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 18:20:27,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:20:45,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 18:20:45,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-30 18:20:45,477 INFO L78 Accepts]: Start accepts. Automaton has currently 338 states, but on-demand construction may add more states Word has length 96 [2024-05-30 18:20:45,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:20:45,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-30 18:20:45,478 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:20:45,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:20:45,478 INFO L85 PathProgramCache]: Analyzing trace with hash 487758756, now seen corresponding path program 1 times [2024-05-30 18:20:45,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:20:45,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31194207] [2024-05-30 18:20:45,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:20:45,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:20:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:20:47,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 18:20:47,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:20:47,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31194207] [2024-05-30 18:20:47,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31194207] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 18:20:47,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 18:20:47,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2024-05-30 18:20:47,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848366480] [2024-05-30 18:20:47,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 18:20:47,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-05-30 18:20:47,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:20:47,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-05-30 18:20:47,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2024-05-30 18:20:47,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:20:47,503 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:20:47,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 3.84) internal successors, (96), 26 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 18:20:47,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 18:20:47,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-30 18:20:47,503 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:21:01,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 18:21:01,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-30 18:21:01,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-05-30 18:21:01,546 INFO L78 Accepts]: Start accepts. Automaton has currently 398 states, but on-demand construction may add more states Word has length 98 [2024-05-30 18:21:01,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:21:01,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-30 18:21:01,547 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:21:01,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:21:01,547 INFO L85 PathProgramCache]: Analyzing trace with hash 688298789, now seen corresponding path program 2 times [2024-05-30 18:21:01,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:21:01,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143494641] [2024-05-30 18:21:01,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:21:01,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:21:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:21:03,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 18:21:03,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:21:03,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143494641] [2024-05-30 18:21:03,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143494641] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 18:21:03,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 18:21:03,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2024-05-30 18:21:03,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086250997] [2024-05-30 18:21:03,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 18:21:03,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-05-30 18:21:03,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:21:03,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-05-30 18:21:03,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2024-05-30 18:21:03,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:21:03,497 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:21:03,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.083333333333333) internal successors, (98), 25 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 18:21:03,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 18:21:03,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-05-30 18:21:03,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-05-30 18:21:03,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:21:30,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 18:21:30,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-30 18:21:30,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-05-30 18:21:30,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-05-30 18:21:30,469 INFO L78 Accepts]: Start accepts. Automaton has currently 492 states, but on-demand construction may add more states Word has length 96 [2024-05-30 18:21:30,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:21:30,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-30 18:21:30,471 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:21:30,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:21:30,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1981258844, now seen corresponding path program 2 times [2024-05-30 18:21:30,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:21:30,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123767404] [2024-05-30 18:21:30,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:21:30,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:21:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 18:21:30,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 18:21:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 18:21:30,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 18:21:30,639 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 18:21:30,639 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 18:21:30,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-30 18:21:30,641 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1] [2024-05-30 18:21:30,641 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was UNSAFE (2/8) [2024-05-30 18:21:30,646 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-30 18:21:30,646 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-30 18:21:30,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.05 06:21:30 BasicIcfg [2024-05-30 18:21:30,731 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-30 18:21:30,735 INFO L158 Benchmark]: Toolchain (without parser) took 95667.53ms. Allocated memory was 170.9MB in the beginning and 356.5MB in the end (delta: 185.6MB). Free memory was 97.8MB in the beginning and 268.4MB in the end (delta: -170.6MB). Peak memory consumption was 198.3MB. Max. memory is 8.0GB. [2024-05-30 18:21:30,735 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 170.9MB. Free memory is still 102.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 18:21:30,736 INFO L158 Benchmark]: CACSL2BoogieTranslator took 994.51ms. Allocated memory was 170.9MB in the beginning and 296.7MB in the end (delta: 125.8MB). Free memory was 97.6MB in the beginning and 220.9MB in the end (delta: -123.3MB). Peak memory consumption was 18.3MB. Max. memory is 8.0GB. [2024-05-30 18:21:30,736 INFO L158 Benchmark]: Boogie Procedure Inliner took 87.96ms. Allocated memory is still 296.7MB. Free memory was 220.4MB in the beginning and 217.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-30 18:21:30,736 INFO L158 Benchmark]: Boogie Preprocessor took 48.65ms. Allocated memory is still 296.7MB. Free memory was 217.2MB in the beginning and 214.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-30 18:21:30,736 INFO L158 Benchmark]: RCFGBuilder took 634.17ms. Allocated memory is still 296.7MB. Free memory was 214.1MB in the beginning and 183.7MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2024-05-30 18:21:30,737 INFO L158 Benchmark]: TraceAbstraction took 93896.02ms. Allocated memory was 296.7MB in the beginning and 356.5MB in the end (delta: 59.8MB). Free memory was 182.6MB in the beginning and 268.4MB in the end (delta: -85.8MB). Peak memory consumption was 157.0MB. Max. memory is 8.0GB. [2024-05-30 18:21:30,738 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.12ms. Allocated memory is still 170.9MB. Free memory is still 102.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 994.51ms. Allocated memory was 170.9MB in the beginning and 296.7MB in the end (delta: 125.8MB). Free memory was 97.6MB in the beginning and 220.9MB in the end (delta: -123.3MB). Peak memory consumption was 18.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 87.96ms. Allocated memory is still 296.7MB. Free memory was 220.4MB in the beginning and 217.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.65ms. Allocated memory is still 296.7MB. Free memory was 217.2MB in the beginning and 214.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 634.17ms. Allocated memory is still 296.7MB. Free memory was 214.1MB in the beginning and 183.7MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 93896.02ms. Allocated memory was 296.7MB in the beginning and 356.5MB in the end (delta: 59.8MB). Free memory was 182.6MB in the beginning and 268.4MB in the end (delta: -85.8MB). Peak memory consumption was 157.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 37056, independent: 36102, independent conditional: 36102, independent unconditional: 0, dependent: 752, dependent conditional: 752, dependent unconditional: 0, unknown: 202, unknown conditional: 202, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36918, independent: 36102, independent conditional: 36102, independent unconditional: 0, dependent: 614, dependent conditional: 614, dependent unconditional: 0, unknown: 202, unknown conditional: 202, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 36918, independent: 36102, independent conditional: 36102, independent unconditional: 0, dependent: 614, dependent conditional: 614, dependent unconditional: 0, unknown: 202, unknown conditional: 202, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38018, independent: 36102, independent conditional: 0, independent unconditional: 36102, dependent: 1440, dependent conditional: 826, dependent unconditional: 614, unknown: 476, unknown conditional: 274, unknown unconditional: 202] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38018, independent: 36102, independent conditional: 0, independent unconditional: 36102, dependent: 1440, dependent conditional: 13, dependent unconditional: 1427, unknown: 476, unknown conditional: 18, unknown unconditional: 458] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38018, independent: 36102, independent conditional: 0, independent unconditional: 36102, dependent: 1440, dependent conditional: 13, dependent unconditional: 1427, unknown: 476, unknown conditional: 18, unknown unconditional: 458] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2327, independent: 2280, independent conditional: 0, independent unconditional: 2280, dependent: 30, dependent conditional: 3, dependent unconditional: 27, unknown: 17, unknown conditional: 5, unknown unconditional: 12] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2327, independent: 2276, independent conditional: 0, independent unconditional: 2276, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 51, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 30, dependent conditional: 3, dependent unconditional: 27, unknown: 17, unknown conditional: 5, unknown unconditional: 12] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 51, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 30, dependent conditional: 3, dependent unconditional: 27, unknown: 17, unknown conditional: 5, unknown unconditional: 12] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18852, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 373, dependent conditional: 10, dependent unconditional: 364, unknown: 18465, unknown conditional: 5447, unknown unconditional: 13018] , Protected Queries: 0 ], Cache Queries: [ total: 38018, independent: 33822, independent conditional: 0, independent unconditional: 33822, dependent: 1410, dependent conditional: 10, dependent unconditional: 1400, unknown: 2786, unknown conditional: 21, unknown unconditional: 2765] , Statistics on independence cache: Total cache size (in pairs): 2310, Positive cache size: 2280, Positive conditional cache size: 0, Positive unconditional cache size: 2280, Negative cache size: 30, Negative conditional cache size: 3, Negative unconditional cache size: 27, Unknown cache size: 17, Unknown conditional cache size: 5, Unknown unconditional cache size: 12, Eliminated conditions: 1069, Maximal queried relation: 2, Independence queries for same thread: 138 - StatisticsResult: Visitor Statistics States: 61, Transitions: 60, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 11836, Transitions: 13928, Traversal time: 17.8s - StatisticsResult: Visitor Statistics States: 6516, Transitions: 7670, Traversal time: 2.6s - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1318, independent: 1233, independent conditional: 1233, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 51, unknown conditional: 51, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1306, independent: 1233, independent conditional: 1233, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 51, unknown conditional: 51, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1306, independent: 1233, independent conditional: 1233, independent unconditional: 0, dependent: 22, dependent conditional: 22, dependent unconditional: 0, unknown: 51, unknown conditional: 51, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1554, independent: 1233, independent conditional: 29, independent unconditional: 1204, dependent: 117, dependent conditional: 66, dependent unconditional: 51, unknown: 204, unknown conditional: 153, unknown unconditional: 51] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1554, independent: 1233, independent conditional: 29, independent unconditional: 1204, dependent: 117, dependent conditional: 49, dependent unconditional: 68, unknown: 204, unknown conditional: 113, unknown unconditional: 91] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1554, independent: 1233, independent conditional: 29, independent unconditional: 1204, dependent: 117, dependent conditional: 49, dependent unconditional: 68, unknown: 204, unknown conditional: 113, unknown unconditional: 91] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 363, independent: 265, independent conditional: 15, independent unconditional: 250, dependent: 43, dependent conditional: 31, dependent unconditional: 12, unknown: 55, unknown conditional: 45, unknown unconditional: 10] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 363, independent: 247, independent conditional: 0, independent unconditional: 247, dependent: 116, dependent conditional: 0, dependent unconditional: 116, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 116, independent: 18, independent conditional: 15, independent unconditional: 3, dependent: 43, dependent conditional: 31, dependent unconditional: 12, unknown: 55, unknown conditional: 45, unknown unconditional: 10] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 116, independent: 18, independent conditional: 15, independent unconditional: 3, dependent: 43, dependent conditional: 31, dependent unconditional: 12, unknown: 55, unknown conditional: 45, unknown unconditional: 10] , SemanticIndependenceRelation.Query Time [ms]: [ total: 60670, independent: 340, independent conditional: 335, independent unconditional: 5, dependent: 601, dependent conditional: 400, dependent unconditional: 201, unknown: 59729, unknown conditional: 48855, unknown unconditional: 10873] , Protected Queries: 0 ], Cache Queries: [ total: 1554, independent: 968, independent conditional: 14, independent unconditional: 954, dependent: 74, dependent conditional: 18, dependent unconditional: 56, unknown: 512, unknown conditional: 159, unknown unconditional: 353] , Statistics on independence cache: Total cache size (in pairs): 308, Positive cache size: 265, Positive conditional cache size: 15, Positive unconditional cache size: 250, Negative cache size: 43, Negative conditional cache size: 31, Negative unconditional cache size: 12, Unknown cache size: 55, Unknown conditional cache size: 45, Unknown unconditional cache size: 10, Eliminated conditions: 57, Maximal queried relation: 4, Independence queries for same thread: 12 - StatisticsResult: Visitor Statistics States: 117, Transitions: 116, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 248, Transitions: 266, Traversal time: 6.7s - StatisticsResult: Visitor Statistics States: 335, Transitions: 365, Traversal time: 18.5s - StatisticsResult: Visitor Statistics States: 395, Transitions: 418, Traversal time: 14.0s - StatisticsResult: Visitor Statistics States: 523, Transitions: 560, Traversal time: 27.0s - PositiveResult [Line: 1675]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - CounterExampleResult [Line: 1675]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1676] 0 pthread_t t1,t2; VAL [t1={3:0}, t2={4:0}] [L1745] CALL, EXPR 0 my_drv_init() [L1739] 0 return 0; VAL [\result=0, t1={3:0}, t2={4:0}] [L1745] RET, EXPR 0 my_drv_init() [L1745] 0 int ret = my_drv_init(); VAL [ret=0, t1={3:0}, t2={4:0}] [L1746] COND TRUE 0 ret==0 VAL [ret=0, t1={3:0}, t2={4:0}] [L1747] 0 int probe_ret; VAL [ret=0, t1={3:0}, t2={4:0}] [L1748] 0 struct my_data data; VAL [data={6:0}, ret=0, t1={3:0}, t2={4:0}] [L1749] CALL, EXPR 0 my_drv_probe(&data) [L1706] 0 struct device *d = &data->dev; VAL [d={6:24}, data={6:0}, data={6:0}, t1={3:0}, t2={4:0}] [L1708] 0 data->shared.a = 0 VAL [d={6:24}, data={6:0}, data={6:0}, t1={3:0}, t2={4:0}] [L1709] 0 data->shared.b = 0 VAL [d={6:24}, data={6:0}, data={6:0}, t1={3:0}, t2={4:0}] [L1710] 0 int res = __VERIFIER_nondet_int(); VAL [d={6:24}, data={6:0}, data={6:0}, res=0, t1={3:0}, t2={4:0}] [L1711] COND FALSE 0 !(\read(res)) VAL [d={6:24}, data={6:0}, data={6:0}, res=0, t1={3:0}, t2={4:0}] [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={6:24}, d={6:24}, data={6:0}, data={6:0}, res=0, t1={3:0}, t2={4:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [arg={6:24}, d={6:24}, data={6:0}, data={6:0}, res=0, t1={3:0}, t2={4:0}] [L1715] 0 return 0; VAL [\result=0, arg={6:24}, d={6:24}, data={6:0}, data={6:0}, res=0, t1={3:0}, t2={4:0}] [L1749] RET, EXPR 0 my_drv_probe(&data) [L1749] 0 probe_ret = my_drv_probe(&data) VAL [arg={6:24}, data={6:0}, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1750] COND TRUE 0 probe_ret==0 [L1751] CALL 0 my_drv_disconnect(&data) [L1721] 0 void *status; VAL [arg={6:24}, data={6:0}, data={6:0}, status={5:0}, t1={3:0}, t2={4:0}] [L1722] 0 \read(t1) VAL [arg={6:24}, data={6:0}, data={6:0}, status={5:0}, t1={3:0}, t2={4:0}] [L1689] 2 struct device *dev = (struct device*)arg; VAL [arg={6:24}, arg={6:24}, dev={6:24}, t1={3:0}, t2={4:0}] [L1690] 2 struct my_data *data; VAL [arg={6:24}, arg={6:24}, dev={6:24}, t1={3:0}, t2={4:0}] [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [__mptr={6:24}, arg={6:24}, arg={6:24}, dev={6:24}, t1={3:0}, t2={4:0}] [L1691] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} VAL [__mptr={6:24}, arg={6:24}, arg={6:24}, dev={6:24}, t1={3:0}, t2={4:0}] [L1691] 2 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} VAL [arg={6:24}, arg={6:24}, dev={6:24}, t1={3:0}, t2={4:0}] [L1691] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={3:0}, t2={4:0}] [L1689] 1 struct device *dev = (struct device*)arg; VAL [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={3:0}, t2={4:0}] [L1690] 1 struct my_data *data; VAL [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={3:0}, t2={4:0}] [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [__mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={3:0}, t2={4:0}] [L1691] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} VAL [__mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={3:0}, t2={4:0}] [L1691] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );} VAL [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={3:0}, t2={4:0}] [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={3:0}, t2={4:0}] [L1694] 1 data->shared.a = 1 VAL [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={3:0}, t2={4:0}] [L1697] EXPR 1 data->shared.b [L1697] 1 int lb = data->shared.b; [L1700] 1 data->shared.b = lb + 1 VAL [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L1703] 1 return 0; VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1={3:0}, t2={4:0}] [L1724] 0 data->shared.a = 3 VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1={3:0}, t2={4:0}] [L1727] 0 data->shared.b = 3 VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1={3:0}, t2={4:0}] [L1694] 2 data->shared.a = 1 VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L1730] EXPR 0 data->shared.a [L1730] CALL 0 ldv_assert(data->shared.a==3) [L1675] COND TRUE 0 !expression [L1675] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, expression=0, lb=0, t1={3:0}, t2={4:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 4 procedures, 193 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 21.5s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 20.4s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 18, 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.8s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 176 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.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 4 procedures, 193 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 72.1s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 66.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 84, 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.2s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 490 NumberOfCodeBlocks, 490 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 390 ConstructedInterpolants, 0 QuantifiedInterpolants, 3478 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-05-30 18:21:30,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Forceful destruction successful, exit code 0 [2024-05-30 18:21:31,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-30 18:21:31,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...