/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i


--------------------------------------------------------------------------------


This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-e23131f-m
[2024-05-03 02:54:30,329 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-05-03 02:54:30,404 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf
[2024-05-03 02:54:30,410 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-05-03 02:54:30,411 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-05-03 02:54:30,411 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty.
[2024-05-03 02:54:30,441 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-05-03 02:54:30,441 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-05-03 02:54:30,442 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-05-03 02:54:30,446 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-05-03 02:54:30,447 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-05-03 02:54:30,447 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-05-03 02:54:30,447 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-05-03 02:54:30,449 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-05-03 02:54:30,449 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-05-03 02:54:30,449 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-05-03 02:54:30,450 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-05-03 02:54:30,450 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-05-03 02:54:30,450 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-05-03 02:54:30,450 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-05-03 02:54:30,450 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-05-03 02:54:30,451 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-05-03 02:54:30,452 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-05-03 02:54:30,452 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-05-03 02:54:30,452 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-05-03 02:54:30,453 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-05-03 02:54:30,453 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-05-03 02:54:30,453 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-05-03 02:54:30,453 INFO  L153        SettingsManager]:  * To the following directory=./dump/
[2024-05-03 02:54:30,454 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-05-03 02:54:30,454 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-05-03 02:54:30,455 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-05-03 02:54:30,455 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-05-03 02:54:30,455 INFO  L153        SettingsManager]:  * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL
[2024-05-03 02:54:30,455 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-05-03 02:54:30,456 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-05-03 02:54:30,456 INFO  L153        SettingsManager]:  * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS
[2024-05-03 02:54:30,457 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-05-03 02:54:30,457 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-05-03 02:54:30,457 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2024-05-03 02:54:30,457 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-05-03 02:54:30,457 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION
[2024-05-03 02:54:30,704 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-05-03 02:54:30,724 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-05-03 02:54:30,727 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-05-03 02:54:30,728 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-05-03 02:54:30,728 INFO  L274        PluginConnector]: CDTParser initialized
[2024-05-03 02:54:30,729 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/ldv-races/race-2_5-container_of.i
[2024-05-03 02:54:31,871 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-05-03 02:54:32,125 INFO  L384              CDTParser]: Found 1 translation units.
[2024-05-03 02:54:32,126 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i
[2024-05-03 02:54:32,144 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/dfa8ecdd6/47cba168c5d74877b9770e596c9b5211/FLAG5b1facc4c
[2024-05-03 02:54:32,156 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/dfa8ecdd6/47cba168c5d74877b9770e596c9b5211
[2024-05-03 02:54:32,158 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-05-03 02:54:32,159 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-05-03 02:54:32,160 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-05-03 02:54:32,160 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-05-03 02:54:32,165 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-05-03 02:54:32,165 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 02:54:32" (1/1) ...
[2024-05-03 02:54:32,166 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a569cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 02:54:32, skipping insertion in model container
[2024-05-03 02:54:32,166 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.05 02:54:32" (1/1) ...
[2024-05-03 02:54:32,223 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-05-03 02:54:32,859 WARN  L239   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i[75002,75015]
[2024-05-03 02:54:32,918 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-05-03 02:54:32,928 INFO  L202         MainTranslator]: Completed pre-run
[2024-05-03 02:54:32,975 WARN  L239   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_5-container_of.i[75002,75015]
[2024-05-03 02:54:32,995 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-05-03 02:54:33,171 INFO  L206         MainTranslator]: Completed translation
[2024-05-03 02:54:33,171 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 02:54:33 WrapperNode
[2024-05-03 02:54:33,171 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-05-03 02:54:33,173 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-05-03 02:54:33,173 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-05-03 02:54:33,173 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-05-03 02:54:33,180 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 02:54:33" (1/1) ...
[2024-05-03 02:54:33,210 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 02:54:33" (1/1) ...
[2024-05-03 02:54:33,237 INFO  L138                Inliner]: procedures = 469, calls = 63, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 144
[2024-05-03 02:54:33,237 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-05-03 02:54:33,238 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-05-03 02:54:33,238 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-05-03 02:54:33,238 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-05-03 02:54:33,246 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 02:54:33" (1/1) ...
[2024-05-03 02:54:33,246 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 02:54:33" (1/1) ...
[2024-05-03 02:54:33,251 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 02:54:33" (1/1) ...
[2024-05-03 02:54:33,251 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 02:54:33" (1/1) ...
[2024-05-03 02:54:33,268 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 02:54:33" (1/1) ...
[2024-05-03 02:54:33,270 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 02:54:33" (1/1) ...
[2024-05-03 02:54:33,275 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 02:54:33" (1/1) ...
[2024-05-03 02:54:33,277 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 02:54:33" (1/1) ...
[2024-05-03 02:54:33,282 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-05-03 02:54:33,283 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-05-03 02:54:33,283 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-05-03 02:54:33,283 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-05-03 02:54:33,283 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 02:54:33" (1/1) ...
[2024-05-03 02:54:33,302 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-05-03 02:54:33,318 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-05-03 02:54:33,337 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-05-03 02:54:33,340 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-05-03 02:54:33,373 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-05-03 02:54:33,373 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-05-03 02:54:33,373 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-05-03 02:54:33,373 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-05-03 02:54:33,373 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-05-03 02:54:33,374 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-05-03 02:54:33,374 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2024-05-03 02:54:33,374 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-05-03 02:54:33,374 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-05-03 02:54:33,374 INFO  L130     BoogieDeclarations]: Found specification of procedure my_callback
[2024-05-03 02:54:33,374 INFO  L138     BoogieDeclarations]: Found implementation of procedure my_callback
[2024-05-03 02:54:33,374 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-05-03 02:54:33,374 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2024-05-03 02:54:33,375 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-05-03 02:54:33,375 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-05-03 02:54:33,376 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-05-03 02:54:33,634 INFO  L241             CfgBuilder]: Building ICFG
[2024-05-03 02:54:33,636 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-05-03 02:54:33,832 INFO  L282             CfgBuilder]: Performing block encoding
[2024-05-03 02:54:33,877 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-05-03 02:54:33,877 INFO  L309             CfgBuilder]: Removed 0 assume(true) statements.
[2024-05-03 02:54:33,878 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 02:54:33 BoogieIcfgContainer
[2024-05-03 02:54:33,878 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-05-03 02:54:33,880 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-05-03 02:54:33,880 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-05-03 02:54:33,883 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-05-03 02:54:33,883 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.05 02:54:32" (1/3) ...
[2024-05-03 02:54:33,884 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e97795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 02:54:33, skipping insertion in model container
[2024-05-03 02:54:33,884 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.05 02:54:33" (2/3) ...
[2024-05-03 02:54:33,884 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47e97795 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.05 02:54:33, skipping insertion in model container
[2024-05-03 02:54:33,884 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.05 02:54:33" (3/3) ...
[2024-05-03 02:54:33,885 INFO  L112   eAbstractionObserver]: Analyzing ICFG race-2_5-container_of.i
[2024-05-03 02:54:33,896 WARN  L146   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-05-03 02:54:33,904 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-05-03 02:54:33,905 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations.
[2024-05-03 02:54:33,905 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-05-03 02:54:33,968 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-05-03 02:54:34,016 INFO  L103   denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-05-03 02:54:34,017 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2024-05-03 02:54:34,017 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-05-03 02:54:34,020 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null)
[2024-05-03 02:54:34,023 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process
[2024-05-03 02:54:34,062 INFO  L166   artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2024-05-03 02:54:34,070 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION ========
[2024-05-03 02:54:34,076 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7dedc475, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-05-03 02:54:34,076 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-05-03 02:54:34,082 INFO  L199   cStratifiedReduction]: Start building reduction automaton
[2024-05-03 02:54:34,117 INFO  L211   cStratifiedReduction]: Finished building reduction automaton with 61 states.
[2024-05-03 02:54:34,117 INFO  L212   cStratifiedReduction]: Copied states 0 times.
[2024-05-03 02:54:34,120 INFO  L78                 Accepts]: Start accepts. Automaton has currently 64 states, but on-demand construction may add more states Word has length 54
[2024-05-03 02:54:34,122 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2024-05-03 02:54:34,122 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-05-03 02:54:34,126 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-03 02:54:34,126 INFO  L85        PathProgramCache]: Analyzing trace with hash 1097834492, now seen corresponding path program 1 times
[2024-05-03 02:54:34,133 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-03 02:54:34,133 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133047809]
[2024-05-03 02:54:34,133 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-03 02:54:34,134 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-03 02:54:34,391 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-03 02:54:34,906 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-03 02:54:34,907 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-03 02:54:34,907 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133047809]
[2024-05-03 02:54:34,908 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133047809] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-03 02:54:34,908 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-03 02:54:34,908 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-05-03 02:54:34,909 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333489428]
[2024-05-03 02:54:34,910 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-03 02:54:34,913 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-05-03 02:54:34,914 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-03 02:54:34,936 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-05-03 02:54:34,937 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-05-03 02:54:34,937 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-05-03 02:54:34,939 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-05-03 02:54:34,940 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-03 02:54:34,940 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-05-03 02:54:34,941 INFO  L199   cStratifiedReduction]: Start building reduction automaton
[2024-05-03 02:55:25,665 INFO  L211   cStratifiedReduction]: Finished building reduction automaton with 10433 states.
[2024-05-03 02:55:25,665 INFO  L212   cStratifiedReduction]: Copied states 0 times.
[2024-05-03 02:55:25,666 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-05-03 02:55:25,666 INFO  L78                 Accepts]: Start accepts. Automaton has currently 11080 states, but on-demand construction may add more states Word has length 77
[2024-05-03 02:55:25,667 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2024-05-03 02:55:25,667 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-05-03 02:55:25,667 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-05-03 02:55:25,668 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-03 02:55:25,668 INFO  L85        PathProgramCache]: Analyzing trace with hash 742350497, now seen corresponding path program 1 times
[2024-05-03 02:55:25,668 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-03 02:55:25,668 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957540124]
[2024-05-03 02:55:25,668 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-03 02:55:25,669 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-03 02:55:25,710 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-03 02:55:25,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-03 02:55:25,875 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-03 02:55:25,875 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957540124]
[2024-05-03 02:55:25,876 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957540124] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-03 02:55:25,876 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-03 02:55:25,877 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-05-03 02:55:25,878 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898167862]
[2024-05-03 02:55:25,878 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-03 02:55:25,879 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-05-03 02:55:25,879 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-03 02:55:25,880 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-05-03 02:55:25,880 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-05-03 02:55:25,880 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-05-03 02:55:25,882 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-05-03 02:55:25,882 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-03 02:55:25,883 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. 
[2024-05-03 02:55:25,883 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-05-03 02:55:25,884 INFO  L199   cStratifiedReduction]: Start building reduction automaton
[2024-05-03 02:56:17,291 INFO  L211   cStratifiedReduction]: Finished building reduction automaton with 5591 states.
[2024-05-03 02:56:17,291 INFO  L212   cStratifiedReduction]: Copied states 0 times.
[2024-05-03 02:56:17,291 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-05-03 02:56:17,293 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-05-03 02:56:17,295 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-05-03 02:56:17,296 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-05-03 02:56:17,340 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1]
[2024-05-03 02:56:17,342 INFO  L308   ceAbstractionStarter]: Result for error location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/8)
[2024-05-03 02:56:17,347 INFO  L103   denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-05-03 02:56:17,347 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2024-05-03 02:56:17,347 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-05-03 02:56:17,389 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null)
[2024-05-03 02:56:17,390 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process
[2024-05-03 02:56:17,412 INFO  L166   artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2024-05-03 02:56:17,412 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ========
[2024-05-03 02:56:17,413 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7dedc475, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-05-03 02:56:17,413 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-05-03 02:56:17,414 INFO  L199   cStratifiedReduction]: Start building reduction automaton
[2024-05-03 02:56:17,436 INFO  L211   cStratifiedReduction]: Finished building reduction automaton with 170 states.
[2024-05-03 02:56:17,437 INFO  L212   cStratifiedReduction]: Copied states 0 times.
[2024-05-03 02:56:17,437 INFO  L78                 Accepts]: Start accepts. Automaton has currently 173 states, but on-demand construction may add more states Word has length 102
[2024-05-03 02:56:17,437 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2024-05-03 02:56:17,437 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-05-03 02:56:17,438 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-03 02:56:17,438 INFO  L85        PathProgramCache]: Analyzing trace with hash -1775666171, now seen corresponding path program 1 times
[2024-05-03 02:56:17,438 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-03 02:56:17,438 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134909190]
[2024-05-03 02:56:17,438 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-03 02:56:17,438 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-03 02:56:17,499 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-03 02:56:17,808 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-03 02:56:17,809 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-03 02:56:17,809 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134909190]
[2024-05-03 02:56:17,809 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134909190] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-03 02:56:17,809 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-03 02:56:17,809 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-05-03 02:56:17,809 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387437814]
[2024-05-03 02:56:17,809 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-03 02:56:17,810 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-05-03 02:56:17,810 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-03 02:56:17,810 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-05-03 02:56:17,811 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-05-03 02:56:17,811 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-05-03 02:56:17,811 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-05-03 02:56:17,813 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 2 states have (on average 51.0) internal successors, (102), 3 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-03 02:56:17,813 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-05-03 02:56:17,813 INFO  L199   cStratifiedReduction]: Start building reduction automaton
[2024-05-03 02:56:20,167 INFO  L211   cStratifiedReduction]: Finished building reduction automaton with 290 states.
[2024-05-03 02:56:20,167 INFO  L212   cStratifiedReduction]: Copied states 0 times.
[2024-05-03 02:56:20,168 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-05-03 02:56:20,168 INFO  L78                 Accepts]: Start accepts. Automaton has currently 291 states, but on-demand construction may add more states Word has length 98
[2024-05-03 02:56:20,168 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2024-05-03 02:56:20,169 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-05-03 02:56:20,169 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-05-03 02:56:20,169 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-03 02:56:20,169 INFO  L85        PathProgramCache]: Analyzing trace with hash -181342207, now seen corresponding path program 1 times
[2024-05-03 02:56:20,170 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-03 02:56:20,170 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083044172]
[2024-05-03 02:56:20,170 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-03 02:56:20,170 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-03 02:56:20,208 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-03 02:56:21,412 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-03 02:56:21,413 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-03 02:56:21,413 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083044172]
[2024-05-03 02:56:21,413 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083044172] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-03 02:56:21,413 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-03 02:56:21,413 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16
[2024-05-03 02:56:21,413 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041323621]
[2024-05-03 02:56:21,413 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-03 02:56:21,414 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 17 states
[2024-05-03 02:56:21,414 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-03 02:56:21,415 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants.
[2024-05-03 02:56:21,415 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272
[2024-05-03 02:56:21,415 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-05-03 02:56:21,415 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-05-03 02:56:21,415 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 17 states, 16 states have (on average 6.125) internal successors, (98), 17 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-03 02:56:21,415 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2024-05-03 02:56:21,416 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-05-03 02:56:21,416 INFO  L199   cStratifiedReduction]: Start building reduction automaton
[2024-05-03 02:56:27,950 INFO  L211   cStratifiedReduction]: Finished building reduction automaton with 349 states.
[2024-05-03 02:56:27,950 INFO  L212   cStratifiedReduction]: Copied states 0 times.
[2024-05-03 02:56:27,951 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-05-03 02:56:27,951 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-05-03 02:56:27,951 INFO  L78                 Accepts]: Start accepts. Automaton has currently 356 states, but on-demand construction may add more states Word has length 98
[2024-05-03 02:56:27,955 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2024-05-03 02:56:27,955 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-05-03 02:56:27,955 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-05-03 02:56:27,956 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-03 02:56:27,956 INFO  L85        PathProgramCache]: Analyzing trace with hash 584837219, now seen corresponding path program 2 times
[2024-05-03 02:56:27,957 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-03 02:56:27,957 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115620219]
[2024-05-03 02:56:27,957 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-03 02:56:27,957 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-03 02:56:28,061 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-03 02:56:30,156 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-03 02:56:30,157 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-03 02:56:30,157 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115620219]
[2024-05-03 02:56:30,157 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115620219] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-03 02:56:30,157 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-03 02:56:30,157 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24
[2024-05-03 02:56:30,157 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415675723]
[2024-05-03 02:56:30,157 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-03 02:56:30,158 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2024-05-03 02:56:30,158 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-03 02:56:30,159 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2024-05-03 02:56:30,159 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600
[2024-05-03 02:56:30,159 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-05-03 02:56:30,159 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-05-03 02:56:30,160 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 24 states have (on average 4.083333333333333) internal successors, (98), 25 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-03 02:56:30,160 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. 
[2024-05-03 02:56:30,160 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. 
[2024-05-03 02:56:30,160 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-05-03 02:56:30,160 INFO  L199   cStratifiedReduction]: Start building reduction automaton
[2024-05-03 02:56:43,307 INFO  L211   cStratifiedReduction]: Finished building reduction automaton with 498 states.
[2024-05-03 02:56:43,308 INFO  L212   cStratifiedReduction]: Copied states 45 times.
[2024-05-03 02:56:43,308 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-05-03 02:56:43,314 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-05-03 02:56:43,316 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. 
[2024-05-03 02:56:43,316 INFO  L78                 Accepts]: Start accepts. Automaton has currently 494 states, but on-demand construction may add more states Word has length 98
[2024-05-03 02:56:43,318 INFO  L84                 Accepts]: Finished accepts. word is accepted.
[2024-05-03 02:56:43,318 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-05-03 02:56:43,318 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-05-03 02:56:43,319 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-05-03 02:56:43,319 INFO  L85        PathProgramCache]: Analyzing trace with hash -1319128989, now seen corresponding path program 3 times
[2024-05-03 02:56:43,319 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-03 02:56:43,319 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271577376]
[2024-05-03 02:56:43,319 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-03 02:56:43,319 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-03 02:56:43,397 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-05-03 02:56:43,398 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-05-03 02:56:43,434 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-05-03 02:56:43,481 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-05-03 02:56:43,481 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-05-03 02:56:43,482 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-05-03 02:56:43,482 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-05-03 02:56:43,489 INFO  L445         BasicCegarLoop]: Path program histogram: [3, 1]
[2024-05-03 02:56:43,490 INFO  L308   ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was UNSAFE (2/8)
[2024-05-03 02:56:43,492 INFO  L229   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-05-03 02:56:43,493 INFO  L179   ceAbstractionStarter]: Computing trace abstraction results
[2024-05-03 02:56:43,557 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.05 02:56:43 BasicIcfg
[2024-05-03 02:56:43,557 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-05-03 02:56:43,558 INFO  L158              Benchmark]: Toolchain (without parser) took 131398.35ms. Allocated memory was 296.7MB in the beginning and 977.3MB in the end (delta: 680.5MB). Free memory was 223.6MB in the beginning and 627.0MB in the end (delta: -403.5MB). Peak memory consumption was 277.6MB. Max. memory is 8.0GB.
[2024-05-03 02:56:43,558 INFO  L158              Benchmark]: CDTParser took 0.13ms. Allocated memory is still 296.7MB. Free memory is still 267.1MB. There was no memory consumed. Max. memory is 8.0GB.
[2024-05-03 02:56:43,558 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 1011.27ms. Allocated memory is still 296.7MB. Free memory was 223.6MB in the beginning and 232.4MB in the end (delta: -8.8MB). Peak memory consumption was 36.3MB. Max. memory is 8.0GB.
[2024-05-03 02:56:43,558 INFO  L158              Benchmark]: Boogie Procedure Inliner took 64.31ms. Allocated memory is still 296.7MB. Free memory was 232.4MB in the beginning and 228.7MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
[2024-05-03 02:56:43,558 INFO  L158              Benchmark]: Boogie Preprocessor took 44.28ms. Allocated memory is still 296.7MB. Free memory was 228.7MB in the beginning and 226.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
[2024-05-03 02:56:43,559 INFO  L158              Benchmark]: RCFGBuilder took 595.37ms. Allocated memory is still 296.7MB. Free memory was 226.1MB in the beginning and 195.1MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB.
[2024-05-03 02:56:43,559 INFO  L158              Benchmark]: TraceAbstraction took 129677.17ms. Allocated memory was 296.7MB in the beginning and 977.3MB in the end (delta: 680.5MB). Free memory was 194.1MB in the beginning and 627.0MB in the end (delta: -433.0MB). Peak memory consumption was 248.6MB. Max. memory is 8.0GB.
[2024-05-03 02:56:43,560 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.13ms. Allocated memory is still 296.7MB. Free memory is still 267.1MB. There was no memory consumed. Max. memory is 8.0GB.
 * CACSL2BoogieTranslator took 1011.27ms. Allocated memory is still 296.7MB. Free memory was 223.6MB in the beginning and 232.4MB in the end (delta: -8.8MB). Peak memory consumption was 36.3MB. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 64.31ms. Allocated memory is still 296.7MB. Free memory was 232.4MB in the beginning and 228.7MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 44.28ms. Allocated memory is still 296.7MB. Free memory was 228.7MB in the beginning and 226.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
 * RCFGBuilder took 595.37ms. Allocated memory is still 296.7MB. Free memory was 226.1MB in the beginning and 195.1MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB.
 * TraceAbstraction took 129677.17ms. Allocated memory was 296.7MB in the beginning and 977.3MB in the end (delta: 680.5MB). Free memory was 194.1MB in the beginning and 627.0MB in the end (delta: -433.0MB). Peak memory consumption was 248.6MB. Max. memory is 8.0GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: Independence relation #1 benchmarks
    ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 29299, independent: 29106, independent conditional: 29106, independent unconditional: 0, dependent: 175, dependent conditional: 175, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29215, independent: 29106, independent conditional: 29106, independent unconditional: 0, dependent: 91, dependent conditional: 91, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 29215, independent: 29106, independent conditional: 29106, independent unconditional: 0, dependent: 91, dependent conditional: 91, dependent unconditional: 0, unknown: 18, unknown conditional: 18, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29376, independent: 29106, independent conditional: 0, independent unconditional: 29106, dependent: 218, dependent conditional: 127, dependent unconditional: 91, unknown: 52, unknown conditional: 34, unknown unconditional: 18] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 29376, independent: 29106, independent conditional: 0, independent unconditional: 29106, dependent: 218, dependent conditional: 0, dependent unconditional: 218, unknown: 52, unknown conditional: 0, unknown unconditional: 52] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 29376, independent: 29106, independent conditional: 0, independent unconditional: 29106, dependent: 218, dependent conditional: 0, dependent unconditional: 218, unknown: 52, unknown conditional: 0, unknown unconditional: 52] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 29215, independent: 29106, independent conditional: 0, independent unconditional: 29106, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 29215, independent: 29072, independent conditional: 0, independent unconditional: 29072, dependent: 143, dependent conditional: 0, dependent unconditional: 143, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 143, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 143, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 143, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 18, unknown conditional: 0, unknown unconditional: 18] , SemanticIndependenceRelation.Query Time [ms]: [ total: 88162, independent: 495, independent conditional: 0, independent unconditional: 495, dependent: 68934, dependent conditional: 0, dependent unconditional: 68934, unknown: 18732, unknown conditional: 0, unknown unconditional: 18732] , Protected Queries: 0 ], Cache Queries: [ total: 29376, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 29249, unknown conditional: 0, unknown unconditional: 29249] , Statistics on independence cache: Total cache size (in pairs): 29197, Positive cache size: 29106, Positive conditional cache size: 0, Positive unconditional cache size: 29106, Negative cache size: 91, Negative conditional cache size: 0, Negative unconditional cache size: 91, Unknown cache size: 18, Unknown conditional cache size: 0, Unknown unconditional cache size: 18, Eliminated conditions: 161, Maximal queried relation: 2, Independence queries for same thread: 84
  - StatisticsResult: Reduction benchmarks
    34.1ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 61, Duplicate States: 0, Protected Variables: 0
  - StatisticsResult: Reduction benchmarks
    50723.8ms Time before loop, 0.0ms Time in loop, 50.7s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 10433, Duplicate States: 0, Protected Variables: 6
  - StatisticsResult: Reduction benchmarks
    51406.8ms Time before loop, 0.0ms Time in loop, 51.4s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 5591, Duplicate States: 0, Protected Variables: 9
  - StatisticsResult: Visitor Statistics
    States: 61, Transitions: 60, Traversal time: 0.0s
  - StatisticsResult: Visitor Statistics
    States: 10368, Transitions: 10447, Traversal time: 50.7s
  - StatisticsResult: Visitor Statistics
    States: 5587, Transitions: 5661, Traversal time: 51.4s
  - StatisticsResult: Proof manager benchmarks
    IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 10, Times there's more than one choice: 2, Avg number of choices: 1.2
  - StatisticsResult: Independence relation #1 benchmarks
    ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 568, independent: 536, independent conditional: 536, independent unconditional: 0, dependent: 24, dependent conditional: 24, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 564, independent: 536, independent conditional: 536, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 564, independent: 536, independent conditional: 536, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 632, independent: 536, independent conditional: 0, independent unconditional: 536, dependent: 69, dependent conditional: 49, dependent unconditional: 20, unknown: 27, unknown conditional: 19, unknown unconditional: 8] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 632, independent: 536, independent conditional: 0, independent unconditional: 536, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 27, unknown conditional: 0, unknown unconditional: 27] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 632, independent: 536, independent conditional: 0, independent unconditional: 536, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 27, unknown conditional: 0, unknown unconditional: 27] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 564, independent: 536, independent conditional: 0, independent unconditional: 536, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 564, independent: 530, independent conditional: 0, independent unconditional: 530, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 34, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 34, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , SemanticIndependenceRelation.Query Time [ms]: [ total: 18329, independent: 81, independent conditional: 0, independent unconditional: 81, dependent: 9770, dependent conditional: 0, dependent unconditional: 9770, unknown: 8477, unknown conditional: 0, unknown unconditional: 8477] , Protected Queries: 0 ], Cache Queries: [ total: 632, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 583, unknown conditional: 0, unknown unconditional: 583] , Statistics on independence cache: Total cache size (in pairs): 556, Positive cache size: 536, Positive conditional cache size: 0, Positive unconditional cache size: 536, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 8, Unknown conditional cache size: 0, Unknown unconditional cache size: 8, Eliminated conditions: 68, Maximal queried relation: 3, Independence queries for same thread: 4
  - StatisticsResult: Reduction benchmarks
    22.6ms Time before loop, 0.0ms Time in loop, 0.0s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 170, Duplicate States: 0, Protected Variables: 0
  - StatisticsResult: Reduction benchmarks
    2352.8ms Time before loop, 0.0ms Time in loop, 2.4s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 290, Duplicate States: 0, Protected Variables: 3
  - StatisticsResult: Reduction benchmarks
    6534.0ms Time before loop, 0.0ms Time in loop, 6.5s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 349, Duplicate States: 0, Protected Variables: 25
  - StatisticsResult: Reduction benchmarks
    13146.9ms Time before loop, 0.0ms Time in loop, 13.1s Time in total, Has Loop: 0, wrong guesses: 0, overall guesses: 0, Reduction States: 498, Duplicate States: 45, Protected Variables: 38
  - StatisticsResult: Visitor Statistics
    States: 117, Transitions: 116, Traversal time: 0.0s
  - StatisticsResult: Visitor Statistics
    States: 233, Transitions: 240, Traversal time: 2.4s
  - StatisticsResult: Visitor Statistics
    States: 291, Transitions: 306, Traversal time: 6.5s
  - StatisticsResult: Visitor Statistics
    States: 438, Transitions: 473, Traversal time: 13.1s
  - StatisticsResult: Proof manager benchmarks
    IrresponsibleProofs: 1, RedundantProofs: 1, ProvenStates: 36, Times there's more than one choice: 27, Avg number of choices: 2.2222222222222223
  - PositiveResult [Line: 1675]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - CounterExampleResult [Line: 1675]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L1676]               0  pthread_t t1,t2;
         VAL             [t1={3:0}, t2={4:0}]
[L1745]  CALL, EXPR   0  my_drv_init()
[L1739]               0  return 0;
         VAL             [\result=0, t1={3:0}, t2={4:0}]
[L1745]  RET, EXPR    0  my_drv_init()
[L1745]               0  int ret = my_drv_init();
         VAL             [ret=0, t1={3:0}, t2={4:0}]
[L1746]  COND TRUE    0  ret==0
         VAL             [ret=0, t1={3:0}, t2={4:0}]
[L1747]               0  int probe_ret;
         VAL             [ret=0, t1={3:0}, t2={4:0}]
[L1748]               0  struct my_data data;
         VAL             [data={6:0}, ret=0, t1={3:0}, t2={4:0}]
[L1749]  CALL, EXPR   0  my_drv_probe(&data)
[L1706]               0  struct device *d = &data->dev;
         VAL             [d={6:24}, data={6:0}, data={6:0}, t1={3:0}, t2={4:0}]
[L1708]               0  data->shared.a = 0
         VAL             [d={6:24}, data={6:0}, data={6:0}, t1={3:0}, t2={4:0}]
[L1709]               0  data->shared.b = 0
         VAL             [d={6:24}, data={6:0}, data={6:0}, t1={3:0}, t2={4:0}]
[L1710]               0  int res = __VERIFIER_nondet_int();
         VAL             [d={6:24}, data={6:0}, data={6:0}, res=0, t1={3:0}, t2={4:0}]
[L1711]  COND FALSE   0  !(\read(res))
         VAL             [d={6:24}, data={6:0}, data={6:0}, res=0, t1={3:0}, t2={4:0}]
[L1713]  FCALL, FORK  0  pthread_create(&t1, ((void *)0), my_callback, (void *)d)
         VAL             [arg={6:24}, d={6:24}, data={6:0}, data={6:0}, res=0, t1={3:0}, t2={4:0}]
[L1714]  FCALL, FORK  0  pthread_create(&t2, ((void *)0), my_callback, (void *)d)
         VAL             [arg={6:24}, d={6:24}, data={6:0}, data={6:0}, res=0, t1={3:0}, t2={4:0}]
[L1715]               0  return 0;
         VAL             [\result=0, arg={6:24}, d={6:24}, data={6:0}, data={6:0}, res=0, t1={3:0}, t2={4:0}]
[L1749]  RET, EXPR    0  my_drv_probe(&data)
[L1749]               0  probe_ret = my_drv_probe(&data)
         VAL             [arg={6:24}, data={6:0}, probe_ret=0, ret=0, t1={3:0}, t2={4:0}]
[L1750]  COND TRUE    0  probe_ret==0
[L1751]  CALL         0  my_drv_disconnect(&data)
[L1721]               0  void *status;
         VAL             [arg={6:24}, data={6:0}, data={6:0}, status={5:0}, t1={3:0}, t2={4:0}]
[L1722]               0  \read(t1)
         VAL             [arg={6:24}, data={6:0}, data={6:0}, status={5:0}, t1={3:0}, t2={4:0}]
[L1689]               2  struct device *dev = (struct device*)arg;
         VAL             [arg={6:24}, arg={6:24}, dev={6:24}, t1={3:0}, t2={4:0}]
[L1690]               2  struct my_data *data;
         VAL             [arg={6:24}, arg={6:24}, dev={6:24}, t1={3:0}, t2={4:0}]
[L1691]               2  const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev);
         VAL             [__mptr={6:24}, arg={6:24}, arg={6:24}, dev={6:24}, t1={3:0}, t2={4:0}]
[L1691]               2  { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}
         VAL             [__mptr={6:24}, arg={6:24}, arg={6:24}, dev={6:24}, t1={3:0}, t2={4:0}]
[L1691]               2  { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}
         VAL             [arg={6:24}, arg={6:24}, dev={6:24}, t1={3:0}, t2={4:0}]
[L1691]               2  data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );})
         VAL             [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={3:0}, t2={4:0}]
[L1689]               1  struct device *dev = (struct device*)arg;
         VAL             [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={3:0}, t2={4:0}]
[L1690]               1  struct my_data *data;
         VAL             [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={3:0}, t2={4:0}]
[L1691]               1  const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev);
         VAL             [__mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={3:0}, t2={4:0}]
[L1691]               1  { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}
         VAL             [__mptr={6:24}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={3:0}, t2={4:0}]
[L1691]               1  { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}
         VAL             [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={3:0}, t2={4:0}]
[L1691]               1  data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );})
         VAL             [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={3:0}, t2={4:0}]
[L1694]               1  data->shared.a = 1
         VAL             [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1={3:0}, t2={4:0}]
[L1697]  EXPR         1  data->shared.b
[L1697]               1  int lb = data->shared.b;
[L1700]               1  data->shared.b = lb + 1
         VAL             [arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}]
[L1703]               1  return 0;
         VAL             [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}]
[L1722]  FCALL, JOIN  1  pthread_join(t1, &status)
         VAL             [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1={3:0}, t2={4:0}]
[L1724]               0  data->shared.a = 3
         VAL             [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1={3:0}, t2={4:0}]
[L1727]               0  data->shared.b = 3
         VAL             [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1={3:0}, t2={4:0}]
[L1694]               2  data->shared.a = 1
         VAL             [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1={3:0}, t2={4:0}]
[L1697]  EXPR         2  data->shared.b
[L1697]               2  int lb = data->shared.b;
[L1700]               2  data->shared.b = lb + 1
         VAL             [\result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=3, t1={3:0}, t2={4:0}]
[L1730]  EXPR         0  data->shared.a
[L1730]  CALL         0  ldv_assert(data->shared.a==3)
[L1675]  COND TRUE    0  !expression
[L1675]               0  reach_error()
         VAL             [\old(expression)=0, \result={0:0}, arg={6:24}, arg={6:24}, data={6:0}, dev={6:24}, expression=0, lb=3, t1={3:0}, t2={4:0}]

  - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances
    CFG has 4 procedures, 193 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 103.3s, OverallIterations: 2, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 102.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 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.7s InterpolantComputationTime, 131 NumberOfCodeBlocks, 131 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 176 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances
    CFG has 4 procedures, 193 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 26.1s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 22.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 396 NumberOfCodeBlocks, 396 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 295 ConstructedInterpolants, 0 QuantifiedInterpolants, 2381 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-03 02:56:43,604 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0
[2024-05-03 02:56:43,828 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-03 02:56:43,998 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...