/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 18:25:33,864 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 18:25:33,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf [2024-05-30 18:25:33,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 18:25:33,949 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 18:25:33,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 18:25:33,979 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 18:25:33,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 18:25:33,980 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 18:25:33,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 18:25:33,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 18:25:33,984 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 18:25:33,985 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 18:25:33,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 18:25:33,987 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 18:25:33,987 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 18:25:33,987 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 18:25:33,988 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 18:25:33,988 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 18:25:33,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 18:25:33,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 18:25:33,989 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 18:25:33,990 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 18:25:33,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 18:25:33,990 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 18:25:33,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 18:25:33,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 18:25:33,991 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 18:25:33,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 18:25:33,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 18:25:33,993 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 18:25:33,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 18:25:33,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 18:25:33,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 18:25:33,994 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2024-05-30 18:25:33,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-30 18:25:33,994 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 18:25:33,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 18:25:33,994 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 18:25:33,995 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2024-05-30 18:25:34,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 18:25:34,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 18:25:34,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 18:25:34,325 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 18:25:34,326 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 18:25:34,327 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 18:25:35,509 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 18:25:35,788 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 18:25:35,789 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i [2024-05-30 18:25:35,819 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7bf96997e/5ad7bf7855df44fca7a2129c1feb2bbf/FLAG88d7fa23c [2024-05-30 18:25:35,836 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7bf96997e/5ad7bf7855df44fca7a2129c1feb2bbf [2024-05-30 18:25:35,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 18:25:35,841 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 18:25:35,844 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 18:25:35,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 18:25:35,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 18:25:35,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 06:25:35" (1/1) ... [2024-05-30 18:25:35,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a91a102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:25:35, skipping insertion in model container [2024-05-30 18:25:35,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 06:25:35" (1/1) ... [2024-05-30 18:25:35,921 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 18:25:36,073 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 18:25:36,439 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 18:25:36,450 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 18:25:36,463 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 18:25:36,511 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 18:25:36,683 INFO L206 MainTranslator]: Completed translation [2024-05-30 18:25:36,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:25:36 WrapperNode [2024-05-30 18:25:36,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 18:25:36,685 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 18:25:36,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 18:25:36,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 18:25:36,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:25:36" (1/1) ... [2024-05-30 18:25:36,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:25:36" (1/1) ... [2024-05-30 18:25:36,731 INFO L138 Inliner]: procedures = 365, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2024-05-30 18:25:36,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 18:25:36,732 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 18:25:36,732 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 18:25:36,732 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 18:25:36,739 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:25:36" (1/1) ... [2024-05-30 18:25:36,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:25:36" (1/1) ... [2024-05-30 18:25:36,742 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:25:36" (1/1) ... [2024-05-30 18:25:36,743 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:25:36" (1/1) ... [2024-05-30 18:25:36,747 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:25:36" (1/1) ... [2024-05-30 18:25:36,750 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:25:36" (1/1) ... [2024-05-30 18:25:36,751 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:25:36" (1/1) ... [2024-05-30 18:25:36,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:25:36" (1/1) ... [2024-05-30 18:25:36,755 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 18:25:36,756 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 18:25:36,756 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 18:25:36,756 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 18:25:36,756 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:25:36" (1/1) ... [2024-05-30 18:25:36,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 18:25:36,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 18:25:36,788 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-30 18:25:36,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-30 18:25:36,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-30 18:25:36,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 18:25:36,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 18:25:36,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-30 18:25:36,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-30 18:25:36,849 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2024-05-30 18:25:36,849 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2024-05-30 18:25:36,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 18:25:36,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 18:25:36,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 18:25:36,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 18:25:36,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 18:25:36,852 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-30 18:25:37,024 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 18:25:37,026 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 18:25:37,134 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 18:25:37,142 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 18:25:37,143 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2024-05-30 18:25:37,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 06:25:37 BoogieIcfgContainer [2024-05-30 18:25:37,143 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 18:25:37,146 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 18:25:37,146 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 18:25:37,149 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 18:25:37,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 06:25:35" (1/3) ... [2024-05-30 18:25:37,150 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df32ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 06:25:37, skipping insertion in model container [2024-05-30 18:25:37,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 06:25:36" (2/3) ... [2024-05-30 18:25:37,150 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6df32ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 06:25:37, skipping insertion in model container [2024-05-30 18:25:37,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 06:25:37" (3/3) ... [2024-05-30 18:25:37,151 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2024-05-30 18:25:37,159 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 18:25:37,169 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 18:25:37,169 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-30 18:25:37,169 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 18:25:37,217 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-05-30 18:25:37,261 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 18:25:37,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 18:25:37,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 18:25:37,268 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 18:25:37,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-30 18:25:37,304 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 18:25:37,311 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 18:25:37,316 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@54b6bdc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 18:25:37,316 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 18:25:37,384 INFO L78 Accepts]: Start accepts. Automaton has currently 131 states, but on-demand construction may add more states Word has length 67 [2024-05-30 18:25:37,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:25:37,385 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:25:37,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:25:37,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1372970223, now seen corresponding path program 1 times [2024-05-30 18:25:37,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:25:37,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945324982] [2024-05-30 18:25:37,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:25:37,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:25:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:25:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-30 18:25:37,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:25:37,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945324982] [2024-05-30 18:25:37,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945324982] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 18:25:37,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 18:25:37,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 18:25:37,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982490316] [2024-05-30 18:25:37,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 18:25:37,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 18:25:37,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:25:37,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 18:25:37,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 18:25:37,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:37,719 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:25:37,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 18:25:37,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:37,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:37,790 INFO L78 Accepts]: Start accepts. Automaton has currently 170 states, but on-demand construction may add more states Word has length 65 [2024-05-30 18:25:37,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:25:37,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 18:25:37,791 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:25:37,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:25:37,792 INFO L85 PathProgramCache]: Analyzing trace with hash -631741359, now seen corresponding path program 1 times [2024-05-30 18:25:37,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:25:37,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625370166] [2024-05-30 18:25:37,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:25:37,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:25:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:25:38,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 18:25:38,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:25:38,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625370166] [2024-05-30 18:25:38,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625370166] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 18:25:38,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802753050] [2024-05-30 18:25:38,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:25:38,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 18:25:38,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 18:25:38,066 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 18:25:38,068 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 18:25:38,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:25:38,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-30 18:25:38,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 18:25:38,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 18:25:38,290 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 18:25:38,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 18:25:38,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802753050] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 18:25:38,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 18:25:38,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-05-30 18:25:38,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726710988] [2024-05-30 18:25:38,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 18:25:38,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-30 18:25:38,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:25:38,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-30 18:25:38,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-05-30 18:25:38,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:38,365 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:25:38,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 10 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 18:25:38,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:38,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:38,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:38,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 18:25:38,487 INFO L78 Accepts]: Start accepts. Automaton has currently 147 states, but on-demand construction may add more states Word has length 67 [2024-05-30 18:25:38,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:25:38,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-30 18:25:38,694 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,SelfDestructingSolverStorable1 [2024-05-30 18:25:38,695 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:25:38,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:25:38,696 INFO L85 PathProgramCache]: Analyzing trace with hash 861290520, now seen corresponding path program 1 times [2024-05-30 18:25:38,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:25:38,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184414433] [2024-05-30 18:25:38,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:25:38,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:25:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:25:38,814 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-05-30 18:25:38,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:25:38,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184414433] [2024-05-30 18:25:38,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184414433] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 18:25:38,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 18:25:38,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-30 18:25:38,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360825484] [2024-05-30 18:25:38,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 18:25:38,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-30 18:25:38,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:25:38,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-30 18:25:38,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-30 18:25:38,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:38,817 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:25:38,817 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 18:25:38,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:38,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 18:25:38,817 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:38,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:38,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 18:25:38,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 18:25:38,839 INFO L78 Accepts]: Start accepts. Automaton has currently 175 states, but on-demand construction may add more states Word has length 75 [2024-05-30 18:25:38,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:25:38,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-30 18:25:38,842 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:25:38,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:25:38,843 INFO L85 PathProgramCache]: Analyzing trace with hash -539831471, now seen corresponding path program 2 times [2024-05-30 18:25:38,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:25:38,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735362356] [2024-05-30 18:25:38,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:25:38,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:25:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:25:38,973 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 18:25:38,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:25:38,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735362356] [2024-05-30 18:25:38,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735362356] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 18:25:38,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689303884] [2024-05-30 18:25:38,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 18:25:38,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 18:25:38,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 18:25:38,976 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 18:25:39,012 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 18:25:39,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 18:25:39,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 18:25:39,069 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-30 18:25:39,071 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 18:25:39,141 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 18:25:39,142 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 18:25:39,240 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 18:25:39,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689303884] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 18:25:39,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 18:25:39,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2024-05-30 18:25:39,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647564892] [2024-05-30 18:25:39,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 18:25:39,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-05-30 18:25:39,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:25:39,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-05-30 18:25:39,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2024-05-30 18:25:39,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:39,243 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:25:39,244 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 18:25:39,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:39,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 18:25:39,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 18:25:39,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:39,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:39,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 18:25:39,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 18:25:39,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-30 18:25:39,477 INFO L78 Accepts]: Start accepts. Automaton has currently 247 states, but on-demand construction may add more states Word has length 103 [2024-05-30 18:25:39,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:25:39,488 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 18:25:39,683 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 18:25:39,683 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:25:39,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:25:39,684 INFO L85 PathProgramCache]: Analyzing trace with hash -766908534, now seen corresponding path program 3 times [2024-05-30 18:25:39,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:25:39,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546921029] [2024-05-30 18:25:39,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:25:39,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:25:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:25:40,028 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 18:25:40,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:25:40,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546921029] [2024-05-30 18:25:40,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546921029] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 18:25:40,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23624385] [2024-05-30 18:25:40,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 18:25:40,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 18:25:40,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 18:25:40,031 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 18:25:40,035 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 18:25:40,115 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-05-30 18:25:40,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 18:25:40,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-30 18:25:40,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 18:25:40,204 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 18:25:40,205 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 18:25:40,302 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 18:25:40,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23624385] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 18:25:40,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 18:25:40,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7, 7] total 27 [2024-05-30 18:25:40,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160186679] [2024-05-30 18:25:40,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 18:25:40,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-05-30 18:25:40,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:25:40,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-05-30 18:25:40,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2024-05-30 18:25:40,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:40,311 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:25:40,311 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 18:25:40,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:40,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 18:25:40,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 18:25:40,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-05-30 18:25:40,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:40,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:40,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 18:25:40,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 18:25:40,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 18:25:40,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 18:25:40,840 INFO L78 Accepts]: Start accepts. Automaton has currently 432 states, but on-demand construction may add more states Word has length 137 [2024-05-30 18:25:40,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:25:40,851 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 18:25:41,048 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 18:25:41,049 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:25:41,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:25:41,049 INFO L85 PathProgramCache]: Analyzing trace with hash -2128123083, now seen corresponding path program 4 times [2024-05-30 18:25:41,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:25:41,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914530698] [2024-05-30 18:25:41,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:25:41,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:25:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:25:41,506 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 9 proven. 189 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-05-30 18:25:41,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:25:41,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914530698] [2024-05-30 18:25:41,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914530698] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 18:25:41,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602197109] [2024-05-30 18:25:41,507 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 18:25:41,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 18:25:41,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 18:25:41,509 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 18:25:41,515 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 18:25:41,602 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 18:25:41,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 18:25:41,603 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 20 conjunts are in the unsatisfiable core [2024-05-30 18:25:41,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 18:25:41,688 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 9 proven. 189 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-05-30 18:25:41,688 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 18:25:42,125 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 9 proven. 189 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-05-30 18:25:42,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602197109] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 18:25:42,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 18:25:42,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 42 [2024-05-30 18:25:42,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242418527] [2024-05-30 18:25:42,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 18:25:42,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-05-30 18:25:42,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:25:42,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-05-30 18:25:42,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=462, Invalid=1260, Unknown=0, NotChecked=0, Total=1722 [2024-05-30 18:25:42,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:42,129 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:25:42,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.9285714285714284) internal successors, (165), 42 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 18:25:42,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:42,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 18:25:42,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 18:25:42,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-30 18:25:42,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 18:25:42,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:42,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:42,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 18:25:42,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 18:25:42,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 18:25:42,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 18:25:42,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-05-30 18:25:42,897 INFO L78 Accepts]: Start accepts. Automaton has currently 439 states, but on-demand construction may add more states Word has length 187 [2024-05-30 18:25:42,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:25:42,905 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 18:25:43,104 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 18:25:43,105 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:25:43,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:25:43,105 INFO L85 PathProgramCache]: Analyzing trace with hash 2136305205, now seen corresponding path program 5 times [2024-05-30 18:25:43,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:25:43,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921076629] [2024-05-30 18:25:43,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:25:43,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:25:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:25:44,240 INFO L134 CoverageAnalysis]: Checked inductivity of 959 backedges. 0 proven. 874 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-05-30 18:25:44,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:25:44,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921076629] [2024-05-30 18:25:44,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921076629] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 18:25:44,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715365761] [2024-05-30 18:25:44,241 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-30 18:25:44,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 18:25:44,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 18:25:44,243 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 18:25:44,269 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 18:25:44,356 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2024-05-30 18:25:44,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 18:25:44,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 40 conjunts are in the unsatisfiable core [2024-05-30 18:25:44,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 18:25:44,513 INFO L134 CoverageAnalysis]: Checked inductivity of 959 backedges. 0 proven. 874 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-05-30 18:25:44,513 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 18:25:45,177 INFO L134 CoverageAnalysis]: Checked inductivity of 959 backedges. 0 proven. 874 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-05-30 18:25:45,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715365761] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 18:25:45,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 18:25:45,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 43 [2024-05-30 18:25:45,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242745153] [2024-05-30 18:25:45,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 18:25:45,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-05-30 18:25:45,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:25:45,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-05-30 18:25:45,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2024-05-30 18:25:45,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:45,182 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:25:45,182 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 18:25:45,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:45,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 18:25:45,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 18:25:45,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-30 18:25:45,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 18:25:45,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-05-30 18:25:45,182 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 18:25:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 18:25:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 18:25:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 18:25:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-05-30 18:25:46,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-05-30 18:25:46,092 INFO L78 Accepts]: Start accepts. Automaton has currently 449 states, but on-demand construction may add more states Word has length 192 [2024-05-30 18:25:46,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:25:46,106 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 18:25:46,300 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 18:25:46,301 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:25:46,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:25:46,301 INFO L85 PathProgramCache]: Analyzing trace with hash 471917629, now seen corresponding path program 6 times [2024-05-30 18:25:46,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:25:46,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749476823] [2024-05-30 18:25:46,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:25:46,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:25:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:25:47,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 0 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 18:25:47,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:25:47,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749476823] [2024-05-30 18:25:47,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749476823] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 18:25:47,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099394014] [2024-05-30 18:25:47,277 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-30 18:25:47,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 18:25:47,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 18:25:47,278 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 18:25:47,299 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 18:25:47,369 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2024-05-30 18:25:47,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 18:25:47,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 12 conjunts are in the unsatisfiable core [2024-05-30 18:25:47,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 18:25:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2024-05-30 18:25:47,602 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 18:25:47,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2024-05-30 18:25:47,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099394014] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 18:25:47,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 18:25:47,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 13, 13] total 58 [2024-05-30 18:25:47,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195842765] [2024-05-30 18:25:47,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 18:25:47,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-05-30 18:25:47,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:25:47,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-05-30 18:25:47,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=2742, Unknown=0, NotChecked=0, Total=3306 [2024-05-30 18:25:47,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:47,906 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:25:47,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 5.568965517241379) internal successors, (323), 58 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 18:25:47,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:47,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 18:25:47,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 18:25:47,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-30 18:25:47,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 18:25:47,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-05-30 18:25:47,907 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-05-30 18:25:47,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:49,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:49,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 18:25:49,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 18:25:49,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 18:25:49,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 18:25:49,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-05-30 18:25:49,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-05-30 18:25:49,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-05-30 18:25:49,280 INFO L78 Accepts]: Start accepts. Automaton has currently 718 states, but on-demand construction may add more states Word has length 275 [2024-05-30 18:25:49,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:25:49,292 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 18:25:49,489 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 18:25:49,490 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:25:49,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:25:49,491 INFO L85 PathProgramCache]: Analyzing trace with hash -403179893, now seen corresponding path program 7 times [2024-05-30 18:25:49,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:25:49,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387523851] [2024-05-30 18:25:49,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:25:49,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:25:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:25:51,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 2233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 18:25:51,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:25:51,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387523851] [2024-05-30 18:25:51,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387523851] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 18:25:51,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493759513] [2024-05-30 18:25:51,537 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-05-30 18:25:51,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 18:25:51,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 18:25:51,538 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 18:25:51,551 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 18:25:51,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:25:51,673 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 42 conjunts are in the unsatisfiable core [2024-05-30 18:25:51,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 18:25:53,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 1677 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-05-30 18:25:53,123 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-05-30 18:25:53,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493759513] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 18:25:53,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-05-30 18:25:53,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [54] total 95 [2024-05-30 18:25:53,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734668632] [2024-05-30 18:25:53,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 18:25:53,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-05-30 18:25:53,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:25:53,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-05-30 18:25:53,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1356, Invalid=7574, Unknown=0, NotChecked=0, Total=8930 [2024-05-30 18:25:53,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:53,129 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:25:53,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.86046511627907) internal successors, (166), 43 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 18:25:53,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:53,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 18:25:53,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 18:25:53,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-30 18:25:53,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 18:25:53,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-05-30 18:25:53,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-05-30 18:25:53,129 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2024-05-30 18:25:53,130 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:54,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:54,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 18:25:54,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 18:25:54,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 18:25:54,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 18:25:54,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-05-30 18:25:54,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-05-30 18:25:54,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-05-30 18:25:54,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-05-30 18:25:54,683 INFO L78 Accepts]: Start accepts. Automaton has currently 641 states, but on-demand construction may add more states Word has length 240 [2024-05-30 18:25:54,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:25:54,694 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 18:25:54,891 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 18:25:54,892 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:25:54,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:25:54,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1697469075, now seen corresponding path program 8 times [2024-05-30 18:25:54,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:25:54,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812368532] [2024-05-30 18:25:54,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:25:54,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:25:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 18:25:56,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1421 backedges. 0 proven. 1421 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 18:25:56,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 18:25:56,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812368532] [2024-05-30 18:25:56,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812368532] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 18:25:56,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612168561] [2024-05-30 18:25:56,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 18:25:56,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 18:25:56,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 18:25:56,344 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 18:25:56,346 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 18:25:56,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 18:25:56,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 18:25:56,443 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 24 conjunts are in the unsatisfiable core [2024-05-30 18:25:56,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 18:25:57,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1421 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2024-05-30 18:25:57,099 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 18:25:57,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1421 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2024-05-30 18:25:57,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612168561] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 18:25:57,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 18:25:57,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 25, 25] total 87 [2024-05-30 18:25:57,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587932382] [2024-05-30 18:25:57,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 18:25:57,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2024-05-30 18:25:57,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 18:25:57,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2024-05-30 18:25:57,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1094, Invalid=6388, Unknown=0, NotChecked=0, Total=7482 [2024-05-30 18:25:57,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:57,937 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 18:25:57,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 87 states have (on average 5.091954022988506) internal successors, (443), 87 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 18:25:57,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:25:57,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 18:25:57,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 18:25:57,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-30 18:25:57,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-05-30 18:25:57,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 57 states. [2024-05-30 18:25:57,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2024-05-30 18:25:57,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2024-05-30 18:25:57,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2024-05-30 18:25:57,938 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:26:00,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 18:26:00,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 18:26:00,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 18:26:00,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 18:26:00,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-05-30 18:26:00,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-05-30 18:26:00,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2024-05-30 18:26:00,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-05-30 18:26:00,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-05-30 18:26:00,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2024-05-30 18:26:00,640 INFO L78 Accepts]: Start accepts. Automaton has currently 929 states, but on-demand construction may add more states Word has length 312 [2024-05-30 18:26:00,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 18:26:00,649 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 18:26:00,843 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 18:26:00,843 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 18:26:00,844 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 18:26:00,844 INFO L85 PathProgramCache]: Analyzing trace with hash 836122772, now seen corresponding path program 9 times [2024-05-30 18:26:00,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 18:26:00,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948670275] [2024-05-30 18:26:00,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 18:26:00,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 18:26:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 18:26:00,916 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 18:26:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 18:26:01,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 18:26:01,051 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 18:26:01,052 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 18:26:01,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-05-30 18:26:01,058 INFO L445 BasicCegarLoop]: Path program histogram: [9, 1, 1] [2024-05-30 18:26:01,059 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was UNSAFE (1/2) [2024-05-30 18:26:01,063 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-30 18:26:01,063 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-30 18:26:01,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.05 06:26:01 BasicIcfg [2024-05-30 18:26:01,190 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-30 18:26:01,190 INFO L158 Benchmark]: Toolchain (without parser) took 25348.74ms. Allocated memory was 296.7MB in the beginning and 647.0MB in the end (delta: 350.2MB). Free memory was 224.2MB in the beginning and 404.2MB in the end (delta: -180.1MB). Peak memory consumption was 171.2MB. Max. memory is 8.0GB. [2024-05-30 18:26:01,190 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 296.7MB. Free memory was 265.0MB in the beginning and 264.8MB in the end (delta: 216.7kB). There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 18:26:01,190 INFO L158 Benchmark]: CACSL2BoogieTranslator took 839.74ms. Allocated memory is still 296.7MB. Free memory was 223.9MB in the beginning and 259.7MB in the end (delta: -35.9MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. [2024-05-30 18:26:01,191 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.34ms. Allocated memory is still 296.7MB. Free memory was 259.7MB in the beginning and 257.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 18:26:01,191 INFO L158 Benchmark]: Boogie Preprocessor took 23.14ms. Allocated memory is still 296.7MB. Free memory was 257.1MB in the beginning and 255.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-30 18:26:01,191 INFO L158 Benchmark]: RCFGBuilder took 387.81ms. Allocated memory is still 296.7MB. Free memory was 255.5MB in the beginning and 241.4MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-05-30 18:26:01,191 INFO L158 Benchmark]: TraceAbstraction took 24044.04ms. Allocated memory was 296.7MB in the beginning and 647.0MB in the end (delta: 350.2MB). Free memory was 240.3MB in the beginning and 404.2MB in the end (delta: -163.9MB). Peak memory consumption was 187.3MB. Max. memory is 8.0GB. [2024-05-30 18:26:01,192 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 296.7MB. Free memory was 265.0MB in the beginning and 264.8MB in the end (delta: 216.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 839.74ms. Allocated memory is still 296.7MB. Free memory was 223.9MB in the beginning and 259.7MB in the end (delta: -35.9MB). Peak memory consumption was 44.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.34ms. Allocated memory is still 296.7MB. Free memory was 259.7MB in the beginning and 257.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.14ms. Allocated memory is still 296.7MB. Free memory was 257.1MB in the beginning and 255.5MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 387.81ms. Allocated memory is still 296.7MB. Free memory was 255.5MB in the beginning and 241.4MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 24044.04ms. Allocated memory was 296.7MB in the beginning and 647.0MB in the end (delta: 350.2MB). Free memory was 240.3MB in the beginning and 404.2MB in the end (delta: -163.9MB). Peak memory consumption was 187.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3158, independent: 3046, independent conditional: 3046, independent unconditional: 0, dependent: 112, dependent conditional: 112, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3050, independent: 3046, independent conditional: 3046, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3050, independent: 3046, independent conditional: 3046, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3064, independent: 3046, independent conditional: 0, independent unconditional: 3046, dependent: 18, dependent conditional: 14, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3064, independent: 3046, independent conditional: 0, independent unconditional: 3046, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3064, independent: 3046, independent conditional: 0, independent unconditional: 3046, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 121, independent: 120, independent conditional: 0, independent unconditional: 120, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 121, independent: 120, independent conditional: 0, independent unconditional: 120, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3064, independent: 2926, independent conditional: 0, independent unconditional: 2926, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 121, unknown conditional: 0, unknown unconditional: 121] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 120, Positive conditional cache size: 0, Positive unconditional cache size: 120, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 14, Maximal queried relation: 8, Independence queries for same thread: 108 - StatisticsResult: Visitor Statistics States: 114, Transitions: 122, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 157, Transitions: 165, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 120, Transitions: 124, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 148, Transitions: 152, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 200, Transitions: 204, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 378, Transitions: 385, Traversal time: 0.5s - StatisticsResult: Visitor Statistics States: 332, Transitions: 336, Traversal time: 0.8s - StatisticsResult: Visitor Statistics States: 337, Transitions: 341, Traversal time: 0.9s - StatisticsResult: Visitor Statistics States: 564, Transitions: 569, Traversal time: 1.4s - StatisticsResult: Visitor Statistics States: 529, Transitions: 532, Traversal time: 1.6s - StatisticsResult: Visitor Statistics States: 817, Transitions: 820, Traversal time: 2.7s - 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: 23.8s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 9, EmptinessCheckTime: 8.4s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 459, 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.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 2994 NumberOfCodeBlocks, 2919 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 3656 ConstructedInterpolants, 0 QuantifiedInterpolants, 6931 SizeOfPredicates, 140 NumberOfNonLiveVariables, 2133 ConjunctsInSsa, 156 ConjunctsInUnsatCore, 25 InterpolantComputations, 3 PerfectInterpolantSequences, 6900/16042 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-05-30 18:26:01,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2024-05-30 18:26:01,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...