/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/pthread-C-DAC/pthread-demo-datarace-3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 14:40:52,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 14:40:53,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-30 14:40:53,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 14:40:53,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 14:40:53,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-30 14:40:53,074 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 14:40:53,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 14:40:53,075 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 14:40:53,079 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 14:40:53,079 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 14:40:53,079 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 14:40:53,079 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 14:40:53,081 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 14:40:53,081 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 14:40:53,081 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 14:40:53,081 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 14:40:53,081 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 14:40:53,082 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 14:40:53,082 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 14:40:53,082 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 14:40:53,082 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 14:40:53,082 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 14:40:53,082 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 14:40:53,083 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 14:40:53,083 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 14:40:53,083 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 14:40:53,083 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 14:40:53,083 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 14:40:53,083 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 14:40:53,084 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 14:40:53,085 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 14:40:53,085 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 14:40:53,085 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-30 14:40:53,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 14:40:53,085 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 14:40:53,085 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-30 14:40:53,085 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-30 14:40:53,085 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 14:40:53,085 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 14:40:53,086 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 14:40:53,086 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 14:40:53,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 14:40:53,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 14:40:53,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 14:40:53,276 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 14:40:53,277 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 14:40:53,278 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i [2024-05-30 14:40:54,444 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 14:40:54,691 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 14:40:54,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i [2024-05-30 14:40:54,715 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0f462f8a7/31e3eb33bc6b4431bfb5e5a6eafd5435/FLAGa8879d000 [2024-05-30 14:40:54,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0f462f8a7/31e3eb33bc6b4431bfb5e5a6eafd5435 [2024-05-30 14:40:54,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 14:40:54,734 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 14:40:54,734 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 14:40:54,735 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 14:40:54,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 14:40:54,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 02:40:54" (1/1) ... [2024-05-30 14:40:54,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64cd6018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:40:54, skipping insertion in model container [2024-05-30 14:40:54,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 02:40:54" (1/1) ... [2024-05-30 14:40:54,783 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 14:40:54,914 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i[818,831] [2024-05-30 14:40:55,199 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 14:40:55,207 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 14:40:55,253 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i[818,831] [2024-05-30 14:40:55,276 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 14:40:55,332 INFO L206 MainTranslator]: Completed translation [2024-05-30 14:40:55,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:40:55 WrapperNode [2024-05-30 14:40:55,333 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 14:40:55,334 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 14:40:55,334 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 14:40:55,334 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 14:40:55,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:40:55" (1/1) ... [2024-05-30 14:40:55,353 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:40:55" (1/1) ... [2024-05-30 14:40:55,372 INFO L138 Inliner]: procedures = 365, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2024-05-30 14:40:55,373 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 14:40:55,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 14:40:55,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 14:40:55,373 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 14:40:55,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:40:55" (1/1) ... [2024-05-30 14:40:55,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:40:55" (1/1) ... [2024-05-30 14:40:55,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:40:55" (1/1) ... [2024-05-30 14:40:55,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:40:55" (1/1) ... [2024-05-30 14:40:55,389 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:40:55" (1/1) ... [2024-05-30 14:40:55,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:40:55" (1/1) ... [2024-05-30 14:40:55,403 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:40:55" (1/1) ... [2024-05-30 14:40:55,404 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:40:55" (1/1) ... [2024-05-30 14:40:55,405 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 14:40:55,406 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 14:40:55,406 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 14:40:55,406 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 14:40:55,407 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:40:55" (1/1) ... [2024-05-30 14:40:55,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 14:40:55,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:40:55,435 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 14:40:55,453 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 14:40:55,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-30 14:40:55,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 14:40:55,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 14:40:55,474 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-30 14:40:55,474 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-30 14:40:55,474 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2024-05-30 14:40:55,474 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2024-05-30 14:40:55,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 14:40:55,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 14:40:55,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 14:40:55,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 14:40:55,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 14:40:55,475 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 14:40:55,626 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 14:40:55,627 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 14:40:55,775 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 14:40:55,783 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 14:40:55,783 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-05-30 14:40:55,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 02:40:55 BoogieIcfgContainer [2024-05-30 14:40:55,783 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 14:40:55,785 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 14:40:55,785 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 14:40:55,787 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 14:40:55,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 02:40:54" (1/3) ... [2024-05-30 14:40:55,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a02fd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 02:40:55, skipping insertion in model container [2024-05-30 14:40:55,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 02:40:55" (2/3) ... [2024-05-30 14:40:55,789 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a02fd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 02:40:55, skipping insertion in model container [2024-05-30 14:40:55,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 02:40:55" (3/3) ... [2024-05-30 14:40:55,791 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2024-05-30 14:40:55,798 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 14:40:55,805 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 14:40:55,806 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-30 14:40:55,807 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 14:40:55,859 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-05-30 14:40:55,891 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:40:55,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 14:40:55,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:40:55,894 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 14:40:55,925 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 14:40:55,958 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 14:40:55,966 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 14:40:55,972 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;@6a4f2a9e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 14:40:55,972 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 14:40:55,978 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:40:56,061 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:56,061 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:40:56,061 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 14:40:56,079 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:56,080 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:40:56,080 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 14:40:56,099 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:56,099 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:40:56,099 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 14:40:56,117 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:56,117 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:40:56,117 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 14:40:56,122 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 136 states. [2024-05-30 14:40:56,122 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:40:56,125 INFO L78 Accepts]: Start accepts. Automaton has currently 151 states, but on-demand construction may add more states Word has length 54 [2024-05-30 14:40:56,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:40:56,128 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:40:56,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:40:56,132 INFO L85 PathProgramCache]: Analyzing trace with hash -269045930, now seen corresponding path program 1 times [2024-05-30 14:40:56,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:40:56,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647967330] [2024-05-30 14:40:56,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:40:56,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:40:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:40:56,324 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 14:40:56,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:40:56,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647967330] [2024-05-30 14:40:56,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647967330] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:40:56,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:40:56,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 14:40:56,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821843549] [2024-05-30 14:40:56,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:40:56,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 14:40:56,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:40:56,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 14:40:56,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 14:40:56,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:40:56,359 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:40:56,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 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 14:40:56,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:40:56,362 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:40:56,410 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:56,410 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:40:56,410 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 14:40:56,438 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:56,439 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:40:56,439 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 14:40:56,492 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:56,493 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:40:56,493 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 14:40:56,503 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:56,504 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:40:56,504 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 14:40:56,518 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:56,518 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:40:56,518 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 14:40:56,538 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:56,539 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:40:56,539 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 14:40:56,562 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:56,562 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:40:56,562 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 14:40:56,571 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 187 states. [2024-05-30 14:40:56,571 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:40:56,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:40:56,572 INFO L78 Accepts]: Start accepts. Automaton has currently 215 states, but on-demand construction may add more states Word has length 52 [2024-05-30 14:40:56,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:40:56,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 14:40:56,574 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:40:56,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:40:56,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1827092512, now seen corresponding path program 1 times [2024-05-30 14:40:56,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:40:56,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765125126] [2024-05-30 14:40:56,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:40:56,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:40:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:40:56,690 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 14:40:56,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:40:56,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765125126] [2024-05-30 14:40:56,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765125126] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:40:56,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 14:40:56,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-30 14:40:56,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499823700] [2024-05-30 14:40:56,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:40:56,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-30 14:40:56,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:40:56,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-30 14:40:56,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-30 14:40:56,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:40:56,693 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:40:56,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 14:40:56,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:40:56,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:40:56,694 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:40:56,712 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:56,712 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:40:56,713 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 14:40:56,725 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:56,725 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:40:56,725 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 14:40:56,733 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:56,734 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:40:56,734 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 14:40:56,786 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:56,786 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:40:56,786 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 14:40:56,797 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:56,797 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:40:56,797 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 14:40:56,804 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:56,804 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:40:56,804 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 14:40:56,813 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 182 states. [2024-05-30 14:40:56,824 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 14:40:56,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:40:56,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:40:56,825 INFO L78 Accepts]: Start accepts. Automaton has currently 210 states, but on-demand construction may add more states Word has length 57 [2024-05-30 14:40:56,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:40:56,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-30 14:40:56,826 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:40:56,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:40:56,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1766357784, now seen corresponding path program 1 times [2024-05-30 14:40:56,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:40:56,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060579115] [2024-05-30 14:40:56,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:40:56,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:40:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:40:56,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 14:40:56,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:40:57,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060579115] [2024-05-30 14:40:57,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060579115] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 14:40:57,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726689978] [2024-05-30 14:40:57,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:40:57,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 14:40:57,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:40:57,035 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 14:40:57,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-05-30 14:40:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:40:57,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2024-05-30 14:40:57,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 14:40:57,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 14:40:57,162 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-30 14:40:57,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726689978] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 14:40:57,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-30 14:40:57,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-05-30 14:40:57,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207649372] [2024-05-30 14:40:57,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 14:40:57,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-30 14:40:57,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:40:57,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-30 14:40:57,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-30 14:40:57,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:40:57,163 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:40:57,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 14:40:57,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:40:57,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:40:57,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:40:57,164 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:40:57,178 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:57,178 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:40:57,179 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 14:40:57,183 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:57,183 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:57,183 INFO L395 cStratifiedReduction]: Actual level: [thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:57,189 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:57,189 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:57,189 INFO L395 cStratifiedReduction]: Actual level: [thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:57,199 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:57,199 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:40:57,199 INFO L395 cStratifiedReduction]: Actual level: [thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:57,204 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:57,204 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:57,204 INFO L395 cStratifiedReduction]: Actual level: [thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:57,211 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:57,212 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:57,212 INFO L395 cStratifiedReduction]: Actual level: [thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:57,221 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:57,222 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:57,222 INFO L395 cStratifiedReduction]: Actual level: [thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:57,228 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 248 states. [2024-05-30 14:40:57,229 INFO L212 cStratifiedReduction]: Copied states 10 times. [2024-05-30 14:40:57,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:40:57,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:40:57,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:40:57,229 INFO L78 Accepts]: Start accepts. Automaton has currently 273 states, but on-demand construction may add more states Word has length 65 [2024-05-30 14:40:57,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:40:57,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-05-30 14:40:57,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-05-30 14:40:57,436 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:40:57,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:40:57,437 INFO L85 PathProgramCache]: Analyzing trace with hash -916844975, now seen corresponding path program 1 times [2024-05-30 14:40:57,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:40:57,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966023770] [2024-05-30 14:40:57,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:40:57,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:40:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:40:57,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 14:40:57,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:40:57,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966023770] [2024-05-30 14:40:57,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966023770] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 14:40:57,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440031303] [2024-05-30 14:40:57,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:40:57,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 14:40:57,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:40:57,538 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 14:40:57,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-05-30 14:40:57,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:40:57,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-30 14:40:57,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 14:40:57,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 14:40:57,676 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 14:40:57,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 14:40:57,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440031303] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 14:40:57,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 14:40:57,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-05-30 14:40:57,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134758238] [2024-05-30 14:40:57,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 14:40:57,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-30 14:40:57,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:40:57,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-30 14:40:57,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-05-30 14:40:57,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:40:57,715 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:40:57,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 14:40:57,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:40:57,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:40:57,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:40:57,715 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:40:57,715 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:40:57,729 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:57,729 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:40:57,729 INFO L395 cStratifiedReduction]: Actual level: [thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:57,731 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:57,731 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:57,731 INFO L395 cStratifiedReduction]: Actual level: [thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:57,737 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:57,737 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:57,738 INFO L395 cStratifiedReduction]: Actual level: [thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:57,750 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:57,751 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:57,751 INFO L395 cStratifiedReduction]: Actual level: [thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:57,815 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 197 states. [2024-05-30 14:40:57,816 INFO L212 cStratifiedReduction]: Copied states 10 times. [2024-05-30 14:40:57,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:40:57,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:40:57,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:40:57,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 14:40:57,822 INFO L78 Accepts]: Start accepts. Automaton has currently 202 states, but on-demand construction may add more states Word has length 75 [2024-05-30 14:40:57,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:40:57,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-05-30 14:40:58,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 14:40:58,030 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:40:58,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:40:58,031 INFO L85 PathProgramCache]: Analyzing trace with hash -539831471, now seen corresponding path program 2 times [2024-05-30 14:40:58,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:40:58,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351308722] [2024-05-30 14:40:58,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:40:58,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:40:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:40:58,099 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-05-30 14:40:58,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:40:58,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351308722] [2024-05-30 14:40:58,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351308722] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 14:40:58,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659789170] [2024-05-30 14:40:58,100 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 14:40:58,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 14:40:58,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:40:58,114 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 14:40:58,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-05-30 14:40:58,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 14:40:58,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 14:40:58,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-30 14:40:58,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 14:40:58,263 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 14:40:58,263 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 14:40:58,345 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-05-30 14:40:58,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659789170] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 14:40:58,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 14:40:58,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2024-05-30 14:40:58,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905576582] [2024-05-30 14:40:58,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 14:40:58,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-05-30 14:40:58,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:40:58,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-05-30 14:40:58,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2024-05-30 14:40:58,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:40:58,347 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:40:58,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.947368421052632) internal successors, (113), 19 states have internal predecessors, (113), 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 14:40:58,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:40:58,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:40:58,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:40:58,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 14:40:58,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:40:58,348 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:40:58,394 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:58,394 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:40:58,394 INFO L395 cStratifiedReduction]: Actual level: [thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:58,397 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:58,397 INFO L394 cStratifiedReduction]: Guessed abstraction level: [thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:58,397 INFO L395 cStratifiedReduction]: Actual level: [thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:58,403 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:58,403 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:58,403 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:58,409 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:58,409 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:58,409 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:58,581 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 274 states. [2024-05-30 14:40:58,581 INFO L212 cStratifiedReduction]: Copied states 10 times. [2024-05-30 14:40:58,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:40:58,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:40:58,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:40:58,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 14:40:58,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-30 14:40:58,582 INFO L78 Accepts]: Start accepts. Automaton has currently 279 states, but on-demand construction may add more states Word has length 103 [2024-05-30 14:40:58,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:40:58,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-30 14:40:58,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 14:40:58,791 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:40:58,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:40:58,792 INFO L85 PathProgramCache]: Analyzing trace with hash -766908534, now seen corresponding path program 3 times [2024-05-30 14:40:58,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:40:58,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651216461] [2024-05-30 14:40:58,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:40:58,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:40:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:40:59,065 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-30 14:40:59,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:40:59,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651216461] [2024-05-30 14:40:59,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651216461] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 14:40:59,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650740434] [2024-05-30 14:40:59,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 14:40:59,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 14:40:59,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:40:59,067 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 14:40:59,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-05-30 14:40:59,130 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-05-30 14:40:59,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 14:40:59,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-30 14:40:59,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 14:40:59,201 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-05-30 14:40:59,201 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 14:40:59,276 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-05-30 14:40:59,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650740434] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 14:40:59,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 14:40:59,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 7] total 27 [2024-05-30 14:40:59,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194902784] [2024-05-30 14:40:59,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 14:40:59,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-05-30 14:40:59,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:40:59,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-05-30 14:40:59,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2024-05-30 14:40:59,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:40:59,279 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:40:59,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.2592592592592595) internal successors, (142), 27 states have internal predecessors, (142), 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 14:40:59,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:40:59,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:40:59,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:40:59,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 14:40:59,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-05-30 14:40:59,279 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:40:59,279 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:40:59,412 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:59,413 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:40:59,413 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:59,414 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:59,415 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:59,415 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:59,423 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:59,423 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:59,423 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:59,430 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:59,430 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:59,430 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:59,679 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:59,679 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:40:59,679 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:59,682 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:59,682 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:59,682 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:59,700 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:59,700 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:59,700 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:59,713 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:40:59,713 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:59,713 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:40:59,720 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 527 states. [2024-05-30 14:40:59,720 INFO L212 cStratifiedReduction]: Copied states 20 times. [2024-05-30 14:40:59,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:40:59,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:40:59,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:40:59,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 14:40:59,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 14:40:59,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 14:40:59,721 INFO L78 Accepts]: Start accepts. Automaton has currently 568 states, but on-demand construction may add more states Word has length 132 [2024-05-30 14:40:59,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:40:59,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-05-30 14:40:59,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-05-30 14:40:59,928 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:40:59,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:40:59,928 INFO L85 PathProgramCache]: Analyzing trace with hash 518554173, now seen corresponding path program 4 times [2024-05-30 14:40:59,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:40:59,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918871014] [2024-05-30 14:40:59,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:40:59,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:40:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:41:00,244 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-05-30 14:41:00,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:41:00,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918871014] [2024-05-30 14:41:00,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918871014] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 14:41:00,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098366546] [2024-05-30 14:41:00,244 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 14:41:00,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 14:41:00,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:41:00,245 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 14:41:00,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-05-30 14:41:00,378 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 14:41:00,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 14:41:00,379 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-30 14:41:00,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 14:41:00,455 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-05-30 14:41:00,456 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 14:41:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-05-30 14:41:00,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098366546] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 14:41:00,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 14:41:00,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 38 [2024-05-30 14:41:00,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301517757] [2024-05-30 14:41:00,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 14:41:00,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-05-30 14:41:00,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:41:00,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-05-30 14:41:00,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=1026, Unknown=0, NotChecked=0, Total=1406 [2024-05-30 14:41:00,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:41:00,712 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:41:00,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.8684210526315788) internal successors, (147), 38 states have internal predecessors, (147), 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 14:41:00,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:41:00,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:41:00,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:41:00,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 14:41:00,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-30 14:41:00,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 14:41:00,712 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:41:00,712 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:41:00,731 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:41:00,731 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:41:00,731 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:00,733 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:41:00,733 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:00,733 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:00,740 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:41:00,740 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:00,741 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:00,747 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:41:00,748 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:00,748 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:01,326 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 452 states. [2024-05-30 14:41:01,326 INFO L212 cStratifiedReduction]: Copied states 10 times. [2024-05-30 14:41:01,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:41:01,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:41:01,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:41:01,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 14:41:01,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 14:41:01,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 14:41:01,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 14:41:01,327 INFO L78 Accepts]: Start accepts. Automaton has currently 457 states, but on-demand construction may add more states Word has length 177 [2024-05-30 14:41:01,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:41:01,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-05-30 14:41:01,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 14:41:01,534 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:41:01,534 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:41:01,534 INFO L85 PathProgramCache]: Analyzing trace with hash -838686411, now seen corresponding path program 5 times [2024-05-30 14:41:01,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:41:01,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986793128] [2024-05-30 14:41:01,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:41:01,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:41:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:41:02,153 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 697 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-05-30 14:41:02,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:41:02,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986793128] [2024-05-30 14:41:02,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986793128] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 14:41:02,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734366537] [2024-05-30 14:41:02,154 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-30 14:41:02,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 14:41:02,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:41:02,169 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 14:41:02,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-05-30 14:41:02,313 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2024-05-30 14:41:02,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 14:41:02,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 12 conjunts are in the unsatisfiable core [2024-05-30 14:41:02,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 14:41:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2024-05-30 14:41:02,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 14:41:02,831 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2024-05-30 14:41:02,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734366537] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 14:41:02,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 14:41:02,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13, 13] total 59 [2024-05-30 14:41:02,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797757456] [2024-05-30 14:41:02,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 14:41:02,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-05-30 14:41:02,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:41:02,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-05-30 14:41:02,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=2907, Unknown=0, NotChecked=0, Total=3422 [2024-05-30 14:41:02,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:41:02,835 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:41:02,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 4.067796610169491) internal successors, (240), 59 states have internal predecessors, (240), 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 14:41:02,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:41:02,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:41:02,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:41:02,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 14:41:02,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-30 14:41:02,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 14:41:02,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 14:41:02,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:41:02,835 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:41:03,322 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:41:03,322 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:41:03,322 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:03,324 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:41:03,324 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:03,324 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:03,339 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:41:03,340 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:03,340 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:03,358 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:41:03,358 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:03,358 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:04,253 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:41:04,253 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:41:04,253 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:04,259 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:41:04,260 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:04,260 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:04,280 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:41:04,280 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:04,280 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:04,303 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:41:04,303 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:04,303 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:04,311 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 972 states. [2024-05-30 14:41:04,312 INFO L212 cStratifiedReduction]: Copied states 20 times. [2024-05-30 14:41:04,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:41:04,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:41:04,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:41:04,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 14:41:04,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 14:41:04,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 14:41:04,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 14:41:04,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-05-30 14:41:04,312 INFO L78 Accepts]: Start accepts. Automaton has currently 1061 states, but on-demand construction may add more states Word has length 230 [2024-05-30 14:41:04,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:41:04,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-05-30 14:41:04,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-05-30 14:41:04,520 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:41:04,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:41:04,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1093732461, now seen corresponding path program 6 times [2024-05-30 14:41:04,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:41:04,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008281598] [2024-05-30 14:41:04,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:41:04,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:41:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:41:05,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1234 backedges. 0 proven. 783 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-05-30 14:41:05,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:41:05,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008281598] [2024-05-30 14:41:05,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008281598] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 14:41:05,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220568622] [2024-05-30 14:41:05,399 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-30 14:41:05,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 14:41:05,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:41:05,401 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 14:41:05,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-05-30 14:41:05,504 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2024-05-30 14:41:05,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 14:41:05,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 24 conjunts are in the unsatisfiable core [2024-05-30 14:41:05,508 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 14:41:06,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1234 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 783 trivial. 0 not checked. [2024-05-30 14:41:06,097 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 14:41:06,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1234 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 783 trivial. 0 not checked. [2024-05-30 14:41:06,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220568622] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 14:41:06,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 14:41:06,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 25, 25] total 78 [2024-05-30 14:41:06,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634502111] [2024-05-30 14:41:06,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 14:41:06,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2024-05-30 14:41:06,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:41:06,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2024-05-30 14:41:06,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=838, Invalid=5168, Unknown=0, NotChecked=0, Total=6006 [2024-05-30 14:41:06,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:41:06,829 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:41:06,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 4.064102564102564) internal successors, (317), 78 states have internal predecessors, (317), 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 14:41:06,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:41:06,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:41:06,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:41:06,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 14:41:06,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-30 14:41:06,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 14:41:06,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 14:41:06,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2024-05-30 14:41:06,830 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:41:06,830 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:41:08,041 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:41:08,041 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:41:08,042 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:08,043 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:41:08,043 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:08,043 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:08,074 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:41:08,074 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:08,074 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:08,108 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:41:08,108 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:08,108 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:09,090 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:41:09,090 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:41:09,091 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:09,093 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:41:09,093 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:09,093 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:09,125 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:41:09,125 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:09,125 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:09,165 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:41:09,165 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:09,166 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:09,176 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1494 states. [2024-05-30 14:41:09,176 INFO L212 cStratifiedReduction]: Copied states 20 times. [2024-05-30 14:41:09,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:41:09,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:41:09,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:41:09,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 14:41:09,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 14:41:09,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 14:41:09,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 14:41:09,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-05-30 14:41:09,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-05-30 14:41:09,177 INFO L78 Accepts]: Start accepts. Automaton has currently 1655 states, but on-demand construction may add more states Word has length 307 [2024-05-30 14:41:09,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:41:09,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-05-30 14:41:09,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 14:41:09,385 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:41:09,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:41:09,385 INFO L85 PathProgramCache]: Analyzing trace with hash -2009548148, now seen corresponding path program 7 times [2024-05-30 14:41:09,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:41:09,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125036614] [2024-05-30 14:41:09,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:41:09,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:41:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:41:10,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2414 backedges. 0 proven. 874 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-05-30 14:41:10,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 14:41:10,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125036614] [2024-05-30 14:41:10,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125036614] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 14:41:10,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964754985] [2024-05-30 14:41:10,281 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-05-30 14:41:10,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 14:41:10,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 14:41:10,282 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 14:41:10,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-05-30 14:41:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 14:41:10,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 40 conjunts are in the unsatisfiable core [2024-05-30 14:41:10,401 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 14:41:10,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2414 backedges. 0 proven. 874 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-05-30 14:41:10,519 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 14:41:11,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2414 backedges. 0 proven. 874 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-05-30 14:41:11,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964754985] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 14:41:11,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 14:41:11,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 43 [2024-05-30 14:41:11,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518422514] [2024-05-30 14:41:11,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 14:41:11,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-05-30 14:41:11,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 14:41:11,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-05-30 14:41:11,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2024-05-30 14:41:11,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:41:11,146 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 14:41:11,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.7209302325581395) internal successors, (160), 43 states have internal predecessors, (160), 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 14:41:11,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:41:11,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:41:11,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:41:11,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 14:41:11,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-30 14:41:11,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 14:41:11,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2024-05-30 14:41:11,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 85 states. [2024-05-30 14:41:11,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 115 states. [2024-05-30 14:41:11,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:41:11,147 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 14:41:11,183 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:41:11,183 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 14:41:11,183 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:11,185 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:41:11,185 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:11,185 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:11,208 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:41:11,208 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:11,208 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:11,231 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 14:41:11,232 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:11,232 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_main_~i~1#1, thread_function_dataraceThread1of1ForFork0_#t~post31, ULTIMATE.start_main_#t~post41#1, thread_function_dataraceThread1of1ForFork0_~i~0] [2024-05-30 14:41:11,929 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 973 states. [2024-05-30 14:41:11,929 INFO L212 cStratifiedReduction]: Copied states 10 times. [2024-05-30 14:41:11,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 14:41:11,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:41:11,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 14:41:11,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 14:41:11,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 14:41:11,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 14:41:11,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-30 14:41:11,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-05-30 14:41:11,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-05-30 14:41:11,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-05-30 14:41:11,930 INFO L78 Accepts]: Start accepts. Automaton has currently 978 states, but on-demand construction may add more states Word has length 312 [2024-05-30 14:41:11,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 14:41:11,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-05-30 14:41:12,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-05-30 14:41:12,138 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 14:41:12,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 14:41:12,138 INFO L85 PathProgramCache]: Analyzing trace with hash 836122772, now seen corresponding path program 8 times [2024-05-30 14:41:12,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 14:41:12,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272174829] [2024-05-30 14:41:12,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 14:41:12,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 14:41:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:41:12,213 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 14:41:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 14:41:12,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 14:41:12,329 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 14:41:12,330 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 14:41:12,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-30 14:41:12,339 INFO L445 BasicCegarLoop]: Path program histogram: [8, 1, 1, 1] [2024-05-30 14:41:12,340 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was UNSAFE (1/2) [2024-05-30 14:41:12,344 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-30 14:41:12,344 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-30 14:41:12,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.05 02:41:12 BasicIcfg [2024-05-30 14:41:12,458 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-30 14:41:12,459 INFO L158 Benchmark]: Toolchain (without parser) took 17725.05ms. Allocated memory was 304.1MB in the beginning and 578.8MB in the end (delta: 274.7MB). Free memory was 232.9MB in the beginning and 254.3MB in the end (delta: -21.4MB). Peak memory consumption was 254.1MB. Max. memory is 8.0GB. [2024-05-30 14:41:12,459 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 165.7MB. Free memory is still 131.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 14:41:12,459 INFO L158 Benchmark]: CACSL2BoogieTranslator took 598.58ms. Allocated memory is still 304.1MB. Free memory was 232.7MB in the beginning and 249.3MB in the end (delta: -16.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2024-05-30 14:41:12,459 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.06ms. Allocated memory is still 304.1MB. Free memory was 249.3MB in the beginning and 246.6MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-05-30 14:41:12,459 INFO L158 Benchmark]: Boogie Preprocessor took 32.49ms. Allocated memory is still 304.1MB. Free memory was 246.6MB in the beginning and 245.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-30 14:41:12,459 INFO L158 Benchmark]: RCFGBuilder took 377.17ms. Allocated memory is still 304.1MB. Free memory was 245.1MB in the beginning and 231.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-05-30 14:41:12,459 INFO L158 Benchmark]: TraceAbstraction took 16673.28ms. Allocated memory was 304.1MB in the beginning and 578.8MB in the end (delta: 274.7MB). Free memory was 229.9MB in the beginning and 254.3MB in the end (delta: -24.4MB). Peak memory consumption was 251.4MB. Max. memory is 8.0GB. [2024-05-30 14:41:12,461 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 165.7MB. Free memory is still 131.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 598.58ms. Allocated memory is still 304.1MB. Free memory was 232.7MB in the beginning and 249.3MB in the end (delta: -16.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.06ms. Allocated memory is still 304.1MB. Free memory was 249.3MB in the beginning and 246.6MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.49ms. Allocated memory is still 304.1MB. Free memory was 246.6MB in the beginning and 245.1MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 377.17ms. Allocated memory is still 304.1MB. Free memory was 245.1MB in the beginning and 231.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 16673.28ms. Allocated memory was 304.1MB in the beginning and 578.8MB in the end (delta: 274.7MB). Free memory was 229.9MB in the beginning and 254.3MB in the end (delta: -24.4MB). Peak memory consumption was 251.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3302, independent: 3188, independent conditional: 3188, independent unconditional: 0, dependent: 114, dependent conditional: 114, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3188, independent: 3188, independent conditional: 3188, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3188, independent: 3188, independent conditional: 3188, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3188, independent: 3188, independent conditional: 0, independent unconditional: 3188, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3188, independent: 3188, independent conditional: 0, independent unconditional: 3188, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3188, independent: 3188, independent conditional: 0, independent unconditional: 3188, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3188, independent: 3188, independent conditional: 0, independent unconditional: 3188, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3188, independent: 3188, independent conditional: 0, independent unconditional: 3188, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3188, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3188, unknown conditional: 0, unknown unconditional: 3188] , Statistics on independence cache: Total cache size (in pairs): 3188, Positive cache size: 3188, Positive conditional cache size: 0, Positive unconditional cache size: 3188, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 114 - StatisticsResult: Reduction benchmarks 26.8ms Time before loop, 117.0ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 6, Reduction States: 136, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 40.7ms Time before loop, 168.5ms Time in loop, 0.2s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 9, Reduction States: 187, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 16.2ms Time before loop, 101.6ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 8, Reduction States: 182, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 13.3ms Time before loop, 51.1ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 1, overall guesses: 9, Reduction States: 248, Duplicate States: 10, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 12.2ms Time before loop, 87.5ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 1, overall guesses: 6, Reduction States: 197, Duplicate States: 10, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 44.9ms Time before loop, 188.3ms Time in loop, 0.2s Time in total, Has Loop: 1, wrong guesses: 1, overall guesses: 6, Reduction States: 274, Duplicate States: 10, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 131.9ms Time before loop, 308.7ms Time in loop, 0.4s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 10, Reduction States: 527, Duplicate States: 20, Protected Variables: 4 - StatisticsResult: Reduction benchmarks 17.2ms Time before loop, 596.1ms Time in loop, 0.6s Time in total, Has Loop: 1, wrong guesses: 1, overall guesses: 6, Reduction States: 452, Duplicate States: 10, Protected Variables: 4 - StatisticsResult: Reduction benchmarks 485.5ms Time before loop, 990.5ms Time in loop, 1.5s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 10, Reduction States: 972, Duplicate States: 20, Protected Variables: 4 - StatisticsResult: Reduction benchmarks 1210.3ms Time before loop, 1136.0ms Time in loop, 2.3s Time in total, Has Loop: 1, wrong guesses: 2, overall guesses: 10, Reduction States: 1494, Duplicate States: 20, Protected Variables: 4 - StatisticsResult: Reduction benchmarks 33.8ms Time before loop, 747.7ms Time in loop, 0.8s Time in total, Has Loop: 1, wrong guesses: 1, overall guesses: 6, Reduction States: 973, Duplicate States: 10, Protected Variables: 4 - StatisticsResult: Visitor Statistics States: 122, Transitions: 131, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 165, Transitions: 182, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 155, Transitions: 170, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 214, Transitions: 243, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 158, Transitions: 175, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 210, Transitions: 233, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 441, Transitions: 520, Traversal time: 0.4s - StatisticsResult: Visitor Statistics States: 332, Transitions: 373, Traversal time: 0.6s - StatisticsResult: Visitor Statistics States: 827, Transitions: 978, Traversal time: 1.5s - StatisticsResult: Visitor Statistics States: 1336, Transitions: 1595, Traversal time: 2.3s - StatisticsResult: Visitor Statistics States: 827, Transitions: 958, Traversal time: 0.8s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 40, RedundantProofs: 9, ProvenStates: 692, Times there's more than one choice: 527, Avg number of choices: 5.124277456647399 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1320] 0 int myglobal; VAL [myglobal=0] [L1321] 0 pthread_mutex_t mymutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [myglobal=0] [L1340] 0 pthread_t mythread; VAL [myglobal=0, mythread={3:0}] [L1341] 0 int i; VAL [myglobal=0, mythread={3:0}] [L1342] FCALL, FORK 0 pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0)) VAL [arg={0:0}, myglobal=0, mythread={3:0}] [L1342] COND FALSE 0 !(pthread_create( &mythread, ((void *)0), thread_function_datarace, ((void *)0))) VAL [arg={0:0}, myglobal=0, mythread={3:0}] [L1352] 0 i=0 VAL [arg={0:0}, i=0, myglobal=0, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=0, myglobal=0, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=0, myglobal=1, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=1, myglobal=1, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=1, myglobal=1, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=1, myglobal=2, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=2, myglobal=2, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=2, myglobal=2, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=2, myglobal=3, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=3, myglobal=3, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=3, myglobal=3, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=3, myglobal=4, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=4, myglobal=4, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=4, myglobal=4, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=4, myglobal=5, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=5, myglobal=5, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=5, myglobal=5, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=5, myglobal=6, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=6, myglobal=6, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=6, myglobal=6, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=6, myglobal=7, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=7, myglobal=7, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=7, myglobal=7, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=7, myglobal=8, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=8, myglobal=8, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=8, myglobal=8, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=8, myglobal=9, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=9, myglobal=9, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=9, myglobal=9, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=9, myglobal=10, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=10, myglobal=10, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=10, myglobal=10, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=10, myglobal=11, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=11, myglobal=11, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=11, myglobal=11, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=11, myglobal=12, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=12, myglobal=12, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=12, myglobal=12, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=12, myglobal=13, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=13, myglobal=13, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=13, myglobal=13, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=13, myglobal=14, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=14, myglobal=14, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=14, myglobal=14, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=14, myglobal=15, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=15, myglobal=15, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=15, myglobal=15, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=15, myglobal=16, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=16, myglobal=16, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=16, myglobal=16, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=16, myglobal=17, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=17, myglobal=17, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=17, myglobal=17, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=17, myglobal=18, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=18, myglobal=18, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=18, myglobal=18, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=18, myglobal=19, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=19, myglobal=19, mythread={3:0}] [L1352] COND TRUE 0 i<20 VAL [arg={0:0}, i=19, myglobal=19, mythread={3:0}] [L1355] 0 myglobal=myglobal+1 VAL [arg={0:0}, i=19, myglobal=20, mythread={3:0}] [L1352] 0 i++ VAL [arg={0:0}, i=20, myglobal=20, mythread={3:0}] [L1352] COND FALSE 0 !(i<20) VAL [arg={0:0}, i=20, myglobal=20, mythread={3:0}] [L1358] 0 \read(mythread) VAL [arg={0:0}, i=20, myglobal=20, mythread={3:0}] [L1324] 1 int i,j; VAL [arg={0:0}, arg={0:0}, myglobal=20] [L1325] 1 i=0 VAL [arg={0:0}, arg={0:0}, i=0, myglobal=20] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=0, myglobal=20] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=0, j=20, myglobal=20] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=0, j=21, myglobal=20] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=0, j=21, myglobal=21] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=1, j=21, myglobal=21] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=1, j=21, myglobal=21] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=1, j=21, myglobal=21] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=1, j=22, myglobal=21] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=1, j=22, myglobal=22] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=2, j=22, myglobal=22] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=2, j=22, myglobal=22] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=2, j=22, myglobal=22] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=2, j=23, myglobal=22] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=2, j=23, myglobal=23] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=3, j=23, myglobal=23] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=3, j=23, myglobal=23] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=3, j=23, myglobal=23] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=3, j=24, myglobal=23] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=3, j=24, myglobal=24] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=4, j=24, myglobal=24] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=4, j=24, myglobal=24] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=4, j=24, myglobal=24] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=4, j=25, myglobal=24] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=4, j=25, myglobal=25] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=5, j=25, myglobal=25] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=5, j=25, myglobal=25] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=5, j=25, myglobal=25] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=5, j=26, myglobal=25] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=5, j=26, myglobal=26] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=6, j=26, myglobal=26] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=6, j=26, myglobal=26] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=6, j=26, myglobal=26] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=6, j=27, myglobal=26] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=6, j=27, myglobal=27] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=7, j=27, myglobal=27] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=7, j=27, myglobal=27] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=7, j=27, myglobal=27] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=7, j=28, myglobal=27] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=7, j=28, myglobal=28] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=8, j=28, myglobal=28] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=8, j=28, myglobal=28] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=8, j=28, myglobal=28] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=8, j=29, myglobal=28] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=8, j=29, myglobal=29] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=9, j=29, myglobal=29] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=9, j=29, myglobal=29] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=9, j=29, myglobal=29] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=9, j=30, myglobal=29] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=9, j=30, myglobal=30] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=10, j=30, myglobal=30] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=10, j=30, myglobal=30] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=10, j=30, myglobal=30] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=10, j=31, myglobal=30] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=10, j=31, myglobal=31] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=11, j=31, myglobal=31] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=11, j=32, myglobal=31] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=11, j=32, myglobal=32] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=12, j=32, myglobal=32] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=12, j=33, myglobal=32] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=12, j=33, myglobal=33] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=13, j=33, myglobal=33] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=13, j=34, myglobal=33] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=13, j=34, myglobal=34] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=14, j=34, myglobal=34] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=14, j=35, myglobal=34] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=14, j=35, myglobal=35] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=15, j=35, myglobal=35] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=15, j=36, myglobal=35] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=15, j=36, myglobal=36] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=16, j=36, myglobal=36] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=16, j=37, myglobal=36] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=16, j=37, myglobal=37] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=17, j=37, myglobal=37] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=17, j=38, myglobal=37] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=17, j=38, myglobal=38] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=18, j=38, myglobal=38] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=18, j=39, myglobal=38] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=18, j=39, myglobal=39] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1325] COND TRUE 1 i<20 VAL [arg={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1328] 1 j=myglobal VAL [arg={0:0}, arg={0:0}, i=19, j=39, myglobal=39] [L1330] 1 j=j+1 VAL [arg={0:0}, arg={0:0}, i=19, j=40, myglobal=39] [L1333] 1 myglobal=j VAL [arg={0:0}, arg={0:0}, i=19, j=40, myglobal=40] [L1325] 1 i++ VAL [arg={0:0}, arg={0:0}, i=20, j=40, myglobal=40] [L1325] COND FALSE 1 !(i<20) VAL [arg={0:0}, arg={0:0}, i=20, j=40, myglobal=40] [L1336] 1 return ((void *)0); VAL [\result={0:0}, arg={0:0}, arg={0:0}, i=20, j=40, myglobal=40] [L1358] FCALL, JOIN 1 pthread_join ( mythread, ((void *)0) ) VAL [\result={0:0}, arg={0:0}, arg={0:0}, i=20, i=20, j=40, myglobal=40, mythread={3:0}] [L1358] COND FALSE 0 !(pthread_join ( mythread, ((void *)0) )) VAL [\result={0:0}, arg={0:0}, arg={0:0}, i=20, i=20, j=40, myglobal=40, mythread={3:0}] [L1362] CALL 0 __VERIFIER_assert(myglobal != 40) [L13] COND TRUE 0 !(cond) VAL [\old(cond)=0, \result={0:0}, arg={0:0}, arg={0:0}, cond=0, i=20, j=40, myglobal=40] [L13] 0 reach_error() VAL [\old(cond)=0, \result={0:0}, arg={0:0}, arg={0:0}, cond=0, i=20, j=40, myglobal=40] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances CFG has 3 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 16.4s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 8, EmptinessCheckTime: 6.6s, 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: 394, 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.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 2710 NumberOfCodeBlocks, 2685 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 3462 ConstructedInterpolants, 0 QuantifiedInterpolants, 5432 SizeOfPredicates, 98 NumberOfNonLiveVariables, 2009 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 25 InterpolantComputations, 3 PerfectInterpolantSequences, 8629/14420 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 14:41:12,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2024-05-30 14:41:12,687 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...