/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_2-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 18:19:50,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 18:19:50,374 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-30 18:19:50,377 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 18:19:50,377 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 18:19:50,388 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 18:19:50,388 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 18:19:50,389 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 18:19:50,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 18:19:50,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 18:19:50,390 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 18:19:50,390 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 18:19:50,390 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 18:19:50,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 18:19:50,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 18:19:50,391 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 18:19:50,391 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 18:19:50,391 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 18:19:50,391 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 18:19:50,391 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 18:19:50,392 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 18:19:50,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 18:19:50,395 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 18:19:50,395 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 18:19:50,395 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 18:19:50,395 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 18:19:50,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 18:19:50,396 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 18:19:50,396 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 18:19:50,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 18:19:50,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 18:19:50,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 18:19:50,397 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 18:19:50,397 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 18:19:50,397 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-30 18:19:50,397 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-30 18:19:50,398 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 18:19:50,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 18:19:50,398 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 18:19:50,398 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:50,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 18:19:50,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 18:19:50,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 18:19:50,614 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 18:19:50,615 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 18:19:50,616 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2024-05-30 18:19:51,551 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 18:19:51,795 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 18:19:51,796 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_2-container_of.i [2024-05-30 18:19:51,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c0ccf5183/df21b2d728ad48f981bc7d2fee6d390b/FLAG7f588ab2e [2024-05-30 18:19:51,831 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c0ccf5183/df21b2d728ad48f981bc7d2fee6d390b [2024-05-30 18:19:51,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 18:19:51,834 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 18:19:51,836 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 18:19:51,836 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 18:19:51,840 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 18:19:51,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 06:19:51" (1/1) ... [2024-05-30 18:19:51,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7abff979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:19:51, skipping insertion in model container [2024-05-30 18:19:51,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 06:19:51" (1/1) ... [2024-05-30 18:19:51,888 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 18:19:52,313 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_2-container_of.i[75002,75015] [2024-05-30 18:19:52,348 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 18:19:52,361 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 18:19:52,432 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_2-container_of.i[75002,75015] [2024-05-30 18:19:52,440 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 18:19:52,532 INFO L206 MainTranslator]: Completed translation [2024-05-30 18:19:52,532 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:19:52 WrapperNode [2024-05-30 18:19:52,532 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 18:19:52,533 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 18:19:52,533 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 18:19:52,533 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 18:19:52,538 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:52" (1/1) ... [2024-05-30 18:19:52,563 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:52" (1/1) ... [2024-05-30 18:19:52,586 INFO L138 Inliner]: procedures = 467, calls = 47, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 116 [2024-05-30 18:19:52,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 18:19:52,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 18:19:52,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 18:19:52,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 18:19:52,593 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:52" (1/1) ... [2024-05-30 18:19:52,593 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:52" (1/1) ... [2024-05-30 18:19:52,596 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:52" (1/1) ... [2024-05-30 18:19:52,596 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:52" (1/1) ... [2024-05-30 18:19:52,603 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:52" (1/1) ... [2024-05-30 18:19:52,604 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:52" (1/1) ... [2024-05-30 18:19:52,607 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:52" (1/1) ... [2024-05-30 18:19:52,608 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:52" (1/1) ... [2024-05-30 18:19:52,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 18:19:52,613 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 18:19:52,613 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 18:19:52,613 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 18:19:52,614 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:19:52" (1/1) ... [2024-05-30 18:19:52,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 18:19:52,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 18:19:52,644 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:52,656 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:52,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-30 18:19:52,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 18:19:52,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-30 18:19:52,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-30 18:19:52,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 18:19:52,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-05-30 18:19:52,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 18:19:52,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 18:19:52,685 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2024-05-30 18:19:52,685 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2024-05-30 18:19:52,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 18:19:52,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 18:19:52,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 18:19:52,687 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:52,927 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 18:19:52,929 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 18:19:53,147 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 18:19:53,172 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 18:19:53,172 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2024-05-30 18:19:53,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 06:19:53 BoogieIcfgContainer [2024-05-30 18:19:53,173 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 18:19:53,175 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 18:19:53,175 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 18:19:53,178 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 18:19:53,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 06:19:51" (1/3) ... [2024-05-30 18:19:53,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f18073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 06:19:53, skipping insertion in model container [2024-05-30 18:19:53,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:19:52" (2/3) ... [2024-05-30 18:19:53,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f18073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 06:19:53, skipping insertion in model container [2024-05-30 18:19:53,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 06:19:53" (3/3) ... [2024-05-30 18:19:53,180 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i [2024-05-30 18:19:53,188 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 18:19:53,196 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 18:19:53,196 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-05-30 18:19:53,197 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 18:19:53,256 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-30 18:19:53,306 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 18:19:53,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 18:19:53,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 18:19:53,312 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:53,320 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:53,352 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 18:19:53,357 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 18:19:53,363 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;@593d904e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 18:19:53,363 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 18:19:53,393 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:53,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:19:53,394 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:19:53,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:19:53,398 INFO L85 PathProgramCache]: Analyzing trace with hash -851334172, now seen corresponding path program 1 times [2024-05-30 18:19:53,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:19:53,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029930247] [2024-05-30 18:19:53,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:19:53,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:19:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:19:54,088 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:54,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:19:54,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029930247] [2024-05-30 18:19:54,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029930247] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 18:19:54,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 18:19:54,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-30 18:19:54,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508808332] [2024-05-30 18:19:54,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 18:19:54,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-30 18:19:54,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:19:54,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-30 18:19:54,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-30 18:19:54,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:19:54,118 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:19:54,118 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:54,119 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:20:07,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 18:20:07,010 INFO L78 Accepts]: Start accepts. Automaton has currently 6326 states, but on-demand construction may add more states Word has length 75 [2024-05-30 18:20:07,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:20:07,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 18:20:07,011 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:20:07,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:20:07,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1282618836, now seen corresponding path program 1 times [2024-05-30 18:20:07,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:20:07,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754970869] [2024-05-30 18:20:07,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:20:07,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:20:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:20:07,118 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:07,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:20:07,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754970869] [2024-05-30 18:20:07,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754970869] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 18:20:07,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 18:20:07,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-30 18:20:07,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31748477] [2024-05-30 18:20:07,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 18:20:07,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-30 18:20:07,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:20:07,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-30 18:20:07,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-30 18:20:07,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:20:07,123 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:20:07,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 18:20:07,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 18:20:07,123 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:20:09,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 18:20:09,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 18:20:09,532 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 18:20:09,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-30 18:20:09,540 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2024-05-30 18:20:09,541 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/6) [2024-05-30 18:20:09,557 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 18:20:09,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 18:20:09,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 18:20:09,586 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:09,587 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:09,606 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 18:20:09,606 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 18:20:09,607 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;@593d904e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 18:20:09,607 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 18:20:09,609 INFO L78 Accepts]: Start accepts. Automaton has currently 75 states, but on-demand construction may add more states Word has length 64 [2024-05-30 18:20:09,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:20:09,610 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:20:09,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:20:09,610 INFO L85 PathProgramCache]: Analyzing trace with hash 721180560, now seen corresponding path program 1 times [2024-05-30 18:20:09,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:20:09,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328740974] [2024-05-30 18:20:09,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:20:09,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:20:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:20:09,660 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:09,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:20:09,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328740974] [2024-05-30 18:20:09,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328740974] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 18:20:09,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 18:20:09,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 18:20:09,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496447145] [2024-05-30 18:20:09,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 18:20:09,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 18:20:09,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:20:09,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 18:20:09,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 18:20:09,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:20:09,664 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:20:09,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 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:09,665 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:20:09,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:20:09,668 INFO L78 Accepts]: Start accepts. Automaton has currently 71 states, but on-demand construction may add more states Word has length 62 [2024-05-30 18:20:09,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:20:09,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-30 18:20:09,669 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:20:09,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:20:09,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1712776801, now seen corresponding path program 1 times [2024-05-30 18:20:09,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:20:09,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669291153] [2024-05-30 18:20:09,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:20:09,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:20:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:20:09,835 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:09,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:20:09,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669291153] [2024-05-30 18:20:09,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669291153] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 18:20:09,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 18:20:09,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-30 18:20:09,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826971433] [2024-05-30 18:20:09,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 18:20:09,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-30 18:20:09,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:20:09,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-30 18:20:09,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-30 18:20:09,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:20:09,845 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:20:09,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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:09,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:20:09,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:20:21,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:20:21,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 18:20:21,293 INFO L78 Accepts]: Start accepts. Automaton has currently 4791 states, but on-demand construction may add more states Word has length 83 [2024-05-30 18:20:21,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:20:21,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-30 18:20:21,294 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:20:21,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:20:21,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1363515173, now seen corresponding path program 1 times [2024-05-30 18:20:21,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:20:21,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321950332] [2024-05-30 18:20:21,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:20:21,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:20:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:20:21,392 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:21,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:20:21,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321950332] [2024-05-30 18:20:21,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321950332] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 18:20:21,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 18:20:21,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-30 18:20:21,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094887630] [2024-05-30 18:20:21,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 18:20:21,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-30 18:20:21,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:20:21,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-30 18:20:21,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-30 18:20:21,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:20:21,395 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:20:21,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 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:21,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:20:21,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 18:20:21,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:20:23,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:20:23,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 18:20:23,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 18:20:23,742 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 18:20:23,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-30 18:20:23,748 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-05-30 18:20:23,748 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION was SAFE (2/6) [2024-05-30 18:20:23,752 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 18:20:23,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 18:20:23,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 18:20:23,755 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 18:20:23,760 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 18:20:23,760 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 18:20:23,760 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;@593d904e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 18:20:23,760 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 18:20:23,764 INFO L78 Accepts]: Start accepts. Automaton has currently 174 states, but on-demand construction may add more states Word has length 106 [2024-05-30 18:20:23,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:20:23,764 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:20:23,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:20:23,764 INFO L85 PathProgramCache]: Analyzing trace with hash 632673375, now seen corresponding path program 1 times [2024-05-30 18:20:23,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:20:23,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444661820] [2024-05-30 18:20:23,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:20:23,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:20:23,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2024-05-30 18:20:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:20:25,282 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:25,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:20:25,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444661820] [2024-05-30 18:20:25,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444661820] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 18:20:25,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 18:20:25,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-05-30 18:20:25,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750212743] [2024-05-30 18:20:25,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 18:20:25,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-05-30 18:20:25,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:20:25,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-05-30 18:20:25,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2024-05-30 18:20:25,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:20:25,285 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:20:25,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.3) internal successors, (106), 20 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 18:20:25,285 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:20:28,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-05-30 18:20:28,142 INFO L78 Accepts]: Start accepts. Automaton has currently 240 states, but on-demand construction may add more states Word has length 106 [2024-05-30 18:20:28,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:20:28,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-30 18:20:28,142 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:20:28,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:20:28,143 INFO L85 PathProgramCache]: Analyzing trace with hash -865534421, now seen corresponding path program 2 times [2024-05-30 18:20:28,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:20:28,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649233643] [2024-05-30 18:20:28,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:20:28,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:20:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:20:29,929 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:29,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:20:29,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649233643] [2024-05-30 18:20:29,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649233643] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 18:20:29,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 18:20:29,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2024-05-30 18:20:29,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777910406] [2024-05-30 18:20:29,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 18:20:29,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-05-30 18:20:29,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:20:29,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-05-30 18:20:29,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=637, Unknown=0, NotChecked=0, Total=702 [2024-05-30 18:20:29,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:20:29,932 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:20:29,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.925925925925926) internal successors, (106), 27 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 18:20:29,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-05-30 18:20:29,932 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:21:14,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-30 18:21:14,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-05-30 18:21:14,263 INFO L78 Accepts]: Start accepts. Automaton has currently 9687 states, but on-demand construction may add more states Word has length 106 [2024-05-30 18:21:14,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:21:14,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-30 18:21:14,265 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:21:14,270 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:21:14,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1493133991, now seen corresponding path program 3 times [2024-05-30 18:21:14,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:21:14,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906063286] [2024-05-30 18:21:14,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:21:14,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:21:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:21:15,622 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:15,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:21:15,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906063286] [2024-05-30 18:21:15,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906063286] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 18:21:15,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 18:21:15,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2024-05-30 18:21:15,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983616683] [2024-05-30 18:21:15,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 18:21:15,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-05-30 18:21:15,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:21:15,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-05-30 18:21:15,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=626, Unknown=0, NotChecked=0, Total=702 [2024-05-30 18:21:15,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:21:15,624 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:21:15,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.925925925925926) internal successors, (106), 27 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 18:21:15,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-05-30 18:21:15,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2024-05-30 18:21:15,625 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:21:55,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-05-30 18:21:55,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-05-30 18:21:55,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-30 18:21:55,100 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 18:21:55,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-30 18:21:55,101 INFO L445 BasicCegarLoop]: Path program histogram: [3] [2024-05-30 18:21:55,101 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (3/6) [2024-05-30 18:21:55,103 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 18:21:55,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 18:21:55,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 18:21:55,105 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 18:21:55,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2024-05-30 18:21:55,127 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 18:21:55,128 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 18:21:55,128 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;@593d904e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 18:21:55,128 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 18:21:55,130 INFO L78 Accepts]: Start accepts. Automaton has currently 185 states, but on-demand construction may add more states Word has length 116 [2024-05-30 18:21:55,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:21:55,131 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:21:55,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:21:55,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1133696747, now seen corresponding path program 1 times [2024-05-30 18:21:55,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:21:55,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543916115] [2024-05-30 18:21:55,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:21:55,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:21:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:21:55,176 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:55,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:21:55,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543916115] [2024-05-30 18:21:55,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543916115] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 18:21:55,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 18:21:55,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 18:21:55,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723006800] [2024-05-30 18:21:55,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 18:21:55,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 18:21:55,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:21:55,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 18:21:55,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 18:21:55,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:21:55,178 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:21:55,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 58.0) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 18:21:55,178 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:21:55,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:21:55,187 INFO L78 Accepts]: Start accepts. Automaton has currently 180 states, but on-demand construction may add more states Word has length 114 [2024-05-30 18:21:55,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:21:55,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-30 18:21:55,188 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:21:55,188 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:21:55,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1319941886, now seen corresponding path program 1 times [2024-05-30 18:21:55,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:21:55,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181994591] [2024-05-30 18:21:55,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:21:55,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:21:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:21:57,875 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:57,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:21:57,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181994591] [2024-05-30 18:21:57,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181994591] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 18:21:57,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 18:21:57,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2024-05-30 18:21:57,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580777609] [2024-05-30 18:21:57,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 18:21:57,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-05-30 18:21:57,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:21:57,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-05-30 18:21:57,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1244, Unknown=0, NotChecked=0, Total=1332 [2024-05-30 18:21:57,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:21:57,879 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:21:57,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.081081081081081) internal successors, (114), 37 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 18:21:57,879 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:21:57,879 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:22:02,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:22:02,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-30 18:22:02,950 INFO L78 Accepts]: Start accepts. Automaton has currently 258 states, but on-demand construction may add more states Word has length 114 [2024-05-30 18:22:02,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:22:02,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-05-30 18:22:02,950 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:22:02,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:22:02,951 INFO L85 PathProgramCache]: Analyzing trace with hash 290842318, now seen corresponding path program 2 times [2024-05-30 18:22:02,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:22:02,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924835048] [2024-05-30 18:22:02,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:22:02,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:22:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:22:05,625 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:22:05,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:22:05,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924835048] [2024-05-30 18:22:05,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924835048] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 18:22:05,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 18:22:05,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2024-05-30 18:22:05,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119401326] [2024-05-30 18:22:05,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 18:22:05,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-05-30 18:22:05,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:22:05,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-05-30 18:22:05,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1046, Unknown=0, NotChecked=0, Total=1122 [2024-05-30 18:22:05,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:22:05,627 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:22:05,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.3529411764705883) internal successors, (114), 34 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 18:22:05,627 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:22:05,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-05-30 18:22:05,628 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:22:11,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:22:11,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-30 18:22:11,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-05-30 18:22:11,311 INFO L78 Accepts]: Start accepts. Automaton has currently 258 states, but on-demand construction may add more states Word has length 114 [2024-05-30 18:22:11,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:22:11,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-30 18:22:11,311 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:22:11,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:22:11,312 INFO L85 PathProgramCache]: Analyzing trace with hash 397625816, now seen corresponding path program 3 times [2024-05-30 18:22:11,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:22:11,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803478206] [2024-05-30 18:22:11,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:22:11,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:22:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 18:22:11,350 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 18:22:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 18:22:11,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 18:22:11,428 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 18:22:11,429 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 18:22:11,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-05-30 18:22:11,430 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2024-05-30 18:22:11,431 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION was UNSAFE (4/6) [2024-05-30 18:22:11,432 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-30 18:22:11,433 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-30 18:22:11,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.05 06:22:11 BasicIcfg [2024-05-30 18:22:11,501 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-30 18:22:11,501 INFO L158 Benchmark]: Toolchain (without parser) took 139666.75ms. Allocated memory was 251.7MB in the beginning and 515.9MB in the end (delta: 264.2MB). Free memory was 176.5MB in the beginning and 349.0MB in the end (delta: -172.5MB). Peak memory consumption was 92.8MB. Max. memory is 8.0GB. [2024-05-30 18:22:11,501 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 251.7MB. Free memory is still 219.3MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 18:22:11,501 INFO L158 Benchmark]: CACSL2BoogieTranslator took 696.15ms. Allocated memory is still 251.7MB. Free memory was 176.4MB in the beginning and 183.9MB in the end (delta: -7.6MB). Peak memory consumption was 33.0MB. Max. memory is 8.0GB. [2024-05-30 18:22:11,501 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.66ms. Allocated memory is still 251.7MB. Free memory was 183.9MB in the beginning and 180.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-30 18:22:11,502 INFO L158 Benchmark]: Boogie Preprocessor took 25.44ms. Allocated memory is still 251.7MB. Free memory was 180.8MB in the beginning and 178.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 18:22:11,502 INFO L158 Benchmark]: RCFGBuilder took 559.92ms. Allocated memory is still 251.7MB. Free memory was 177.6MB in the beginning and 153.0MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2024-05-30 18:22:11,502 INFO L158 Benchmark]: TraceAbstraction took 138325.59ms. Allocated memory was 251.7MB in the beginning and 515.9MB in the end (delta: 264.2MB). Free memory was 151.4MB in the beginning and 349.0MB in the end (delta: -197.6MB). Peak memory consumption was 66.1MB. Max. memory is 8.0GB. [2024-05-30 18:22:11,503 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 251.7MB. Free memory is still 219.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 696.15ms. Allocated memory is still 251.7MB. Free memory was 176.4MB in the beginning and 183.9MB in the end (delta: -7.6MB). Peak memory consumption was 33.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.66ms. Allocated memory is still 251.7MB. Free memory was 183.9MB in the beginning and 180.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.44ms. Allocated memory is still 251.7MB. Free memory was 180.8MB in the beginning and 178.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 559.92ms. Allocated memory is still 251.7MB. Free memory was 177.6MB in the beginning and 153.0MB in the end (delta: 24.6MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 138325.59ms. Allocated memory was 251.7MB in the beginning and 515.9MB in the end (delta: 264.2MB). Free memory was 151.4MB in the beginning and 349.0MB in the end (delta: -197.6MB). Peak memory consumption was 66.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 21675, independent: 21006, independent conditional: 21006, independent unconditional: 0, dependent: 475, dependent conditional: 475, dependent unconditional: 0, unknown: 194, unknown conditional: 194, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21627, independent: 21006, independent conditional: 21006, independent unconditional: 0, dependent: 427, dependent conditional: 427, dependent unconditional: 0, unknown: 194, unknown conditional: 194, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21627, independent: 21006, independent conditional: 21006, independent unconditional: 0, dependent: 427, dependent conditional: 427, dependent unconditional: 0, unknown: 194, unknown conditional: 194, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22454, independent: 21006, independent conditional: 0, independent unconditional: 21006, dependent: 992, dependent conditional: 565, dependent unconditional: 427, unknown: 456, unknown conditional: 262, unknown unconditional: 194] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 22454, independent: 21006, independent conditional: 0, independent unconditional: 21006, dependent: 992, dependent conditional: 11, dependent unconditional: 981, unknown: 456, unknown conditional: 18, unknown unconditional: 438] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 22454, independent: 21006, independent conditional: 0, independent unconditional: 21006, dependent: 992, dependent conditional: 11, dependent unconditional: 981, unknown: 456, unknown conditional: 18, unknown unconditional: 438] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1621, independent: 1588, independent conditional: 0, independent unconditional: 1588, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 13, unknown conditional: 5, unknown unconditional: 8] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1621, independent: 1588, independent conditional: 0, independent unconditional: 1588, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 33, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 13, unknown conditional: 5, unknown unconditional: 8] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 33, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 13, unknown conditional: 5, unknown unconditional: 8] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14415, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 297, dependent conditional: 9, dependent unconditional: 289, unknown: 14118, unknown conditional: 5488, unknown unconditional: 8630] , Protected Queries: 0 ], Cache Queries: [ total: 22454, independent: 19418, independent conditional: 0, independent unconditional: 19418, dependent: 972, dependent conditional: 8, dependent unconditional: 964, unknown: 2064, unknown conditional: 21, unknown unconditional: 2043] , Statistics on independence cache: Total cache size (in pairs): 1608, Positive cache size: 1588, Positive conditional cache size: 0, Positive unconditional cache size: 1588, Negative cache size: 20, Negative conditional cache size: 3, Negative unconditional cache size: 17, Unknown cache size: 13, Unknown conditional cache size: 5, Unknown unconditional cache size: 8, Eliminated conditions: 798, Maximal queried relation: 2, Independence queries for same thread: 48 - StatisticsResult: Visitor Statistics States: 61, Transitions: 60, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 7021, Transitions: 8292, Traversal time: 12.9s - StatisticsResult: Visitor Statistics States: 3908, Transitions: 4630, Traversal time: 2.4s - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 16703, independent: 16220, independent conditional: 16220, independent unconditional: 0, dependent: 321, dependent conditional: 321, dependent unconditional: 0, unknown: 162, unknown conditional: 162, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16682, independent: 16220, independent conditional: 16220, independent unconditional: 0, dependent: 300, dependent conditional: 300, dependent unconditional: 0, unknown: 162, unknown conditional: 162, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16682, independent: 16220, independent conditional: 16220, independent unconditional: 0, dependent: 300, dependent conditional: 300, dependent unconditional: 0, unknown: 162, unknown conditional: 162, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17812, independent: 16220, independent conditional: 0, independent unconditional: 16220, dependent: 1038, dependent conditional: 738, dependent unconditional: 300, unknown: 554, unknown conditional: 392, unknown unconditional: 162] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 17812, independent: 16220, independent conditional: 0, independent unconditional: 16220, dependent: 1038, dependent conditional: 1, dependent unconditional: 1037, unknown: 554, unknown conditional: 10, unknown unconditional: 544] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 17812, independent: 16220, independent conditional: 0, independent unconditional: 16220, dependent: 1038, dependent conditional: 1, dependent unconditional: 1037, unknown: 554, unknown conditional: 10, unknown unconditional: 544] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1232, independent: 1206, independent conditional: 0, independent unconditional: 1206, dependent: 14, dependent conditional: 1, dependent unconditional: 13, unknown: 12, unknown conditional: 4, unknown unconditional: 8] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1232, independent: 1206, independent conditional: 0, independent unconditional: 1206, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 1, dependent unconditional: 13, unknown: 12, unknown conditional: 4, unknown unconditional: 8] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 26, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 1, dependent unconditional: 13, unknown: 12, unknown conditional: 4, unknown unconditional: 8] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13321, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 241, dependent conditional: 2, dependent unconditional: 239, unknown: 13080, unknown conditional: 4400, unknown unconditional: 8680] , Protected Queries: 0 ], Cache Queries: [ total: 17812, independent: 15014, independent conditional: 0, independent unconditional: 15014, dependent: 1024, dependent conditional: 0, dependent unconditional: 1024, unknown: 1774, unknown conditional: 11, unknown unconditional: 1763] , Statistics on independence cache: Total cache size (in pairs): 1220, Positive cache size: 1206, Positive conditional cache size: 0, Positive unconditional cache size: 1206, Negative cache size: 14, Negative conditional cache size: 1, Negative unconditional cache size: 13, Unknown cache size: 12, Unknown conditional cache size: 4, Unknown unconditional cache size: 8, Eliminated conditions: 1119, Maximal queried relation: 3, Independence queries for same thread: 21 - StatisticsResult: Visitor Statistics States: 71, Transitions: 70, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 70, Transitions: 69, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 4900, Transitions: 5291, Traversal time: 11.4s - StatisticsResult: Visitor Statistics States: 3926, Transitions: 4648, Traversal time: 2.3s - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 56752, independent: 54293, independent conditional: 54293, independent unconditional: 0, dependent: 1622, dependent conditional: 1622, dependent unconditional: 0, unknown: 837, unknown conditional: 837, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56472, independent: 54293, independent conditional: 54293, independent unconditional: 0, dependent: 1342, dependent conditional: 1342, dependent unconditional: 0, unknown: 837, unknown conditional: 837, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56472, independent: 54293, independent conditional: 54293, independent unconditional: 0, dependent: 1342, dependent conditional: 1342, dependent unconditional: 0, unknown: 837, unknown conditional: 837, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 62237, independent: 54293, independent conditional: 67, independent unconditional: 54226, dependent: 4913, dependent conditional: 3510, dependent unconditional: 1403, unknown: 3031, unknown conditional: 2188, unknown unconditional: 843] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 62237, independent: 54293, independent conditional: 67, independent unconditional: 54226, dependent: 4913, dependent conditional: 1494, dependent unconditional: 3419, unknown: 3031, unknown conditional: 788, unknown unconditional: 2243] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 62237, independent: 54293, independent conditional: 67, independent unconditional: 54226, dependent: 4913, dependent conditional: 1494, dependent unconditional: 3419, unknown: 3031, unknown conditional: 788, unknown unconditional: 2243] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2066, independent: 1857, independent conditional: 10, independent unconditional: 1847, dependent: 137, dependent conditional: 111, dependent unconditional: 26, unknown: 72, unknown conditional: 56, unknown unconditional: 16] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2066, independent: 1847, independent conditional: 0, independent unconditional: 1847, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 219, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 137, dependent conditional: 111, dependent unconditional: 26, unknown: 72, unknown conditional: 56, unknown unconditional: 16] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 219, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 137, dependent conditional: 111, dependent unconditional: 26, unknown: 72, unknown conditional: 56, unknown unconditional: 16] , SemanticIndependenceRelation.Query Time [ms]: [ total: 80333, independent: 515, independent conditional: 515, independent unconditional: 0, dependent: 1634, dependent conditional: 1232, dependent unconditional: 402, unknown: 78184, unknown conditional: 60872, unknown unconditional: 17312] , Protected Queries: 0 ], Cache Queries: [ total: 62237, independent: 52436, independent conditional: 57, independent unconditional: 52379, dependent: 4776, dependent conditional: 1383, dependent unconditional: 3393, unknown: 5025, unknown conditional: 909, unknown unconditional: 4116] , Statistics on independence cache: Total cache size (in pairs): 1994, Positive cache size: 1857, Positive conditional cache size: 10, Positive unconditional cache size: 1847, Negative cache size: 137, Negative conditional cache size: 111, Negative unconditional cache size: 26, Unknown cache size: 72, Unknown conditional cache size: 56, Unknown unconditional cache size: 16, Eliminated conditions: 3416, Maximal queried relation: 3, Independence queries for same thread: 280 - StatisticsResult: Visitor Statistics States: 121, Transitions: 120, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 190, Transitions: 189, Traversal time: 2.9s - StatisticsResult: Visitor Statistics States: 11168, Transitions: 13672, Traversal time: 44.3s - StatisticsResult: Visitor Statistics States: 15676, Transitions: 20448, Traversal time: 39.5s - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 370, independent: 351, independent conditional: 351, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 355, independent: 351, independent conditional: 351, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 355, independent: 351, independent conditional: 351, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 366, independent: 351, independent conditional: 1, independent unconditional: 350, dependent: 8, dependent conditional: 6, dependent unconditional: 2, unknown: 7, unknown conditional: 4, unknown unconditional: 3] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 366, independent: 351, independent conditional: 1, independent unconditional: 350, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 7, unknown conditional: 2, unknown unconditional: 5] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 366, independent: 351, independent conditional: 1, independent unconditional: 350, dependent: 8, dependent conditional: 4, dependent unconditional: 4, unknown: 7, unknown conditional: 2, unknown unconditional: 5] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 101, independent: 93, independent conditional: 1, independent unconditional: 92, dependent: 4, dependent conditional: 3, dependent unconditional: 1, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 101, independent: 92, independent conditional: 0, independent unconditional: 92, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 9, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 4, dependent conditional: 3, dependent unconditional: 1, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 4, dependent conditional: 3, dependent unconditional: 1, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4599, independent: 80, independent conditional: 80, independent unconditional: 0, dependent: 144, dependent conditional: 113, dependent unconditional: 31, unknown: 4375, unknown conditional: 2200, unknown unconditional: 2175] , Protected Queries: 0 ], Cache Queries: [ total: 366, independent: 258, independent conditional: 0, independent unconditional: 258, dependent: 4, dependent conditional: 1, dependent unconditional: 3, unknown: 104, unknown conditional: 6, unknown unconditional: 98] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 93, Positive conditional cache size: 1, Positive unconditional cache size: 92, Negative cache size: 4, Negative conditional cache size: 3, Negative unconditional cache size: 1, Unknown cache size: 4, Unknown conditional cache size: 2, Unknown unconditional cache size: 2, Eliminated conditions: 4, Maximal queried relation: 3, Independence queries for same thread: 15 - StatisticsResult: Visitor Statistics States: 131, Transitions: 130, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 130, Transitions: 129, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 208, Transitions: 207, Traversal time: 5.1s - StatisticsResult: Visitor Statistics States: 208, Transitions: 207, Traversal time: 5.7s - 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 - 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 - 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}] [L1731] CALL, EXPR 0 my_drv_init() [L1725] 0 return 0; VAL [\result=0, t1={3:0}, t2={4:0}] [L1731] RET, EXPR 0 my_drv_init() [L1731] 0 int ret = my_drv_init(); VAL [ret=0, t1={3:0}, t2={4:0}] [L1732] COND TRUE 0 ret==0 VAL [ret=0, t1={3:0}, t2={4:0}] [L1733] 0 int probe_ret; VAL [ret=0, t1={3:0}, t2={4:0}] [L1734] 0 struct my_data data; VAL [data={6:0}, ret=0, t1={3:0}, t2={4:0}] [L1735] CALL, EXPR 0 my_drv_probe(&data) [L1704] 0 struct device *d = &data->dev; VAL [d={6:24}, data={6:0}, data={6:0}, t1={3:0}, t2={4:0}] [L1706] 0 data->shared.a = 0 VAL [d={6:24}, data={6:0}, data={6:0}, t1={3:0}, t2={4:0}] [L1707] 0 data->shared.b = 0 VAL [d={6:24}, data={6:0}, data={6:0}, t1={3:0}, t2={4:0}] [L1708] 0 int res = __VERIFIER_nondet_int(); VAL [d={6:24}, data={6:0}, data={6:0}, res=0, t1={3:0}, t2={4:0}] [L1709] COND FALSE 0 !(\read(res)) VAL [d={6:24}, data={6:0}, data={6:0}, res=0, t1={3:0}, t2={4:0}] [L1711] 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}] [L1712] 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}] [L1713] 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}] [L1735] RET, EXPR 0 my_drv_probe(&data) [L1735] 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}] [L1736] COND TRUE 0 probe_ret==0 [L1737] CALL 0 my_drv_disconnect(&data) [L1719] 0 void *status; VAL [arg={6:24}, data={6:0}, data={6:0}, status={5:0}, t1={3:0}, t2={4:0}] [L1720] 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}] [L1693] 2 data->shared.a = 1 VAL [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={3:0}, t2={4:0}] [L1696] EXPR 2 data->shared.b [L1696] 2 int lb = data->shared.b; [L1689] 1 struct device *dev = (struct device*)arg; VAL [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, 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}, lb=0, 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}, lb=0, 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}, lb=0, 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}, lb=0, 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}, lb=0, t1={3:0}, t2={4:0}] [L1693] 1 data->shared.a = 1 VAL [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}] [L1696] EXPR 1 data->shared.b [L1696] 1 int lb = data->shared.b; [L1699] 2 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}] [L1701] 2 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}] [L1699] 1 data->shared.b = lb + 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}] [L1701] 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}] [L1720] 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}] [L1721] 0 \read(t2) 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}] [L1721] FCALL, JOIN 2 pthread_join(t2, &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}] [L1737] RET 0 my_drv_disconnect(&data) [L1738] EXPR 0 data.shared.a VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=0, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1738] CALL 0 ldv_assert(data.shared.a==1) [L1675] COND FALSE 0 !(!expression) VAL [\old(expression)=1, \result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, expression=1, lb=0, t1={3:0}, t2={4:0}] [L1738] RET 0 ldv_assert(data.shared.a==1) [L1739] EXPR 0 data.shared.b VAL [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=0, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1739] CALL 0 ldv_assert(data.shared.b==2) [L1675] COND TRUE 0 !expression 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}] [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.startErr2ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 4 procedures, 175 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 16.2s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 15.3s, 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.5s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 127 ConstructedInterpolants, 0 QuantifiedInterpolants, 174 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.startErr3ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 4 procedures, 175 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 14.1s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 13.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: 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.2s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 323 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.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 4 procedures, 175 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 91.3s, OverallIterations: 3, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 86.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: 94, 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, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 315 ConstructedInterpolants, 0 QuantifiedInterpolants, 4129 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.startErr1ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 4 procedures, 175 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 16.3s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 10.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: 90, 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, 5.3s InterpolantComputationTime, 458 NumberOfCodeBlocks, 458 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 341 ConstructedInterpolants, 0 QuantifiedInterpolants, 4598 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 proved your program to be incorrect! [2024-05-30 18:22:11,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Forceful destruction successful, exit code 0 [2024-05-30 18:22:11,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2024-05-30 18:22:12,016 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:22:12,206 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:22:12,341 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...