/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 16:21:22,826 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 16:21:22,884 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-30 16:21:22,888 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 16:21:22,889 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 16:21:22,889 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-30 16:21:22,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 16:21:22,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 16:21:22,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 16:21:22,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 16:21:22,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 16:21:22,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 16:21:22,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 16:21:22,919 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 16:21:22,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 16:21:22,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 16:21:22,920 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 16:21:22,920 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 16:21:22,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 16:21:22,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 16:21:22,920 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 16:21:22,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 16:21:22,921 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 16:21:22,921 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 16:21:22,921 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 16:21:22,921 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 16:21:22,921 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 16:21:22,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 16:21:22,921 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 16:21:22,922 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 16:21:22,922 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 16:21:22,923 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 16:21:22,923 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 16:21:22,923 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-30 16:21:22,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 16:21:22,923 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 16:21:22,923 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-30 16:21:22,924 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-30 16:21:22,924 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 16:21:22,924 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 16:21:22,924 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 16:21:22,924 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 16:21:23,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 16:21:23,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 16:21:23,176 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 16:21:23,176 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 16:21:23,177 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 16:21:23,178 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2024-05-30 16:21:24,169 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 16:21:24,309 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 16:21:24,309 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2024-05-30 16:21:24,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b96bc2600/bcabdf4a557f4155acf91e6f75f72e79/FLAGfaf599a52 [2024-05-30 16:21:24,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b96bc2600/bcabdf4a557f4155acf91e6f75f72e79 [2024-05-30 16:21:24,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 16:21:24,351 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 16:21:24,353 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 16:21:24,353 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 16:21:24,357 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 16:21:24,358 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 04:21:24" (1/1) ... [2024-05-30 16:21:24,358 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@289c390c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:21:24, skipping insertion in model container [2024-05-30 16:21:24,359 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 04:21:24" (1/1) ... [2024-05-30 16:21:24,380 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 16:21:24,502 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2428,2441] [2024-05-30 16:21:24,510 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 16:21:24,517 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 16:21:24,531 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2428,2441] [2024-05-30 16:21:24,535 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 16:21:24,546 INFO L206 MainTranslator]: Completed translation [2024-05-30 16:21:24,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:21:24 WrapperNode [2024-05-30 16:21:24,547 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 16:21:24,548 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 16:21:24,548 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 16:21:24,548 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 16:21:24,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:21:24" (1/1) ... [2024-05-30 16:21:24,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:21:24" (1/1) ... [2024-05-30 16:21:24,577 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 148 [2024-05-30 16:21:24,578 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 16:21:24,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 16:21:24,578 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 16:21:24,579 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 16:21:24,584 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:21:24" (1/1) ... [2024-05-30 16:21:24,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:21:24" (1/1) ... [2024-05-30 16:21:24,587 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:21:24" (1/1) ... [2024-05-30 16:21:24,587 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:21:24" (1/1) ... [2024-05-30 16:21:24,591 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:21:24" (1/1) ... [2024-05-30 16:21:24,594 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:21:24" (1/1) ... [2024-05-30 16:21:24,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:21:24" (1/1) ... [2024-05-30 16:21:24,596 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:21:24" (1/1) ... [2024-05-30 16:21:24,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 16:21:24,628 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 16:21:24,628 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 16:21:24,628 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 16:21:24,629 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:21:24" (1/1) ... [2024-05-30 16:21:24,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 16:21:24,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:21:24,669 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 16:21:24,671 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 16:21:24,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 16:21:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 16:21:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 16:21:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-30 16:21:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-30 16:21:24,711 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-30 16:21:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-30 16:21:24,711 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-30 16:21:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 16:21:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-30 16:21:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-30 16:21:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-30 16:21:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 16:21:24,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 16:21:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 16:21:24,713 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 16:21:24,786 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 16:21:24,787 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 16:21:24,979 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 16:21:25,099 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 16:21:25,099 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-30 16:21:25,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 04:21:25 BoogieIcfgContainer [2024-05-30 16:21:25,099 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 16:21:25,114 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 16:21:25,114 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 16:21:25,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 16:21:25,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 04:21:24" (1/3) ... [2024-05-30 16:21:25,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3003bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 04:21:25, skipping insertion in model container [2024-05-30 16:21:25,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:21:24" (2/3) ... [2024-05-30 16:21:25,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3003bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 04:21:25, skipping insertion in model container [2024-05-30 16:21:25,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 04:21:25" (3/3) ... [2024-05-30 16:21:25,118 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2024-05-30 16:21:25,125 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 16:21:25,133 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 16:21:25,133 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-30 16:21:25,133 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 16:21:25,187 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-30 16:21:25,226 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:21:25,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 16:21:25,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:21:25,229 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 16:21:25,233 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 16:21:25,281 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 16:21:25,288 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 16:21:25,293 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3a250791, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:21:25,293 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 16:21:25,298 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:21:25,371 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:21:25,371 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:21:25,371 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:21:25,390 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:21:25,390 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:21:25,390 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:21:25,406 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:21:25,407 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:21:25,407 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:21:25,469 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 170 states. [2024-05-30 16:21:25,469 INFO L212 cStratifiedReduction]: Copied states 6 times. [2024-05-30 16:21:25,472 INFO L78 Accepts]: Start accepts. Automaton has currently 171 states, but on-demand construction may add more states Word has length 101 [2024-05-30 16:21:25,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:21:25,475 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:21:25,478 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:21:25,479 INFO L85 PathProgramCache]: Analyzing trace with hash 934353740, now seen corresponding path program 1 times [2024-05-30 16:21:25,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:21:25,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032770191] [2024-05-30 16:21:25,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:21:25,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:21:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:21:25,736 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-05-30 16:21:25,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:21:25,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032770191] [2024-05-30 16:21:25,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032770191] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:21:25,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:21:25,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 16:21:25,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121710046] [2024-05-30 16:21:25,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:21:25,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 16:21:25,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:21:25,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 16:21:25,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 16:21:25,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:21:25,768 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:21:25,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 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 16:21:25,769 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:21:25,770 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:21:25,812 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:21:25,813 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:21:25,813 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:21:25,833 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:21:25,833 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:21:25,834 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:21:25,852 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:21:25,853 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:21:25,853 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:21:25,868 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 182 states. [2024-05-30 16:21:25,868 INFO L212 cStratifiedReduction]: Copied states 6 times. [2024-05-30 16:21:25,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:21:25,868 INFO L78 Accepts]: Start accepts. Automaton has currently 183 states, but on-demand construction may add more states Word has length 98 [2024-05-30 16:21:25,869 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:21:25,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 16:21:25,869 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:21:25,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:21:25,870 INFO L85 PathProgramCache]: Analyzing trace with hash 2036223355, now seen corresponding path program 1 times [2024-05-30 16:21:25,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:21:25,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589250690] [2024-05-30 16:21:25,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:21:25,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:21:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:21:26,134 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:21:26,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:21:26,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589250690] [2024-05-30 16:21:26,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589250690] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:21:26,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:21:26,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-05-30 16:21:26,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706024731] [2024-05-30 16:21:26,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:21:26,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-30 16:21:26,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:21:26,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-30 16:21:26,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-05-30 16:21:26,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:21:26,139 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:21:26,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 7 states have internal predecessors, (93), 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 16:21:26,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:21:26,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:21:26,140 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:21:26,264 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:21:26,265 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:21:26,265 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:21:26,291 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:21:26,291 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:21:26,291 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:21:26,303 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:21:26,303 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:21:26,303 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:21:26,324 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 190 states. [2024-05-30 16:21:26,324 INFO L212 cStratifiedReduction]: Copied states 6 times. [2024-05-30 16:21:26,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:21:26,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:21:26,325 INFO L78 Accepts]: Start accepts. Automaton has currently 191 states, but on-demand construction may add more states Word has length 106 [2024-05-30 16:21:26,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:21:26,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-30 16:21:26,329 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:21:26,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:21:26,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1661611297, now seen corresponding path program 1 times [2024-05-30 16:21:26,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:21:26,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193230434] [2024-05-30 16:21:26,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:21:26,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:21:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:21:26,641 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:21:26,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:21:26,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193230434] [2024-05-30 16:21:26,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193230434] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:21:26,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943465463] [2024-05-30 16:21:26,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:21:26,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:21:26,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:21:26,690 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 16:21:26,715 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 16:21:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:21:26,785 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 10 conjunts are in the unsatisfiable core [2024-05-30 16:21:26,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:21:27,010 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:21:27,011 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:21:27,227 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:21:27,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943465463] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:21:27,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:21:27,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-05-30 16:21:27,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525028736] [2024-05-30 16:21:27,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:21:27,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-05-30 16:21:27,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:21:27,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-05-30 16:21:27,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2024-05-30 16:21:27,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:21:27,234 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:21:27,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 6.875) internal successors, (165), 24 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 16:21:27,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:21:27,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:21:27,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:21:27,234 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:21:27,460 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:21:27,460 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:21:27,461 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:21:27,470 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:21:27,470 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:21:27,470 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:21:27,479 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:21:27,479 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:21:27,479 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:21:27,502 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 199 states. [2024-05-30 16:21:27,503 INFO L212 cStratifiedReduction]: Copied states 6 times. [2024-05-30 16:21:27,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:21:27,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:21:27,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 16:21:27,503 INFO L78 Accepts]: Start accepts. Automaton has currently 200 states, but on-demand construction may add more states Word has length 114 [2024-05-30 16:21:27,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:21:27,511 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 16:21:27,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-05-30 16:21:27,711 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:21:27,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:21:27,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1309428669, now seen corresponding path program 2 times [2024-05-30 16:21:27,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:21:27,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982479992] [2024-05-30 16:21:27,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:21:27,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:21:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:21:27,959 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-30 16:21:27,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:21:27,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982479992] [2024-05-30 16:21:27,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982479992] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:21:27,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905171570] [2024-05-30 16:21:27,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 16:21:27,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:21:27,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:21:27,962 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 16:21:27,986 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 16:21:28,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 16:21:28,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:21:28,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-30 16:21:28,059 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:21:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-30 16:21:28,200 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:21:28,302 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-30 16:21:28,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905171570] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:21:28,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:21:28,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2024-05-30 16:21:28,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960580030] [2024-05-30 16:21:28,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:21:28,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-05-30 16:21:28,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:21:28,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-05-30 16:21:28,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2024-05-30 16:21:28,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:21:28,306 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:21:28,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.130434782608695) internal successors, (210), 23 states have internal predecessors, (210), 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 16:21:28,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:21:28,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:21:28,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 16:21:28,307 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:21:28,307 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:21:28,607 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:21:28,607 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:21:28,607 INFO L395 cStratifiedReduction]: Actual level: [] [2024-05-30 16:21:28,620 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:21:28,620 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1#1, ~N~0, ULTIMATE.start_create_fresh_int_array_#t~post16#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-30 16:21:28,620 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1#1, ~N~0, ULTIMATE.start_create_fresh_int_array_#t~post16#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-30 16:21:28,673 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 234 states. [2024-05-30 16:21:28,673 INFO L212 cStratifiedReduction]: Copied states 5 times. [2024-05-30 16:21:28,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:21:28,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:21:28,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 16:21:28,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-30 16:21:28,674 INFO L78 Accepts]: Start accepts. Automaton has currently 247 states, but on-demand construction may add more states Word has length 126 [2024-05-30 16:21:28,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:21:28,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-30 16:21:28,880 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 16:21:28,881 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:21:28,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:21:28,881 INFO L85 PathProgramCache]: Analyzing trace with hash -943127753, now seen corresponding path program 3 times [2024-05-30 16:21:28,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:21:28,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878355631] [2024-05-30 16:21:28,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:21:28,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:21:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:21:29,131 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-30 16:21:29,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:21:29,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878355631] [2024-05-30 16:21:29,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878355631] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:21:29,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791047003] [2024-05-30 16:21:29,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 16:21:29,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:21:29,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:21:29,133 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 16:21:29,136 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 16:21:29,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-05-30 16:21:29,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:21:29,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 14 conjunts are in the unsatisfiable core [2024-05-30 16:21:29,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:21:29,559 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-30 16:21:29,559 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:21:29,783 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-05-30 16:21:29,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791047003] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:21:29,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:21:29,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2024-05-30 16:21:29,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685831083] [2024-05-30 16:21:29,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:21:29,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-05-30 16:21:29,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:21:29,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-05-30 16:21:29,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2024-05-30 16:21:29,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:21:29,790 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:21:29,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.882352941176471) internal successors, (200), 34 states have internal predecessors, (200), 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 16:21:29,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:21:29,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:21:29,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 16:21:29,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-30 16:21:29,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:21:29,791 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:21:30,051 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:21:30,052 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:21:30,052 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1#1, ~N~0, ULTIMATE.start_create_fresh_int_array_#t~post16#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-30 16:21:30,058 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:21:30,058 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1#1, ~N~0, ULTIMATE.start_create_fresh_int_array_#t~post16#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-30 16:21:30,059 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1#1, ~N~0, ULTIMATE.start_create_fresh_int_array_#t~post16#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-30 16:21:30,069 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:21:30,070 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1#1, ~N~0, ULTIMATE.start_create_fresh_int_array_#t~post16#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-30 16:21:30,070 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1#1, ~N~0, ULTIMATE.start_create_fresh_int_array_#t~post16#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-30 16:21:30,098 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 252 states. [2024-05-30 16:21:30,098 INFO L212 cStratifiedReduction]: Copied states 14 times. [2024-05-30 16:21:30,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:21:30,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:21:30,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 16:21:30,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-30 16:21:30,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-05-30 16:21:30,099 INFO L78 Accepts]: Start accepts. Automaton has currently 256 states, but on-demand construction may add more states Word has length 134 [2024-05-30 16:21:30,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:21:30,113 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 16:21:30,305 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 16:21:30,306 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:21:30,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:21:30,306 INFO L85 PathProgramCache]: Analyzing trace with hash -674477413, now seen corresponding path program 4 times [2024-05-30 16:21:30,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:21:30,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606763447] [2024-05-30 16:21:30,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:21:30,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:21:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:21:30,569 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 33 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:21:30,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:21:30,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606763447] [2024-05-30 16:21:30,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606763447] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:21:30,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818687839] [2024-05-30 16:21:30,570 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 16:21:30,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:21:30,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:21:30,572 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 16:21:30,574 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 16:21:30,649 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 16:21:30,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:21:30,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 14 conjunts are in the unsatisfiable core [2024-05-30 16:21:30,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:21:30,873 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 24 proven. 25 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:21:30,873 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:21:31,151 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 27 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-05-30 16:21:31,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818687839] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:21:31,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:21:31,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2024-05-30 16:21:31,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071790882] [2024-05-30 16:21:31,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:21:31,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-05-30 16:21:31,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:21:31,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-05-30 16:21:31,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=918, Unknown=0, NotChecked=0, Total=1122 [2024-05-30 16:21:31,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:21:31,153 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:21:31,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 6.735294117647059) internal successors, (229), 34 states have internal predecessors, (229), 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 16:21:31,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:21:31,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:21:31,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-05-30 16:21:31,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-05-30 16:21:31,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2024-05-30 16:21:31,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:21:31,154 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:21:31,517 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:21:31,517 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:21:31,517 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1#1, ~N~0, ULTIMATE.start_create_fresh_int_array_#t~post16#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-30 16:21:31,521 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:21:31,521 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1#1, ~N~0, ULTIMATE.start_create_fresh_int_array_#t~post16#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-30 16:21:31,521 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1#1, ~N~0, ULTIMATE.start_create_fresh_int_array_#t~post16#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-30 16:21:31,531 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:21:31,531 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1#1, ~N~0, ULTIMATE.start_create_fresh_int_array_#t~post16#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-30 16:21:31,531 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~2#1, ULTIMATE.start_create_fresh_int_array_~size#1, ULTIMATE.start_create_fresh_int_array_#in~size#1, thread2Thread1of1ForFork1_#t~post4#1, thread1Thread1of1ForFork0_#t~post1#1, ~N~0, ULTIMATE.start_create_fresh_int_array_#t~post16#1, thread2Thread1of1ForFork1_~i~1#1, thread1Thread1of1ForFork0_~i~0#1] [2024-05-30 16:21:31,561 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 273 states. [2024-05-30 16:21:31,561 INFO L212 cStratifiedReduction]: Copied states 14 times. [2024-05-30 16:21:31,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:21:31,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:21:31,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-05-30 16:21:31,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-05-30 16:21:31,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-05-30 16:21:31,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-30 16:21:31,562 INFO L78 Accepts]: Start accepts. Automaton has currently 283 states, but on-demand construction may add more states Word has length 140 [2024-05-30 16:21:31,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:21:31,570 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 16:21:31,770 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 16:21:31,770 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:21:31,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:21:31,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1648807243, now seen corresponding path program 5 times [2024-05-30 16:21:31,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:21:31,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132306414] [2024-05-30 16:21:31,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:21:31,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:21:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 16:21:31,850 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-30 16:21:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-30 16:21:31,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-30 16:21:31,917 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-30 16:21:31,918 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 16:21:31,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-30 16:21:31,923 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1] [2024-05-30 16:21:31,924 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was UNSAFE (1/3) [2024-05-30 16:21:31,927 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-30 16:21:31,927 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-30 16:21:32,022 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-05-30 16:21:32,031 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-05-30 16:21:32,034 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2024-05-30 16:21:32,050 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.05 04:21:32 BasicIcfg [2024-05-30 16:21:32,050 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-30 16:21:32,050 INFO L158 Benchmark]: Toolchain (without parser) took 7699.28ms. Allocated memory was 296.7MB in the beginning and 382.7MB in the end (delta: 86.0MB). Free memory was 226.7MB in the beginning and 343.4MB in the end (delta: -116.7MB). Peak memory consumption was 185.1MB. Max. memory is 8.0GB. [2024-05-30 16:21:32,050 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 180.4MB. Free memory is still 149.4MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 16:21:32,051 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.76ms. Allocated memory is still 296.7MB. Free memory was 226.5MB in the beginning and 214.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2024-05-30 16:21:32,051 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.35ms. Allocated memory is still 296.7MB. Free memory was 214.3MB in the beginning and 212.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 16:21:32,051 INFO L158 Benchmark]: Boogie Preprocessor took 19.39ms. Allocated memory is still 296.7MB. Free memory was 212.3MB in the beginning and 210.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-30 16:21:32,051 INFO L158 Benchmark]: RCFGBuilder took 479.42ms. Allocated memory is still 296.7MB. Free memory was 266.4MB in the beginning and 237.0MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2024-05-30 16:21:32,051 INFO L158 Benchmark]: TraceAbstraction took 6936.32ms. Allocated memory was 296.7MB in the beginning and 382.7MB in the end (delta: 86.0MB). Free memory was 235.9MB in the beginning and 343.4MB in the end (delta: -107.4MB). Peak memory consumption was 193.5MB. Max. memory is 8.0GB. [2024-05-30 16:21:32,053 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 180.4MB. Free memory is still 149.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.76ms. Allocated memory is still 296.7MB. Free memory was 226.5MB in the beginning and 214.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.35ms. Allocated memory is still 296.7MB. Free memory was 214.3MB in the beginning and 212.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.39ms. Allocated memory is still 296.7MB. Free memory was 212.3MB in the beginning and 210.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 479.42ms. Allocated memory is still 296.7MB. Free memory was 266.4MB in the beginning and 237.0MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 6936.32ms. Allocated memory was 296.7MB in the beginning and 382.7MB in the end (delta: 86.0MB). Free memory was 235.9MB in the beginning and 343.4MB in the end (delta: -107.4MB). Peak memory consumption was 193.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 392, independent: 313, independent conditional: 313, independent unconditional: 0, dependent: 79, dependent conditional: 79, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 327, independent: 313, independent conditional: 313, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 327, independent: 313, independent conditional: 313, independent unconditional: 0, dependent: 14, dependent conditional: 14, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 369, independent: 313, independent conditional: 0, independent unconditional: 313, dependent: 56, dependent conditional: 42, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 369, independent: 313, independent conditional: 0, independent unconditional: 313, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 369, independent: 313, independent conditional: 0, independent unconditional: 313, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 327, independent: 313, independent conditional: 0, independent unconditional: 313, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 327, independent: 313, independent conditional: 0, independent unconditional: 313, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 45, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 369, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 327, unknown conditional: 0, unknown unconditional: 327] , Statistics on independence cache: Total cache size (in pairs): 327, Positive cache size: 313, Positive conditional cache size: 0, Positive unconditional cache size: 313, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 42, Maximal queried relation: 6, Independence queries for same thread: 65 - StatisticsResult: Reduction benchmarks 12.5ms Time before loop, 157.7ms Time in loop, 0.2s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 8, Reduction States: 170, Duplicate States: 6, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 17.4ms Time before loop, 79.7ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 8, Reduction States: 182, Duplicate States: 6, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 76.6ms Time before loop, 107.5ms Time in loop, 0.2s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 8, Reduction States: 190, Duplicate States: 6, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 159.2ms Time before loop, 108.8ms Time in loop, 0.3s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 8, Reduction States: 199, Duplicate States: 6, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 160.0ms Time before loop, 205.8ms Time in loop, 0.4s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 7, Reduction States: 234, Duplicate States: 5, Protected Variables: 9 - StatisticsResult: Reduction benchmarks 195.6ms Time before loop, 110.7ms Time in loop, 0.3s Time in total, Has Loop: 1, wrong guesses: 1, overall guesses: 8, Reduction States: 252, Duplicate States: 14, Protected Variables: 9 - StatisticsResult: Reduction benchmarks 215.7ms Time before loop, 190.7ms Time in loop, 0.4s Time in total, Has Loop: 1, wrong guesses: 1, overall guesses: 8, Reduction States: 273, Duplicate States: 14, Protected Variables: 9 - StatisticsResult: Visitor Statistics States: 144, Transitions: 154, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 144, Transitions: 157, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 151, Transitions: 164, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 159, Transitions: 172, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 184, Transitions: 203, Traversal time: 0.4s - StatisticsResult: Visitor Statistics States: 201, Transitions: 222, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 219, Transitions: 244, Traversal time: 0.4s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 13, RedundantProofs: 4, ProvenStates: 63, Times there's more than one choice: 47, Avg number of choices: 3.365079365079365 - CounterExampleResult [Line: 87]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int* A; VAL [A={0:0}] [L42] 0 int counter, N; VAL [A={0:0}, N=0, counter=0] [L75] 0 pthread_t t1, t2; VAL [A={0:0}, N=0, counter=0, t1={6:0}, t2={5:0}] [L77] 0 N = __VERIFIER_nondet_int() VAL [A={0:0}, N=3, counter=0, t1={6:0}, t2={5:0}] [L78] CALL, EXPR 0 create_fresh_int_array(N) [L93] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) VAL [A={0:0}, N=3, \old(cond)=1, cond=1, counter=0] [L93] RET 0 assume_abort_if_not(size >= 0) [L94] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) VAL [A={0:0}, N=3, \old(cond)=1, cond=1, counter=0] [L94] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L96] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); VAL [A={0:0}, N=3, \old(size)=3, arr={3:0}, counter=0, size=3] [L97] 0 int i = 0; VAL [A={0:0}, N=3, \old(size)=3, arr={3:0}, counter=0, i=0, size=3] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=3, \old(size)=3, arr={3:0}, counter=0, i=0, size=3] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=3, \old(size)=3, arr={3:0}, counter=0, i=0, size=3] [L97] 0 i++ VAL [A={0:0}, N=3, \old(size)=3, arr={3:0}, counter=0, i=1, size=3] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=3, \old(size)=3, arr={3:0}, counter=0, i=1, size=3] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=3, \old(size)=3, arr={3:0}, counter=0, i=1, size=3] [L97] 0 i++ VAL [A={0:0}, N=3, \old(size)=3, arr={3:0}, counter=0, i=2, size=3] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=3, \old(size)=3, arr={3:0}, counter=0, i=2, size=3] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=3, \old(size)=3, arr={3:0}, counter=0, i=2, size=3] [L97] 0 i++ VAL [A={0:0}, N=3, \old(size)=3, arr={3:0}, counter=0, i=3, size=3] [L97] COND FALSE 0 !(i < size) VAL [A={0:0}, N=3, \old(size)=3, arr={3:0}, counter=0, i=3, size=3] [L100] 0 return arr; VAL [A={0:0}, N=3, \old(size)=3, \result={3:0}, arr={3:0}, counter=0, size=3] [L78] RET, EXPR 0 create_fresh_int_array(N) [L78] 0 A = create_fresh_int_array(N) VAL [A={3:0}, N=3, counter=0, t1={6:0}, t2={5:0}] [L81] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={3:0}, N=3, counter=0, t1={6:0}, t2={5:0}] [L82] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={3:0}, N=3, counter=0, t1={6:0}, t2={5:0}] [L83] 0 \read(t1) VAL [A={3:0}, N=3, counter=0, t1={6:0}, t2={5:0}] [L49] 1 int i=0; VAL [A={3:0}, N=3, counter=0, i=0] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={3:0}, N=3, counter=9, i=0, tmp=9] [L49] 1 i++ VAL [A={3:0}, N=3, counter=9, i=1, tmp=9] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L62] 2 int i=0; VAL [A={3:0}, N=3, counter=9, i=0] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L54] 1 counter = tmp VAL [A={3:0}, N=3, counter=16, i=1, tmp=16] [L49] 1 i++ VAL [A={3:0}, N=3, counter=16, i=2, tmp=16] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp VAL [A={3:0}, N=3, counter=0, i=2, tmp=0] [L49] 1 i++ VAL [A={3:0}, N=3, counter=0, i=3, tmp=0] [L49] COND FALSE 1 !(i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={3:0}, N=3, counter=-7, i=1, tmp=-7] [L62] 2 i++ VAL [A={3:0}, N=3, counter=-7, i=2, tmp=-7] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={3:0}, N=3, counter=-7, i=2, tmp=-7] [L62] 2 i++ VAL [A={3:0}, N=3, counter=-7, i=3, tmp=-7] [L62] COND FALSE 2 !(i